Sciweavers

6897 search results - page 223 / 1380
» Parallelization of Modular Algorithms
Sort
View
124
Voted
IJFCS
2006
63views more  IJFCS 2006»
15 years 2 months ago
Critical Path Scheduling Parallel Programs on an Unbounded Number of Processors
In this paper we present an efficient algorithm for compile-time scheduling and clustering of parallel programs onto parallel processing systems with distributed memory, which is ...
Mourad Hakem, Franck Butelle
STOC
2004
ACM
84views Algorithms» more  STOC 2004»
16 years 2 months ago
Computing Nash equilibria for scheduling on restricted parallel links
Martin Gairing, Thomas Lücking, Marios Mavron...
STOC
1999
ACM
123views Algorithms» more  STOC 1999»
15 years 6 months ago
Covering Rectilinear Polygons with Axis-Parallel Rectangles
We give an O( log n) factor approximation algorithm for covering a rectilinear polygon with holes using axis-parallel rectangles. This is the first polynomial time approximation a...
V. S. Anil Kumar, H. Ramesh
ESA
2006
Springer
76views Algorithms» more  ESA 2006»
15 years 6 months ago
Parallel Machine Scheduling Through Column Generation: Minimax Objective Functions
Marjan van den Akker, J. A. Hoogeveen, Jules W. va...