359 search results - page 33 / 72 » Online Algorithms for Disk Graphs |
152
click to vote
SPAA
2003
ACM
15 years 11 months ago
2003
ACM
We consider an online version of the oblivious routing problem. Oblivious routing is the problem of picking a routing between each pair of nodes (or a set of ows), without knowled...
168
click to vote
PODC
2009
ACM
16 years 6 months ago
2009
ACM
We present a randomized coloring algorithm for the unstructured radio network model, a model comprising autonomous nodes, asynchronous wake-up, no collision detection and an unkno...
140
click to vote
SCAM
2003
IEEE
15 years 11 months ago
2003
IEEE
This paper presents and evaluates a number of techniques to improve the execution time of interprocedural pointer analysis in the context of large C programs. The analysis is form...
180
click to vote
OPODIS
2004
15 years 7 months ago
2004
A localized Delaunay triangulation owns the following interesting properties in a wireless ad hoc setting: it can be built with localized information, the communication cost impos...
159
click to vote
WAW
2009
Springer
16 years 16 days ago
2009
Springer
We present a deterministic model for on-line social networks based on transitivity and local knowledge in social interactions. In the Iterated Local Transitivity (ILT) model, at ea...