914 search results - page 12 / 183 » The Computational Complexity of Probabilistic Planning |
UM
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. We present a study exploring the promise of developing computational systems to support the discovery and execution of opportunistic activities in mobile settings. We int...
IPPS
2003
IEEE
14 years 27 days ago
2003
IEEE
Planning is an artificial intelligence problem with a wide range of real-world applications. Genetic algorithms, neural networks, and simulated annealing are heuristic search met...
UAI
2008
13 years 9 months ago
2008
While known algorithms for sensitivity analysis and parameter tuning in probabilistic networks have a running time that is exponential in the size of the network, the exact comput...
IPPS
2006
IEEE
14 years 1 months ago
2006
IEEE
The execution of a complex task in any environment requires planning. Planning is the process of constructing an activity graph given by the current state of the system, a goal st...
ENTCS
2008
13 years 7 months ago
2008
Several different uses of Newton's method in connection with the Fundamental Theorem of Algebra are pointed out. Theoretical subdivision schemes have been combined with the n...