2899 search results - page 312 / 580 » Dynamic Trees in Practice |
126
click to vote
COCOON
2009
Springer
15 years 11 months ago
2009
Springer
In this paper, we deal with restoring missing information in molecule databases: Some data formats only store the atoms’ configuration but omit bond multiplicities. As this info...
152
click to vote
BROADCOM
2008
IEEE
15 years 10 months ago
2008
IEEE
Distributed Hash Tables (DHTs) with O(1) lookup performance strive to minimize the maintenance traffic required for disseminating membership changes information (events). These eve...
123
click to vote
IROS
2008
IEEE
15 years 10 months ago
2008
IEEE
— This paper provides a detailed analysis of the motion planning subsystem for the MIT DARPA Urban Challenge vehicle. The approach is based on the Rapidly-exploring Random Trees ...
163
click to vote
GLOBECOM
2007
IEEE
15 years 10 months ago
2007
IEEE
—Recharging the batteries of a moribund sensor deployed as part of a wireless sensor network is often infeasible due to logistical considerations. With the purpose of prolonging ...
152
click to vote
ICC
2007
IEEE
15 years 10 months ago
2007
IEEE
— Many previously proposed routing metrics and algorithms for ad hoc networks work well in static networks, however, when nodes are moving and wireless links may fail from time t...