2796 search results - page 130 / 560 » The coolest path problem |
144
Voted
COCOON
1999
Springer
15 years 9 months ago
1999
Springer
We investigate various problems related to circulant graphs – finding the shortest path between two vertices, finding the shortest loop, and computing the diameter. These probl...
155
click to vote
INFOCOM
2007
IEEE
15 years 11 months ago
2007
IEEE
—We study the problem of supporting VoIP calls in a wireless mesh network. Specifically, we propose solutions for call admission control (CAC) and route selection for VoIP calls...
135
click to vote
INFOCOM
2007
IEEE
15 years 11 months ago
2007
IEEE
Abstract—We present a distributed routing algorithm for finding two disjoint (primary and backup) QoS paths that run across multiple domains. Our work is inspired by the recent ...
132
Voted
ICRA
2006
IEEE
15 years 11 months ago
2006
IEEE
— Mobile robot localization and navigation requires a map - the robot’s internal representation of the environment. A common problem is that path planning becomes very ineffic...
152
click to vote
ISCAS
2005
IEEE
15 years 10 months ago
2005
IEEE
—As process variations become a significant problem in deep sub-micron technology, a shift from deterministic static timing analysis to statistical static timing analysis for hig...