5138 search results - page 685 / 1028 » Randomized Algorithms for 3-SAT |
189
click to vote
WADS
2007
Springer
16 years 24 days ago
2007
Springer
Let G = (V, E) be an weighted undirected graph on n vertices and m edges, and let dG be its shortest path metric. We present two simple deterministic algorithms for approximating ...
222
click to vote
PODC
2004
ACM
16 years 3 days ago
2004
ACM
We present a low-cost, decentralized algorithm for ID management in distributed hash tables (DHTs) managed by a dynamic set of hosts. Each host is assigned an ID in the unit inter...
165
click to vote
ESA
2003
Springer
15 years 12 months ago
2003
Springer
Abstract. Recently, efficient leader election algorithms for ad hoc radio networks with low time complexity and energy cost have been designed even for the no-collision detection,...
174
click to vote
SPAA
1997
ACM
15 years 11 months ago
1997
ACM
Pipelining has been used in the design of many PRAM algorithms to reduce their asymptotic running time. Paul, Vishkin, and Wagener (PVW) used the approach in a parallel implementat...
170
click to vote
PODC
2010
ACM
15 years 10 months ago
2010
ACM
Consider an n-vertex graph G = (V, E) of maximum degree ∆, and suppose that each vertex v ∈ V hosts a processor. The processors are allowed to communicate only with their neig...