3206 search results - page 288 / 642 » Optimizing Graph Algorithms for Improved Cache Performance |
141
Voted
ALGOSENSORS
2009
Springer
15 years 6 months ago
2009
Springer
Abstract. Delay (or disruption) tolerant sensor networks may be modeled as Markovian evolving graphs [1]. We present experimental evidence showing that considering multiple (possib...
117
click to vote
SPAA
2010
ACM
15 years 3 months ago
2010
ACM
Given the sequential implementation of any data structure, we show how to obtain an efficient, wait-free implementation of that data structure shared by any fixed number of proces...
123
click to vote
HICSS
2006
IEEE
15 years 9 months ago
2006
IEEE
— Uniform sampling in networks is at the core of a wide variety of randomized algorithms. Random sampling can be performed by modeling the system as an undirected graph with asso...
166
Voted
ICUIMC
2011
ACM
14 years 6 months ago
2011
ACM
Query localization is an improved extension of on-demand routing protocols for ad hoc networks. It makes use of prior routing histories to localize the query flood to a limited re...
122
Voted
DIAGRAMS
2006
Springer
15 years 7 months ago
2006
Springer
We conducted eye-tracking studies of subjects solving the problem of finding shortest paths in a graph using a known procedure (Dijkstra's algorithm). The goal of these studie...