output
19952026
most citedLand Cover Classification via Multi-temporal Spatial Data by Recurrent Neural Networks

291 citations

researchers with a paper here

Counting papers with at most 25 authors, so collaboration author lists do not stand in for the people here.

collaborating institutions
Showing 2009 · cs.AIShow all

8 papers · 2 filters

cs.AI2009★ 1 cited

Decomposition of the NVALUE constraint

Christian Bessiere, George Katsirelos, Nina Narodytska +2

We study decompositions of NVALUE, a global constraint that can be used to model a wide range of problems where values need to be counted. Whilst decomposition typically hinders pr…

cs.AI2009

n-Opposition theory to structure debates

Jean Sallantin, Antoine Seilles

2007 was the first international congress on the ?square of oppositions?. A first attempt to structure debate using n-opposition theory was presented along with the results of a fi…

cs.AI2009★ 58 cited

Circuit Complexity and Decompositions of Global Constraints

Christian Bessiere, George Katsirelos, Nina Narodytska +1

We show that tools from circuit complexity can be used to study decompositions of global constraints. In particular, we study decompositions of global constraints into conjunctive…

cs.AI2009★ 23 cited

Decompositions of All Different, Global Cardinality and Related Constraints

Christian Bessiere, George Katsirelos, Nina Narodytska +2

We show that some common and important global constraints like ALL-DIFFERENT and GCC can be decomposed into simple arithmetic constraints on which we achieve bound or range consist…

cs.AI2009

The Complexity of Reasoning with Global Constraints

Christian Bessiere, Emmanuel Hebrard, Brahim Hnich +1

Constraint propagation is one of the techniques central to the success of constraint programming. To reduce search, fast algorithms associated with each constraint prune the domain…

cs.AI2009★ 42 cited

SLIDE: A Useful Special Case of the CARDPATH Constraint

Christian Bessiere, Emmanuel Hebrard, Brahim Hnich +2

We study the CardPath constraint. This ensures a given constraint holds a number of times down a sequence of variables. We show that SLIDE, a special case of CardPath where the sli…

cs.AI2009★ 28 cited

The Parameterized Complexity of Global Constraints

Christian Bessiere, Emmanuel Hebrard, Brahim Hnich +2

We argue that parameterized complexity is a useful tool with which to study global constraints. In particular, we show that many global constraints which are intractable to propaga…

cs.AI2009

Range and Roots: Two Common Patterns for Specifying and Propagating Counting and Occurrence Constraints

Christian Bessiere, Emmanuel Hebrard, Brahim Hnich +2

We propose Range and Roots which are two common patterns useful for specifying a wide range of counting and occurrence constraints. We design specialised propagation algorithms for…