2252 search results - page 235 / 451 » Lower Bounds for Dynamic Algorithms |
132
click to vote
STOC
2002
ACM
16 years 4 months ago
2002
ACM
A randomized algorithm is given that solves the wait-free consensus problem for a shared-memory model with infinitely many processes. The algorithm is based on a weak shared coin ...
106
Voted
CDC
2008
IEEE
15 years 10 months ago
2008
IEEE
— This paper is concerned with modeling, analysis and optimization/control of occupancy evolution in a large building. The main concern is efficient evacuation of a building in ...
133
click to vote
ISPAN
1999
IEEE
15 years 8 months ago
1999
IEEE
Current distributed parallel platforms can provide the resources required to execute a scientific application efficiently. However, when these platforms are shared by multiple use...
127
click to vote
ISCAS
1995
IEEE
15 years 7 months ago
1995
IEEE
— This paper introduces a simple analytical model for estimating standby and switching power dissipation in deep submicron CMOS digital circuits. The model is based on Berkeley S...
131
click to vote
PPOPP
2006
ACM
15 years 9 months ago
2006
ACM
Traditional collective communication algorithms are designed with the assumption that a node can communicate with only one other node at a time. On new parallel architectures such...