97 search results - page 2 / 20 » Near-Optimal Search in Continuous Domains |
AIPS
2009
13 years 6 months ago
2009
We define the robustness of a sequential plan as the probability that it will execute successfully despite uncertainty in the execution environment. We consider a rich notion of u...
WSC
2000
13 years 6 months ago
2000
Many artificial intelligence techniques rely on the notion ate" as an abstraction of the actual state of the nd an "operator" as an abstraction of the actions that ...
JCST
2008
13 years 5 months ago
2008
Research into ant colony algorithms for solving continuous optimization problems forms one of the most significant and promising areas in swarm computation. Although traditional an...
EPIA
2001
Springer
13 years 9 months ago
2001
Springer
This paper addresses constraint solving over continuous domains in the context of decision making, and discusses the trade-off between precision in the definition of the solution s...
EOR
2000
13 years 5 months ago
2000
A new algorithm called Enhanced Continuous Tabu Search (ECTS) is proposed for the global optimization of multiminima functions. It results from an adaptation of combinatorial Tabu...