365 search results - page 26 / 73 » An Approach to Multiply Segmented Constraint Satisfaction Pr... |
JAL
2008
15 years 12 days ago
2008
An important class of heuristics for constraint satisfaction problems works by sampling information during search in order to inform subsequent decisions. One of these strategies, ...
100
Voted
JAIR
2010
14 years 11 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...
ECSQARU
2007
Springer
15 years 6 months ago
2007
Springer
The representation of both scales of cost and scales of benefit is very natural in a decision-making problem: scales of evaluation of decisions are often bipolar. The aim of this ...
145
Voted
AMAI
1999
Springer
15 years 2 days ago
1999
Springer
Logic programming with the stable model semantics is put forward as a novel constraint programming paradigm. This paradigm is interesting because it bring advantages of logic prog...
129
click to vote
ECAI
2004
Springer
15 years 5 months ago
2004
Springer
In this paper, we present a dynamic and adaptive variable ordering heuristic which guides systematic search toward inconsistent or hard parts of a Constraint Satisfaction Problem (...