Sciweavers

4798 search results - page 637 / 960
» Time for a change
Sort
View
UAI
2008
15 years 8 months ago
Dyna-Style Planning with Linear Function Approximation and Prioritized Sweeping
We consider the problem of efficiently learning optimal control policies and value functions over large state spaces in an online setting in which estimates must be available afte...
Richard S. Sutton, Csaba Szepesvári, Alborz...
AAAI
2004
15 years 8 months ago
Combinatorial Auctions with Structured Item Graphs
Combinatorial auctions (CAs) are important mechanisms for allocating interrelated items. Unfortunately, winner determination is NP-complete unless there is special structure. We s...
Vincent Conitzer, Jonathan Derryberry, Tuomas Sand...
AIPS
2000
15 years 8 months ago
Vision-Servoed Localization and Behavior-Based Planning for an Autonomous Quadruped Legged Robot
Planning for real robots to act in dynamic and uncertain environments is a challenging problem. A complete model of the world is not viable and an integration of deliberation and ...
Manuela M. Veloso, Elly Winner, Scott Lenser, Jame...
USENIX
2000
15 years 8 months ago
FiST: A Language for Stackable File Systems
Traditional file system development is difficult. Stackable file systems promise to ease the development of file systems by offering a mechanism for incremental development. Unfor...
Erez Zadok, Jason Nieh
CORR
2010
Springer
122views Education» more  CORR 2010»
15 years 6 months ago
Facility Location with Client Latencies: Linear-Programming based Techniques for Minimum-Latency Problems
We introduce a problem that is a common generalization of the uncapacitated facility location (UFL) and minimum latency (ML) problems, where facilities not only need to be opened ...
Deeparnab Chakrabarty, Chaitanya Swamy