663 search results - page 51 / 133 » A Parallel Algorithm for Enumerating Combinations |
124
click to vote
IPPS
2009
IEEE
15 years 8 months ago
2009
IEEE
— There are many grid-based applications where a timely response to an important event is needed. Often such response can require a significant computation and possibly communic...
109
Voted
ISPAN
2005
IEEE
15 years 7 months ago
2005
IEEE
- Dynamic lightpath protection in survivable WDM networks requires finding a pair of diverse routes (i.e., a primary route and a backup route that are link-disjoint) that form a cy...
122
Voted
SPAA
2004
ACM
15 years 7 months ago
2004
ACM
The literature describes two high performance concurrent stack algorithms based on combining funnels and elimination trees. Unfortunately, the funnels are linearizable but blockin...
100
click to vote
ISPDC
2008
IEEE
15 years 8 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...
99
Voted
SPAA
2005
ACM
15 years 7 months ago
2005
ACM
We study randomized algorithms for placing a sequence of n nodes on a circle with unit perimeter. Nodes divide the circle into disjoint arcs. We desire that a newly-arrived node (...