Sciweavers

1263 search results - page 150 / 253
» A* with Bounded Costs
Sort
View
ICML
2006
IEEE
14 years 10 months ago
PAC model-free reinforcement learning
For a Markov Decision Process with finite state (size S) and action spaces (size A per state), we propose a new algorithm--Delayed Q-Learning. We prove it is PAC, achieving near o...
Alexander L. Strehl, Lihong Li, Eric Wiewiora, Joh...
ICML
2005
IEEE
14 years 10 months ago
Learning as search optimization: approximate large margin methods for structured prediction
Mappings to structured output spaces (strings, trees, partitions, etc.) are typically learned using extensions of classification algorithms to simple graphical structures (eg., li...
Daniel Marcu, Hal Daumé III
PERCOM
2004
ACM
14 years 9 months ago
Towards Scalable P2P Computing for Mobile Ad Hoc Networks
In mobile ad hoc networks, nodes interact peer-to-peer. They self-organize, share workloads and provide services that they also use. There are middleware platforms, designed for t...
Marco Conti, Enrico Gregori, Giovanni Turi
ALT
2009
Springer
14 years 6 months ago
Pure Exploration in Multi-armed Bandits Problems
Abstract. We consider the framework of stochastic multi-armed bandit problems and study the possibilities and limitations of strategies that explore sequentially the arms. The stra...
Sébastien Bubeck, Rémi Munos, Gilles...
IPPS
2009
IEEE
14 years 4 months ago
Resource allocation strategies for constructive in-network stream processing
We consider the operator mapping problem for in-network stream processing, i.e., the application of a tree of operators in steady-state to multiple data objects that are continuou...
Anne Benoit, Henri Casanova, Veronika Rehn-Sonigo,...