Sciweavers

749 search results - page 64 / 150
» Dualities for Constraint Satisfaction Problems
Sort
View
CP
2001
Springer
15 years 3 months ago
Collaborative Learning for Constraint Solving
Abstract. Although constraint programming offers a wealth of strong, generalpurpose methods, in practice a complex, real application demands a person who selects, combines, and ref...
Susan L. Epstein, Eugene C. Freuder
NETWORKS
2008
14 years 11 months ago
Reformulation and sampling to solve a stochastic network interdiction problem
The Network Interdiction Problem involves interrupting an adversary's ability to maximize flow through a capacitated network by destroying portions of the network. A budget c...
Udom Janjarassuk, Jeff Linderoth
FLAIRS
2007
15 years 1 months ago
Search Ordering Heuristics for Restarts-Based Constraint Solving
Constraint Satisfaction Problems are ubiquitous in Artificial Intelligence. Over the past decade significant advances have been made in terms of the size of problem instance tha...
Margarita Razgon, Barry O'Sullivan, Gregory M. Pro...
ECP
1997
Springer
88views Robotics» more  ECP 1997»
15 years 3 months ago
A Time and Resource Problem for Planning Architectures
This paper concerns the problem of resource reasoning in planning. It defines formally a constraint satisfaction problem, the Time and Resource Problem (T RP), in which resource r...
Amedeo Cesta, Cristiano Stella
AI
2005
Springer
14 years 11 months ago
The distributed breakout algorithms
We present a new series of distributed constraint satisfaction algorithms, the distributed breakout algorithms, which is inspired by local search algorithms for solving the constr...
Katsutoshi Hirayama, Makoto Yokoo