Sciweavers

24 search results - page 4 / 5
» Learning Policy Improvements with Path Integrals
Sort
View
STOC
2006
ACM
122views Algorithms» more  STOC 2006»
14 years 9 months ago
Fast convergence to Wardrop equilibria by adaptive sampling methods
We study rerouting policies in a dynamic round-based variant of a well known game theoretic traffic model due to Wardrop. Previous analyses (mostly in the context of selfish routi...
Simon Fischer, Harald Räcke, Berthold Vö...
ICML
2002
IEEE
14 years 10 months ago
Reinforcement Learning and Shaping: Encouraging Intended Behaviors
We explore dynamic shaping to integrate our prior beliefs of the final policy into a conventional reinforcement learning system. Shaping provides a positive or negative artificial...
Adam Laud, Gerald DeJong
FLAIRS
2006
13 years 10 months ago
Simulated Visual Perception-Based Control for Autonomous Mobile Agents
Autonomous robots, such as automatic vacuum cleaners, toy robot dogs, and autonomous vehicles for the military, are rapidly becoming a part of everyday life. As a result the need ...
Daniel Flower, Burkhard Wünsche, Hans W. Gues...
MONET
2007
132views more  MONET 2007»
13 years 9 months ago
QUORUM - Quality of Service in Wireless Mesh Networks
Abstract Wireless mesh networks (WMNs) can provide seamless broadband connectivity to network users with low setup and maintenance costs. To support nextgeneration applications wit...
Vinod Kone, Sudipto Das, Ben Y. Zhao, Haitao Zheng
KDD
2008
ACM
193views Data Mining» more  KDD 2008»
14 years 9 months ago
A family of dissimilarity measures between nodes generalizing both the shortest-path and the commute-time distances
This work introduces a new family of link-based dissimilarity measures between nodes of a weighted directed graph. This measure, called the randomized shortest-path (RSP) dissimil...
Luh Yen, Marco Saerens, Amin Mantrach, Masashi Shi...