51 search results - page 6 / 11 » Boosting Search with Variable Elimination |
CP
1997
Springer
14 years 3 months ago
1997
Springer
Abstract. Combinatorial search methods often exhibit a large variability in performance. We study the cost pro les of combinatorial search procedures. Our study reveals some intrig...
ICML
2009
IEEE
14 years 11 months ago
2009
IEEE
Reinforcement Learning methods for controlling stochastic processes typically assume a small and discrete action space. While continuous action spaces are quite common in real-wor...
CPAIOR
2005
Springer
14 years 4 months ago
2005
Springer
Abstract. An optimization problem arising in the design of optical fibre networks is discussed. A network contains client nodes, each installed on one or more SONET rings. A const...
AAAI
2007
14 years 1 months ago
2007
We present a new probabilistic framework for finding likely variable assignments in difficult constraint satisfaction problems. Finding such assignments is key to efficient sea...
CP
2007
Springer
14 years 5 months ago
2007
Springer
It has recently been shown, for the Constraint Satisfaction Problem (CSP), that the state associated with a node of the search tree built by a backtracking algorithm can be exploit...