1378 search results - page 71 / 276 » The Tractability of Global Constraints |
186
click to vote
SAGA
2001
Springer
15 years 10 months ago
2001
Springer
We propose a generic, domain-independent local search method called adaptive search for solving Constraint Satisfaction Problems (CSP). We design a new heuristics that takes advan...
152
click to vote
ICLP
1997
Springer
15 years 10 months ago
1997
Springer
This paper presents a set of techniques that makes constraint programming a technique of choice for solving small (up to 30 nodes) traveling salesman problems. These techniques in...
170
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. We describe decomposition during search (DDS), an integration of And/Or tree search into propagation-based constraint solvers. The presented search algorithm dynamically ...
228
click to vote
IJCAI
1989
15 years 7 months ago
1989
This paper describes the design and implementation of a constraint satisfaction system that uses delayed evaluation techniques to provide greater representational power and to avo...
148
click to vote
AFRIGRAPH
2006
ACM
16 years 4 days ago
2006
ACM
The media industry is demanding increasing fidelity for their rendered images. Despite the advent of modern GPUs, the computational requirements of physically based global illumi...