Sciweavers

592 search results - page 9 / 119
» Learning Generalized Plans Using Abstract Counting
Sort
View
GECCO
2004
Springer
142views Optimization» more  GECCO 2004»
14 years 1 months ago
Improving MACS Thanks to a Comparison with 2TBNs
Abstract. Factored Markov Decision Processes is the theoretical framework underlying multi-step Learning Classifier Systems research. This framework is mostly used in the context ...
Olivier Sigaud, Thierry Gourdin, Pierre-Henri Wuil...
MICAI
2009
Springer
14 years 1 months ago
Planning for Conditional Learning Routes
Abstract. This paper builds on a previous work in which an HTN planner is used to obtain learning routes expressed in the standard language IMS-LD and its main contribution is the ...
Lluvia Morales, Luis A. Castillo, Juan Ferná...
UC
2005
Springer
14 years 1 months ago
On Computational Complexity of Counting Fixed Points in Symmetric Boolean Graph Automata
Abstract. We study computational complexity of counting the fixed point configurations (FPs) in certain classes of graph automata viewed as discrete dynamical systems. We prove t...
Predrag T. Tosic, Gul A. Agha
ICML
1996
IEEE
14 years 9 months ago
Representing and Learning Quality-Improving Search Control Knowledge
Generating good, production-quality plans is an essential element in transforming planners from research tools into real-world applications, but one that has been frequently overl...
M. Alicia Pérez
ACL
2012
11 years 10 months ago
Learning High-Level Planning from Text
Comprehending action preconditions and effects is an essential step in modeling the dynamics of the world. In this paper, we express the semantics of precondition relations extrac...
S. R. K. Branavan, Nate Kushman, Tao Lei, Regina B...