71 search results - page 8 / 15 » Relative Entropy Policy Search |
ICARIS
2010
Springer
14 years 6 months ago
2010
Springer
In this research work a large set of the classical numerical functions were taken into account in order to understand both the search capability and the ability to escape from a lo...
FOCS
2000
IEEE
15 years 1 months ago
2000
IEEE
There is an upsurging interest in designing succinct data structures for basic searching problems (see [23] and references therein). The motivation has to be found in the exponent...
AIPS
2003
14 years 11 months ago
2003
We develop a hierarchical approach to planning for partially observable Markov decision processes (POMDPs) in which a policy is represented as a hierarchical finite-state control...
128
Voted
CP
2004
Springer
15 years 2 months ago
2004
Springer
The success of stochastic algorithms is often due to their ability to effectively amplify the performance of search heuristics. This is certainly the case with stochastic sampling ...
103
click to vote
CIKM
2006
Springer
15 years 1 months ago
2006
Springer
It is important yet hard to identify navigational queries in Web search due to a lack of sufficient information in Web queries, which are typically very short. In this paper we st...