Sciweavers

717 search results - page 18 / 144
» Weak-Commitment Search for Solving Constraint Satisfaction P...
Sort
View
CORR
2007
Springer
111views Education» more  CORR 2007»
14 years 9 months ago
Circumspect descent prevails in solving random constraint satisfaction problems
Mikko Alava, John Ardelius, Erik Aurell, Petteri K...
AAAI
2006
14 years 11 months ago
Extending Dynamic Backtracking to Solve Weighted Conditional CSPs
Many planning and design problems can be characterized as optimal search over a constrained network of conditional choices with preferences. To draw upon the advanced methods of c...
Robert T. Effinger, Brian C. Williams
CP
2004
Springer
15 years 3 months 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....
CDB
2004
Springer
143views Database» more  CDB 2004»
15 years 3 months ago
Constraint Processing Techniques for Improving Join Computation: A Proof of Concept
Constraint Processing and Database techniques overlap significantly. We discuss here the application of a constraint satisfaction technique, called dynamic bundling, to databases....
Anagh Lal, Berthe Y. Choueiry