Sciweavers

942 search results - page 29 / 189
» Distance Constraint Satisfaction Problems
Sort
View
LICS
2009
IEEE
14 years 3 months ago
The Complexity of Global Cardinality Constraints
In a constraint satisfaction problem (CSP) the goal is to find an assignment of a given set of variables subject to specified constraints. A global cardinality constraint is an ...
Andrei A. Bulatov, Dániel Marx
AIPS
2007
13 years 10 months ago
Managing Personal Tasks with Time Constraints and Preferences
This paper treats the problem of managing personal tasks, through an adaptation of the Squeaky Wheel Optimization (SWO) framework, enhanced with powerful heuristics and full const...
Ioannis Refanidis
IJCAI
1989
13 years 9 months ago
Constraint Satisfaction with Delayed Evaluation
This paper describes the design and implementation of a constraint satisfaction system that uses delayed evaluation techniques to provide greater representational power and to avo...
Monte Zweben, Megan Eskey
IPL
2000
96views more  IPL 2000»
13 years 8 months ago
On bounded occurrence constraint satisfaction
An approximation algorithm for a constraint satisfaction problem is said to be nontrivial if its performance ratio is strictly superior to the expected performance of the algorith...
Johan Håstad
IJCAI
2003
13 years 9 months ago
Propagate the Right Thing: How Preferences Can Speed-Up Constraint Solving
We present an algorithm Pref-AC that limits arc consistency (AC) to the preferred choices of a tree search procedure and that makes constraint solving more efficient without chan...
Christian Bessière, Anaïs Fabre, Ulric...