Sciweavers

858 search results - page 121 / 172
» A Glimpse of Constraint Satisfaction
Sort
View
AI
2000
Springer
13 years 7 months ago
A Lagrangian reconstruction of GENET
GENET is a heuristic repair algorithm which demonstrates impressive e ciency in solving some large-scale and hard instances of constraint satisfaction problems (CSPs). In this pap...
Kenneth M. F. Choi, Jimmy Ho-Man Lee, Peter J. Stu...
AAAI
2006
13 years 9 months ago
A BDD-Based Polytime Algorithm for Cost-Bounded Interactive Configuration
Interactive configurators are decision support systems assisting users in selecting values for parameters that respect given constraints. The underlying knowledge can be convenien...
Tarik Hadzic, Henrik Reif Andersen
BIRTHDAY
2003
Springer
14 years 29 days ago
Comet in Context
Combinatorial optimization problems naturally arise in many application areas, including logistics, manufacturing, supplychain management, and resource allocation. They often give...
Laurent Michel, Pascal Van Hentenryck
CP
2000
Springer
14 years 2 days ago
Extending Forward Checking
Abstract. Among backtracking based algorithms for constraint satisfaction problems (CSPs), algorithms employing constraint propagation, like forward checking (FC) and MAC, have had...
Fahiem Bacchus
CSCLP
2006
Springer
13 years 11 months ago
An Attempt to Dynamically Break Symmetries in the Social Golfers Problem
A number of different satisfaction and optimisation combinatorial problems have recently been approached with constraint programming over the domain of finite sets, for increased d...
Francisco Azevedo