3563 search results - page 346 / 713 » Scheduling Algorithms for Procrastinators |
182
click to vote
ESA
2006
Springer
15 years 10 months ago
2006
Springer
The objective of this paper is to characterize classes of problems for which a greedy algorithm finds solutions provably close to optimum. To that end, we introduce the notion of k...
178
Voted
CPAIOR
2009
Springer
15 years 8 months ago
2009
Springer
Abstract. In scheduling using constraint programming we usually reason only about possible start times and end times of activities and remove those which are recognized as unfeasib...
170
click to vote
CORR
2010
Springer
15 years 5 months ago
2010
Springer
We consider the problem of finding semi-matching in bipartite graphs which is also extensively studied under various names in the scheduling literature. We give faster algorithms ...
171
click to vote
SSS
2007
Springer
16 years 1 months ago
2007
Springer
In [Dij74] Dijkstra introduced the notion of self-stabilizing algorithms, and presented three such algorithms for the problem of mutual exclusion on a ring of processors. The thir...
167
click to vote
ICPP
2003
IEEE
16 years 9 days ago
2003
IEEE
In this paper we propose an efficient parallel algorithm with simple static and dynamic scheduling for generating combinations. It can use any number of processors (NP ≤ n − ...