419 search results - page 39 / 84 » An LP-Designed Algorithm for Constraint Satisfaction |
CP
2003
Springer
14 years 1 months ago
2003
Springer
Constraint satisfaction has been applied with great success in closed-world scenarios, where all options and constraints are known from the beginning and fixed. With the internet,...
CP
2003
Springer
14 years 1 months ago
2003
Springer
A binary constraints network consists of a set of n variables, defined on domains of size at most d, and a set of e binary constraints. The binary constraint satisfaction problem ...
EMO
2009
Springer
14 years 3 months ago
2009
Springer
To model combinatorial decision problems involving uncertainty and probability, we introduce stochastic constraint programming. Stochastic constraint programs contain both decision...
EVOW
2005
Springer
14 years 2 months ago
2005
Springer
University Course Timetabling-Problems (UCTPs) involve the allocation of resources (such as rooms and timeslots) to all the events of a university, satisfying a set of hard-constra...
JAIR
2010
13 years 7 months ago
2010
Binary Decision Diagram (BDD) based set bounds propagation is a powerful approach to solving set-constraint satisfaction problems. However, prior BDD based techniques incur the si...