Sciweavers

2178 search results - page 51 / 436
» Inferring complex plans
Sort
View
AIPS
2007
13 years 11 months ago
Structural Patterns of Tractable Sequentially-Optimal Planning
We study the complexity of sequentially-optimal classical planning, and discover new problem classes for whose such optimization is tractable. The results are based on exploiting ...
Michael Katz, Carmel Domshlak
ISIPTA
2005
IEEE
168views Mathematics» more  ISIPTA 2005»
14 years 2 months ago
Approximate Inference in Credal Networks by Variational Mean Field Methods
Graph-theoretical representations for sets of probability measures (credal networks) generally display high complexity, and approximate inference seems to be a natural solution fo...
Jaime Shinsuke Ide, Fabio Gagliardi Cozman
APNOMS
2006
Springer
14 years 17 days ago
Hybrid Inference Architecture and Model for Self-healing System
Distributed computing systems are continuously increasing in complexity and cost of managing, and system management tasks require significantly higher levels of autonomic managemen...
Giljong Yoo, Jeongmin Park, Eunseok Lee
ICML
1990
IEEE
14 years 27 days ago
Explanations of Empirically Derived Reactive Plans
Given an adequate simulation model of the task environment and payoff function that measures the quality of partially successful plans, competition-based heuristics such as geneti...
Diana F. Gordon, John J. Grefenstette
JAIR
2007
127views more  JAIR 2007»
13 years 8 months ago
Learning Symbolic Models of Stochastic Domains
In this article, we work towards the goal of developing agents that can learn to act in complex worlds. We develop a a new probabilistic planning rule representation to compactly ...
Hanna M. Pasula, Luke S. Zettlemoyer, Leslie Pack ...