Sciweavers

4524 search results - page 197 / 905
» The Complexity of Global Constraints
Sort
View
SPLC
2008
15 years 8 months ago
Do SAT Solvers Make Good Configurators?
A configuration process is about finding a configuration, a setting, that satisfies the requirements given by the user and constraints imposed by the domain. Feature models are us...
Mikolás Janota
CP
2004
Springer
16 years 20 hour ago
Leveraging the Learning Power of Examples in Automated Constraint Acquisition
Constraint programming is rapidly becoming the technology of choice for modeling and solving complex combinatorial problems. However, users of constraint programming technology nee...
Christian Bessière, Remi Coletta, Eugene C....
STACS
2007
Springer
16 years 22 days ago
Enumerating All Solutions for Constraint Satisfaction Problems
We contribute to the study of efficient enumeration algorithms for all solutions of constraint satisfaction problems. The only algorithm known so far, presented by Creignou and H´...
Henning Schnoor, Ilka Schnoor
CP
2000
Springer
15 years 11 months ago
Constraint-Based Agents: The ABC's of CBA's
The Constraint-Based Agent (CBA) framework is a set of tools for designing, simulating, building, verifying, optimizing, learning and debugging controllers for agents embedded in a...
Alan K. Mackworth
CP
2006
Springer
15 years 10 months ago
Compiling Constraint Networks into AND/OR Multi-valued Decision Diagrams (AOMDDs)
Abstract. Inspired by AND/OR search spaces for graphical models recently introduced, we propose to augment Ordered Decision Diagrams with AND nodes, in order to capture function de...
Robert Mateescu, Rina Dechter