2084 search results - page 209 / 417 » Proving Time Bounds for Randomized Distributed Algorithms |
110
Voted
WEA
2007
Springer
15 years 8 months ago
2007
Springer
We study the real algorithm for the point-to-point shortest path problem. It combines A∗ search search, landmark-based lower bounds, and reach-based pruning. We suggest several ...
134
Voted
STOC
2009
ACM
16 years 3 months ago
2009
ACM
We present an improved oracle for the distance sensitivity problem. The goal is to preprocess a directed graph G = (V, E) with non-negative edge weights to answer queries of the f...
134
click to vote
APN
2008
Springer
15 years 4 months ago
2008
Springer
In this paper, we address the class of bounded Petri nets with stopwatches (SwPNs), which is an extension of T-time Petri nets (TPNs) where time is associated with transitions. Con...
120
Voted
IPL
2002
15 years 2 months ago
2002
We consider two aesthetic criteria for the visualization of rooted trees: inclusion and tip-over. Finding the minimum area layout according to either of these two standards is an ...
123
click to vote
BROADNETS
2004
IEEE
15 years 6 months ago
2004
IEEE
This paper presents Random Asynchronous Wakeup (RAW), a power saving technique for sensor networks that reduces energy consumption without significantly affecting the latency or c...