5169 search results - page 635 / 1034 » Locality approximation using time |
229
click to vote
CEC
2010
IEEE
14 years 10 months ago
2010
IEEE
— Efficient vehicle path planning in hostile environment to carry out rescue or tactical logistic missions remains very challenging. Most approaches reported so far relies on key...
176
Voted
WWW
2007
ACM
16 years 7 months ago
2007
ACM
As XML database sizes grow, the amount of space used for storing the data and auxiliary data structures becomes a major factor in query and update performance. This paper presents...
172
click to vote
ISPDC
2008
IEEE
16 years 1 months ago
2008
IEEE
Self-stabilizing token circulation algorithms are not always adapted for dynamic networks. Random walks are well known to play a crucial role in the design of randomized algorithm...
138
Voted
MSS
2007
IEEE
16 years 1 months ago
2007
IEEE
This paper presents the RAM Enhanced Disk Cache Project, REDCAP, a new cache of disk blocks which reduces the read I/O time by using a small portion of the main memory. The essent...
220
click to vote
MSWIM
2006
ACM
16 years 20 days ago
2006
ACM
In recent years different authors have proposed the used of random-walk-based algorithms for varying tasks in the networking community. These proposals include searching, routing...