Sciweavers

42 search results - page 1 / 9
» Planning for Fast Connectivity Updates
Sort
View
FOCS
2007
IEEE
13 years 11 months ago
Planning for Fast Connectivity Updates
Understanding how a single edge deletion can affect the connectivity of a graph amounts to finding the graph bridges. But when faced with d > 1 deletions, can we establish as ...
Mihai Patrascu, Mikkel Thorup
FOCS
2008
IEEE
13 years 11 months ago
Dynamic Connectivity: Connecting to Networks and Geometry
Dynamic connectivity is a well-studied problem, but so far the most compelling progress has been confined to the edge-update model: maintain an understanding of connectivity in a...
Timothy M. Chan, Mihai Patrascu, Liam Roditty
AIPS
2007
13 years 7 months ago
A Fast Incremental Algorithm for Maintaining Dispatchability of Partially Controllable Plans
Autonomous systems operating in real-world environments must be able to plan, schedule, and execute missions while robustly adapting to uncertainty and disturbances. Previous work...
Julie A. Shah, John Stedl, Brian C. Williams, Paul...
DLOG
2003
13 years 6 months ago
Rule Based Computation of Updates to Terminologies
In this paper we formalise compilation of the conjunctive bodies of a restricted class of Horn rules into updates on terminologies. This involves a pre-processing of the graphs re...
Sanjay Modgil
DAGSTUHL
2001
13 years 6 months ago
Execution-Time Plan Management for a Cognitive Orthotic System
In this paper we discuss our work on plan management in the Autominder cognitive orthotic system. Autominder is being designed as part of an initiative on the development of roboti...
Martha E. Pollack, Colleen E. McCarthy, Sailesh Ra...