Sciweavers

5356 search results - page 273 / 1072
» Adventures in time and space
Sort
View
JMLR
2006
124views more  JMLR 2006»
15 years 6 months ago
Policy Gradient in Continuous Time
Policy search is a method for approximately solving an optimal control problem by performing a parametric optimization search in a given class of parameterized policies. In order ...
Rémi Munos
IS
2010
15 years 5 months ago
Extracting a largest redundancy-free XML storage structure from an acyclic hypergraph in polynomial time
Given a hypergraph and a set of embedded functional dependencies, we investigate the problem of determining the conditions under which we can efficiently generate redundancy-free ...
Wai Yin Mok, Joseph Fong, David W. Embley
EUROGP
2009
Springer
143views Optimization» more  EUROGP 2009»
15 years 4 months ago
A Real-Time Evolutionary Object Recognition System
We have created a real-time evolutionary object recognition system. Genetic Programming is used to automatically search the space of possible computer vision programs guided throug...
Marc Ebner
ML
2002
ACM
143views Machine Learning» more  ML 2002»
15 years 6 months ago
A Sparse Sampling Algorithm for Near-Optimal Planning in Large Markov Decision Processes
An issue that is critical for the application of Markov decision processes MDPs to realistic problems is how the complexity of planning scales with the size of the MDP. In stochas...
Michael J. Kearns, Yishay Mansour, Andrew Y. Ng
POPL
2008
ACM
16 years 7 months ago
Extensible encoding of type hierarchies
The subtyping test consists of checking whether a type t is a descendant of a type r (Agrawal et al. 1989). We study how to perform such a test efficiently, assuming a dynamic hie...
Hamed Seiied Alavi, Seth Gilbert, Rachid Guerraoui