Sciweavers

283 search results - page 27 / 57
» Incremental Deterministic Planning
Sort
View
UAI
2008
13 years 9 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...
GIS
2007
ACM
14 years 8 months ago
Evacuation route planning: scalable heuristics
Given a transportation network, a vulnerable population, and a set of destinations, evacuation route planning identifies routes to minimize the time to evacuate the vulnerable pop...
Sangho Kim, Betsy George, Shashi Shekhar
CAISE
2006
Springer
13 years 11 months ago
Taxonomy of Flexibility in Business Processes
ion level of Change Subject of Change Properties of Change Type Instance Functional Perspective Organizational Perspective Extent Behavioral Perspective Informational Perspective O...
Gil Regev, Pnina Soffer, Rainer Schmidt
PODS
2012
ACM
276views Database» more  PODS 2012»
11 years 10 months ago
Randomized algorithms for tracking distributed count, frequencies, and ranks
We show that randomization can lead to significant improvements for a few fundamental problems in distributed tracking. Our basis is the count-tracking problem, where there are k...
Zengfeng Huang, Ke Yi, Qin Zhang
JAIR
2006
179views more  JAIR 2006»
13 years 7 months ago
The Fast Downward Planning System
Fast Downward is a classical planning system based on heuristic search. It can deal with general deterministic planning problems encoded in the propositional fragment of PDDL2.2, ...
Malte Helmert