2252 search results - page 112 / 451 » Lower Bounds for Dynamic Algorithms |
129
click to vote
SIROCCO
2000
15 years 4 months ago
2000
ABSTRACT: This work considers the problem of performing a set of N tasks on a set of P cooperating message-passing processors (P N). The processors use a group communication servi...
198
click to vote
TAPAS
2011
14 years 10 months ago
2011
Abstract. We consider energy-performance tradeoff for scheduling parallel jobs on multiprocessors using dynamic speed scaling. The objective is to minimize the sum of energy consu...
133
click to vote
SIAMDM
2008
15 years 3 months ago
2008
In this paper we consider the problem of testing whether a graph is triangle-free, and more generally, whether it is H-free, for a fixed subgraph H. The algorithm should accept gr...
117
click to vote
ALGORITHMICA
2004
15 years 3 months ago
2004
We consider the problem of scheduling dynamically arriving jobs in a non-clairvoyant setting, that is, when the size of a job in remains unknown until the job finishes execution. ...
113
click to vote
COCOON
2005
Springer
15 years 8 months ago
2005
Springer
Abstract. The worst-case complexity of an implementation of Quicksort depends on the random number generator that is used to select the pivot elements. In this paper we estimate th...