Sciweavers

866 search results - page 129 / 174
» On Dynamic Shortest Paths Problems
Sort
View
ESA
2004
Springer
137views Algorithms» more  ESA 2004»
14 years 3 months ago
Fast 3-Coloring Triangle-Free Planar Graphs
We show the first o(n2 ) algorithm for coloring vertices of trianglefree planar graphs using three colors. The time complexity of the algorithm is O(n log n). Our approach can be ...
Lukasz Kowalik
ICNP
2003
IEEE
14 years 3 months ago
Matchmaker: Signaling for Dynamic Publish/Subscribe Applications
The publish/subscribe (pub/sub) paradigm provides content-oriented data dissemination in which communication channels are established between content publishers and content subscr...
Zihui Ge, Ping Ji, James F. Kurose, Donald F. Tows...
IJRR
2010
173views more  IJRR 2010»
13 years 8 months ago
Planning and Implementing Trajectories for Autonomous Underwater Vehicles to Track Evolving Ocean Processes Based on Predictions
Path planning and trajectory design for autonomous underwater vehicles (AUVs) is of great importance to the oceanographic research community because automated data collection is b...
Ryan N. Smith, Yi Chao, Peggy Li, David A. Caron, ...
IROS
2009
IEEE
144views Robotics» more  IROS 2009»
14 years 4 months ago
Behavior-based motion planning for group control
— Despite the large body of work in both motion planning and multi-agent simulation, little work has focused on the problem of planning motion for groups of robots using external...
Christopher Vo, Joseph F. Harrison, Jyh-Ming Lien
CIC
2004
118views Communications» more  CIC 2004»
13 years 11 months ago
An Efficient Delay Sensitive Multicast Routing Algorithm
As a key issue in multicast routing with quality of service (QoS) support, constrained minimum Steiner tree (CMST) problem has been a research focus for more than a decade, and ten...
Gang Feng