Sciweavers

866 search results - page 97 / 174
» On Dynamic Shortest Paths Problems
Sort
View
ALGOSENSORS
2008
Springer
14 years 2 days ago
Simple Robots in Polygonal Environments: A Hierarchy
With the current progress in robot technology and related areas, sophisticated moving and sensing capabilities are at hand to design robots capable of solving seemingly complex tas...
Jan Brunner, Matús Mihalák, Subhash ...
CCCG
2008
13 years 11 months ago
Exact Pareto-Optimal Coordination of Two Translating Polygonal Robots on a Cyclic Roadmap
We consider planning optimal collision-free motions of two polygonal robots under translation. Each robot has a reference point that must lie on a given graph, called a roadmap, w...
Hamid Reza Chitsaz, Steven M. LaValle, Jason M. O'...
SIGMOD
2005
ACM
150views Database» more  SIGMOD 2005»
14 years 10 months ago
Incremental Maintenance of Path Expression Views
Caching data by maintaining materialized views typically requires updating the cache appropriately to reflect dynamic source updates. Extensive research has addressed the problem ...
Arsany Sawires, Jun'ichi Tatemura, Oliver Po, Divy...
INFOCOM
2005
IEEE
14 years 3 months ago
Improving VoIP quality through path switching
Abstract— The current best-effort Internet cannot readily provide the service guarantees that VoIP applications often require. Path switching can potentially address this problem...
Shu Tao, Kuai Xu, Antonio Estepa, Teng Fei, Lixin ...
ASPDAC
2004
ACM
141views Hardware» more  ASPDAC 2004»
14 years 3 months ago
An approach for reducing dynamic power consumption in synchronous sequential digital designs
— The problem of minimizing dynamic power consumption by scaling down the supply voltage of computational elements off critical paths is widely addressed in the literature for th...
Noureddine Chabini, Wayne Wolf