Sciweavers

75 search results - page 1 / 15
» Search Procedures and Parallelism in Constraint Programming
Sort
View
CP
1999
Springer
13 years 9 months ago
Search Procedures and Parallelism in Constraint Programming
Abstract. In this paper, we present a major improvement in the search procedures in constraint programming. First, we integrate various search procedures from AI and OR. Second, we...
Laurent Perron
CP
2006
Springer
13 years 8 months ago
Distributed Constraint-Based Local Search
Distributed computing is increasingly important at a time when the doubling of the number of transistors on a processor every 18 months no longer translates in a doubling of speed ...
Laurent Michel, Andrew See, Pascal Van Hentenryck
CP
2009
Springer
14 years 5 months ago
Confidence-Based Work Stealing in Parallel Constraint Programming
The most popular architecture for parallel search is work stealing: threads that have run out of work (nodes to be searched) steal from threads that still have work. Work stealing ...
Geoffrey Chu, Christian Schulte, Peter J. Stuckey
IJAIT
2002
82views more  IJAIT 2002»
13 years 4 months ago
Interleaved Backtracking in Distributed Constraint Networks
The adaptation of software technology to distributed environments is an important challenge today. In this work we combine parallel and distributed search. By this way we add the ...
Youssef Hamadi
AIPS
1994
13 years 6 months ago
Using AI Planning Techniques to Automatically Generate Image Processing Procedures
This paper describes work on the Multimission VICARPlanner (MVP) system to automatically construct executable imageprocessing procedures for custom image processing requests for t...
Steve A. Chien