Sciweavers

914 search results - page 83 / 183
» The Computational Complexity of Probabilistic Planning
Sort
View
DARE
2000
108views more  DARE 2000»
15 years 1 months ago
Evaluating navigation methods for an AR system
BUILD-IT is a planning tool based on computer vision technology, supporting complex planning and composition tasks. A group of people, seated around a table, interact with objects...
Morten Fjeld
FUIN
2007
130views more  FUIN 2007»
14 years 11 months ago
A Logic-Based Approach to Finding Explanations for Discrepancies in Optimistic Plan Execution
Abstract. Consider an agent executing a plan with nondeterministic actions, in a dynamic environment, which might fail. Suppose that she is given a description of this action domai...
Thomas Eiter, Esra Erdem, Wolfgang Faber, Já...
IPPS
2003
IEEE
15 years 5 months ago
Constrained Component Deployment in Wide-Area Networks Using AI Planning Techniques
Component-based models represent a dominant trend in the construction of wide-area network applications, making possible the integration of diverse functionality contained in modu...
Tatiana Kichkaylo, Anca-Andreea Ivan, Vijay Karamc...
84
Voted
AAAI
2008
15 years 2 months ago
Computing Minimal Diagnoses by Greedy Stochastic Search
Most algorithms for computing diagnoses within a modelbased diagnosis framework are deterministic. Such algorithms guarantee soundness and completeness, but are P 2 hard. To overc...
Alexander Feldman, Gregory M. Provan, Arjan J. C. ...
CEC
2007
IEEE
15 years 1 days ago
Entropy-based Memetic Particle Swarm Optimization for computing periodic orbits of nonlinear mappings
— The computation of periodic orbits of nonlinear mappings is very important for studying and better understanding the dynamics of complex systems. Evolutionary algorithms have s...
Y. G. Petalas, Konstantinos E. Parsopoulos, Michae...