674 search results - page 80 / 135 » The computational complexity of the parallel knock-out probl... |
132
click to vote
FCT
2007
Springer
15 years 5 months ago
2007
Springer
We investigate issues regarding two hard problems related to voting, the optimal weighted lobbying problem and the winner problem for Dodgson elections. Regarding the former, Chris...
116
click to vote
PPOPP
2010
ACM
15 years 10 months ago
2010
ACM
Many large-scale parallel programs follow a bulk synchronous parallel (BSP) structure with distinct computation and communication phases. Although the communication phase in such ...
SPAA
2004
ACM
15 years 6 months ago
2004
ACM
Given two admission control algorithms that are cA-acceptcompetitive and cR-reject-competitive respectively, we give two ways to make an algorithm that is simultaneously O(cA)acce...
102
click to vote
IPPS
2007
IEEE
15 years 7 months ago
2007
IEEE
Driven by the increasing componentization of scientific codes, the deployment of high-end system infrastructures such as the Grid, and the desire to support high level problem so...
101
click to vote
HPDC
1998
IEEE
15 years 5 months ago
1998
IEEE
Abstract Metacomputing is the seamless application of geographically-separated distributed computing resources to user applications. We consider the scheduling of metaapplications;...