711 search results - page 77 / 143 » Amalgams of Constraint Satisfaction Problems |
143
click to vote
JAIR
2010
15 years 3 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...
152
click to vote
CP
2000
Springer
15 years 9 months ago
2000
Springer
We address the issue of detecting automatically occurrences of high level patterns in audiovisual documents. These patterns correspond to recurring sequences of shots, which are co...
126
Voted
ECSQARU
2007
Springer
15 years 10 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 ...
244
Voted
CP
2009
Springer
16 years 5 months ago
2009
Springer
The Valued Constraint Satisfaction Problem (VCSP) is a general framework encompassing many optimisation problems. We discuss precisely what it means for a problem to be modelled in...
117
Voted
CP
1997
Springer
15 years 8 months ago
1997
Springer
This paper describes the combination of a well-known tsp heuristic, genius, with a constraint programming model for routing problems. The result, genius-cp, is an e cient heuristic...