Sciweavers

569 search results - page 79 / 114
» An Empirical Study of Structural Constraint Solving Techniqu...
Sort
View
AAAI
2000
13 years 9 months ago
Extracting Effective and Admissible State Space Heuristics from the Planning Graph
Graphplan and heuristic state space planners such as HSP-R and UNPOP are currently two of the most effective approaches for solving classical planning problems. These approaches h...
XuanLong Nguyen, Subbarao Kambhampati
ISTCS
1993
Springer
13 years 11 months ago
Analog Computation Via Neural Networks
We pursue a particular approach to analog computation, based on dynamical systems of the type used in neural networks research. Our systems have a xed structure, invariant in time...
Hava T. Siegelmann, Eduardo D. Sontag
CORR
2010
Springer
105views Education» more  CORR 2010»
13 years 6 months ago
Optimism in Reinforcement Learning Based on Kullback-Leibler Divergence
We consider model-based reinforcement learning in finite Markov Decision Processes (MDPs), focussing on so-called optimistic strategies. Optimism is usually implemented by carryin...
Sarah Filippi, Olivier Cappé, Aurelien Gari...
AI
2000
Springer
13 years 7 months ago
Stochastic dynamic programming with factored representations
Markov decisionprocesses(MDPs) haveproven to be popular models for decision-theoretic planning, but standard dynamic programming algorithms for solving MDPs rely on explicit, stat...
Craig Boutilier, Richard Dearden, Moisés Go...
WICSA
2001
13 years 9 months ago
Annotating Reusable Software Architectures with Specialization Patterns
An application framework is a collection of classes implementing the shared architecture of a family of applications. It is shown how the specialization interface ("hot spots...
Markku Hakala, Juha Hautamäki, Kai Koskimies,...