Sciweavers

118 search results - page 6 / 24
» An Evolutionary Random Policy Search Algorithm for Solving M...
Sort
View
IJCAI
2007
13 years 8 months ago
An Experts Algorithm for Transfer Learning
A long-lived agent continually faces new tasks in its environment. Such an agent may be able to use knowledge learned in solving earlier tasks to produce candidate policies for it...
Erik Talvitie, Satinder Singh
NIPS
2003
13 years 8 months ago
Approximate Policy Iteration with a Policy Language Bias
We study an approach to policy selection for large relational Markov Decision Processes (MDPs). We consider a variant of approximate policy iteration (API) that replaces the usual...
Alan Fern, Sung Wook Yoon, Robert Givan
GECCO
2005
Springer
132views Optimization» more  GECCO 2005»
14 years 28 days ago
Takeover time curves in random and small-world structured populations
We present discrete stochastic mathematical models for the growth curves of synchronous and asynchronous evolutionary algorithms with populations structured according to a random ...
Mario Giacobini, Marco Tomassini, Andrea Tettamanz...
AAAI
2007
13 years 9 months ago
Scaling Up: Solving POMDPs through Value Based Clustering
Partially Observable Markov Decision Processes (POMDPs) provide an appropriately rich model for agents operating under partial knowledge of the environment. Since finding an opti...
Yan Virin, Guy Shani, Solomon Eyal Shimony, Ronen ...
ALDT
2009
Springer
142views Algorithms» more  ALDT 2009»
14 years 2 months ago
Finding Best k Policies
Abstract. An optimal probabilistic-planning algorithm solves a problem, usually modeled by a Markov decision process, by finding its optimal policy. In this paper, we study the k ...
Peng Dai, Judy Goldsmith