97 search results - page 7 / 20 » Near-Optimal Search in Continuous Domains |
CP
2005
Springer
14 years 3 months ago
2005
Springer
Abstract. Most CSP algorithms are based on refinements and extensions of backtracking, and employ one of two simple “branching schemes”: 2-way branching or d-way branching, fo...
KR
2004
Springer
14 years 3 months ago
2004
Springer
We continue to advocate a methodology that we used earlier for pattern discovery through exhaustive search in selected small domains. This time we apply it to the problem of disco...
CP
2009
Springer
14 years 4 months ago
2009
Springer
We introduce Hegel and Fichte’s dialectic as a search meta-heuristic for constraint satisfaction and optimization. Dialectic is an appealing mental concept for local search as it...
ATAL
2006
Springer
14 years 1 months ago
2006
Springer
The challenge we address is to reason about projected resource usage within a hierarchical task execution framework in order to improve agent effectiveness. Specifically, we seek ...
IAT
2005
IEEE
14 years 3 months ago
2005
IEEE
In this paper, we consider the problem of dynamic lightpath protection in survivable WDM networks with single link failure model. Our work concerns in how to dynamically determine...