Sciweavers

283 search results - page 12 / 57
» Incremental Deterministic Planning
Sort
View
CC
2001
Springer
121views System Software» more  CC 2001»
14 years 2 days ago
Constant-Time Root Scanning for Deterministic Garbage Collection
Root scanning is the task of identifying references to heap objects that are stored outside of the heap itself, in global and local variables and on the execution stack. Root scann...
Fridtjof Siebert
ICRA
2009
IEEE
131views Robotics» more  ICRA 2009»
13 years 5 months ago
Efficient C-space and cost function updates in 3D for unmanned aerial vehicles
When operating in partially-known environments, autonomous vehicles must constantly update their maps and plans based on new sensor information. Much focus has been placed on devel...
Sebastian Scherer, Dave Ferguson, Sanjiv Singh
AAAI
2007
13 years 10 months ago
Asymptotically Optimal Encodings of Conformant Planning in QBF
The world is unpredictable, and acting intelligently requires anticipating possible consequences of actions that are taken. Assuming that the actions and the world are determinist...
Jussi Rintanen
CSR
2006
Springer
13 years 11 months ago
Incremental Branching Programs
We propose a new model of restricted branching programs specific to solving GEN problems, which we call incremental branching programs. We show that syntactic incremental branchin...
Anna Gál, Michal Koucký, Pierre McKe...
STOC
2004
ACM
107views Algorithms» more  STOC 2004»
14 years 7 months ago
Primal-dual algorithms for deterministic inventory problems
We consider several classical models in deterministic inventory theory: the single-item lot-sizing problem, the joint replenishment problem, and the multi-stage assembly problem. ...
Retsef Levi, Robin Roundy, David B. Shmoys