Sciweavers

937 search results - page 62 / 188
» On the Complexity of Partial Order Properties
Sort
View
ACSC
2009
IEEE
16 years 25 days ago
HOPPER: a hierarchical planning agent for unpredictable domains
Hierarchical Task Networks (HTNs) are a family of powerful planning algorithms that have been successfully applied to many complex, real-world domains. However, they are limited t...
Maciej Wojnar, Peter Andreae
PEPM
1994
ACM
15 years 10 months ago
PERs from Projections for Binding-Time Analysis
First-order projection-based binding-time analysis has proven genuinely useful in partial evaluation Lau91a, Lau91c]. There have been three notable generalisations of projection-b...
Kei Davis
MOC
2000
69views more  MOC 2000»
15 years 5 months ago
Evaluating higher derivative tensors by forward propagation of univariate Taylor series
This article considers the problem of evaluating all pure and mixed partial derivatives of some vector function defined by an evaluation procedure. The natural approach to evaluati...
Andreas Griewank, Jean Utke, Andrea Walther
NIPS
1994
15 years 7 months ago
Finding Structure in Reinforcement Learning
Reinforcement learning addresses the problem of learning to select actions in order to maximize one's performance inunknownenvironments. Toscale reinforcement learning to com...
Sebastian Thrun, Anton Schwartz
CIKM
2008
Springer
15 years 8 months ago
A heuristic approach for checking containment of generalized tree-pattern queries
Query processing techniques for XML data have focused mainly on tree-pattern queries (TPQs). However, the need for querying XML data sources whose structure is very complex or not...
Pawel Placek, Dimitri Theodoratos, Stefanos Soulda...