886 search results - page 139 / 178 » On the Autoreducibility of Random Sequences |
ICML
2007
IEEE
14 years 8 months ago
2007
IEEE
We consider the problem of multi-task reinforcement learning, where the agent needs to solve a sequence of Markov Decision Processes (MDPs) chosen randomly from a fixed but unknow...
ICML
2001
IEEE
14 years 8 months ago
2001
IEEE
Direct policy search is a practical way to solve reinforcement learning problems involving continuous state and action spaces. The goal becomes finding policy parameters that maxi...
KDD
2007
ACM
14 years 8 months ago
2007
ACM
We present a family of algorithms to uncover tribes--groups of individuals who share unusual sequences of affiliations. While much work inferring community structure describes lar...
RECOMB
2003
Springer
14 years 8 months ago
2003
Springer
Although analysis of genome rearrangements was pioneered by Dobzhansky and Sturtevant 65 years ago, we still know very little about the rearrangement events that produced the exis...
PERCOM
2007
ACM
14 years 7 months ago
2007
ACM
We propose to use node mobility to enhance routing capability in a mobile network. A dual-control planes model is presented, which includes the traditional S(stationary)-plane for ...