2796 search results - page 215 / 560 » The coolest path problem |
174
click to vote
AROBOTS
2006
15 years 6 months ago
2006
All mobile bases suffer from localization errors. Previous approaches to accommodate for localization errors either use external sensors such as lasers or sonars, or use internal s...
192
click to vote
JCM
2007
15 years 6 months ago
2007
—Today, most routing problems are solved using Dijkstra’s shortest path algorithm. Many efficient implementations of Dijkstra’s algorithm exist and can handle large networks ...
198
click to vote
TITS
2011
15 years 1 months ago
2011
Abstract—Over the last few years, electronic vehicle guidance systems have become increasingly more popular. However, despite their ubiquity, performance will always be subject t...
160
click to vote
WISEC
2010
ACM
16 years 1 months ago
2010
ACM
The problem of localizing in-band wormhole tunnels in MANETs is considered. In an in-band wormhole attack, colluding attackers use a covert tunnel to create the illusion that two ...
187
click to vote
MOBICOM
2006
ACM
16 years 16 days ago
2006
ACM
In this paper, we consider the problem of mitigating interference and improving network capacity in wireless mesh networks from the angle of temporal-spatial diversity. In a nutsh...