Sciweavers

405 search results - page 3 / 81
» On the Complexity of Global Constraint Satisfaction
Sort
View
IJCAI
2001
13 years 7 months ago
Backtracking Through Biconnected Components of a Constraint Graph
The algorithm presented here, BCC, is an enhancement of the well known Backtrack used to solve constraint satisfaction problems. Though most backtrack improvements rely on propaga...
Jean-François Baget, Yannic S. Tognetti
EMNLP
2007
13 years 7 months ago
A Constraint Satisfaction Approach to Dependency Parsing
We present an adaptation of constraint satisfaction inference (Canisius et al., 2006b) for predicting dependency trees. Three different classifiers are trained to predict weighte...
Sander Canisius, Erik Tjong Kim Sang
CONSTRAINTS
2007
78views more  CONSTRAINTS 2007»
13 years 5 months ago
The Complexity of Reasoning with Global Constraints
Christian Bessiere, Emmanuel Hebrard, Brahim Hnich...
JACM
2010
116views more  JACM 2010»
13 years 4 months ago
The complexity of temporal constraint satisfaction problems
A temporal constraint language is a set of relations that has a first-order definition in (Q, <), the dense linear order of the rational numbers. We present a complete comple...
Manuel Bodirsky, Jan Kára
FOCS
2008
IEEE
13 years 6 months ago
A Dichotomy Theorem for the Resolution Complexity of Random Constraint Satisfaction Problems
We consider random instances of constraint satisfaction problems where each variable has domain size O(1), each constraint is on O(1) variables and the constraints are chosen from...
Siu On Chan, Michael Molloy