Sciweavers

2657 search results - page 335 / 532
» On the complexity of hierarchical problem solving
Sort
View
273
Voted
ICDE
2004
IEEE
102views Database» more  ICDE 2004»
16 years 8 months ago
Approximate Temporal Aggregation
Temporal aggregate queries retrieve summarized information about records with time-evolving attributes. Existing approaches have at least one of the following shortcomings: (i) th...
Yufei Tao, Dimitris Papadias, Christos Faloutsos
ICML
2009
IEEE
16 years 7 months ago
Approximate inference for planning in stochastic relational worlds
Relational world models that can be learned from experience in stochastic domains have received significant attention recently. However, efficient planning using these models rema...
Tobias Lang, Marc Toussaint
ICML
2002
IEEE
16 years 7 months ago
Learning from Scarce Experience
Searching the space of policies directly for the optimal policy has been one popular method for solving partially observable reinforcement learning problems. Typically, with each ...
Leonid Peshkin, Christian R. Shelton
ICML
1998
IEEE
16 years 7 months ago
RL-TOPS: An Architecture for Modularity and Re-Use in Reinforcement Learning
This paper introduces the RL-TOPs architecture for robot learning, a hybrid system combining teleo-reactive planning and reinforcement learning techniques. The aim of this system ...
Malcolm R. K. Ryan, Mark D. Pendrith
SIGMOD
2007
ACM
141views Database» more  SIGMOD 2007»
16 years 7 months ago
Assisted querying using instant-response interfaces
We demonstrate a novel query interface that enables users to construct a rich search query without any prior knowledge of the underlying schema or data. The interface, which is in...
Arnab Nandi, H. V. Jagadish