Sciweavers

417 search results - page 40 / 84
» In Search of the Best Constraint Satisfaction Search
Sort
View
BIRTHDAY
2003
Springer
15 years 3 months ago
Comet in Context
Combinatorial optimization problems naturally arise in many application areas, including logistics, manufacturing, supplychain management, and resource allocation. They often give...
Laurent Michel, Pascal Van Hentenryck
ICPR
2006
IEEE
15 years 11 months ago
Recover Writing Trajectory from Multiple Stroked Image Using Bidirectional Dynamic Search
The recovery of writing trajectory from offline handwritten image is generally regarded as a difficult problem [1]. This paper introduced a method to recover the writing trajector...
Yu Qiao, Makoto Yasuhara
CP
2003
Springer
15 years 3 months ago
Using the Breakout Algorithm to Identify Hard and Unsolvable Subproblems
Abstract. Local search algorithms have been very successful for solving constraint satisfaction problems (CSP). However, a major weakness has been that local search is unable to de...
Carlos Eisenberg, Boi Faltings
ICTAI
2002
IEEE
15 years 2 months ago
On Temporal Planning as CSP
(Appears as a regular paper in the proceedings of IEEE International Conference on Tools with Artificial Intelligence (ICTAI), IEEE Computer Society, Washington D.C. Nov. 2002, p...
Amol Dattatraya Mali
IJCAI
2007
14 years 11 months ago
Probabilistic Consistency Boosts MAC and SAC
Constraint Satisfaction Problems (CSPs) are ubiquitous in Artificial Intelligence. The backtrack algorithms that maintain some local consistency during search have become the de ...
Deepak Mehta, Marc R. C. van Dongen