42 search results - page 3 / 9 » Planning for Fast Connectivity Updates |
CSC
2009
13 years 8 months ago
2009
Small-world networks have become an important model for understanding many complex phenomena in science and in sociological contexts. One tool for exploring the critical and phase...
IROS
2007
IEEE
14 years 1 months ago
2007
IEEE
— We present a novel algorithm for motion planning of multiple robots amongst dynamic obstacles. Our approach is based on a new roadmap representation that uses deformable links ...
ICCAD
2002
IEEE
14 years 4 months ago
2002
IEEE
Optimized solvers for the Boolean Satisfiability (SAT) problem have many applications in areas such as hardware and software verification, FPGA routing, planning, etc. Further use...
CIKM
2006
Springer
13 years 11 months ago
2006
Springer
We study the novel problem of efficiently computing the update distance for a pair of relational databases. In analogy to the edit distance of strings, we define the update distan...
WEA
2007
Springer
14 years 1 months ago
2007
Springer
We introduce a dynamic technique for fast route planning in large road networks. For the first time, it is possible to handle the practically relevant scenarios that arise in pres...