Sciweavers

155 search results - page 12 / 31
» A Conflict Tabu Search Evolutionary Algorithm for Solving Co...
Sort
View
CP
2003
Springer
14 years 23 days ago
Solving Finite Domain Constraint Hierarchies by Local Consistency and Tree Search
We provide a reformulation of the constraint hierarchies (CHs) framework based on the notion of error indicators. Adapting the generalized view of local consistency in semiring-ba...
Stefano Bistarelli, Philippe Codognet, Kin Chuen H...
AMAI
2004
Springer
14 years 28 days ago
New Look-Ahead Schemes for Constraint Satisfaction
This paper presents new look-ahead schemes for backtracking search when solving constraint satisfaction problems. The look-ahead schemes compute a heuristic for value ordering and...
Kalev Kask, Rina Dechter, Vibhav Gogate
CP
2004
Springer
14 years 28 days ago
Counting-Based Look-Ahead Schemes for Constraint Satisfaction
Abstract. The paper presents a new look-ahead scheme for backtracking search for solving constraint satisfaction problems. This look-ahead scheme computes a heuristic for value ord...
Kalev Kask, Rina Dechter, Vibhav Gogate
AAAI
2006
13 years 9 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
AIR
1999
90views more  AIR 1999»
13 years 7 months ago
A Survey of Automated Timetabling
The timetabling problem consists in scheduling a sequence of lectures between teachers and students in a prefixed period of time (typically a week), satisfying a set of constraints...
Andrea Schaerf