6897 search results - page 687 / 1380 » Parallelization of Modular Algorithms |
159
click to vote
SPAA
1992
ACM
15 years 11 months ago
1992
ACM
d abstract) Michael Kaufmann Sanguthevar Rajasekaran Jop F. Sibeyn In this paper we present randomized algorithms for kk routing, k-k sorting, and cut through routing on the mesh ...
217
click to vote
ESA
2000
Springer
15 years 10 months ago
2000
Springer
We consider the problem of preemptively scheduling a set of n jobs on m (identical, uniformly related, or unrelated) parallel machines. The scheduler may reject a subset of the job...
180
click to vote
APPROX
2008
Springer
15 years 9 months ago
2008
Springer
Given a set of points in the plane, and a sweep-line as a tool, what is best way to move the points to a target point using a sequence of sweeps? In a sweep, the sweep-line is plac...
187
click to vote
EDOC
2008
IEEE
15 years 9 months ago
2008
IEEE
We present an algorithm for the runtime monitoring of business process properties with data parameterization. The properties are expressed in LTL-FO+ , an extension to traditional...
156
click to vote
CCGRID
2010
IEEE
15 years 8 months ago
2010
IEEE
Abstract--We propose several algorithms for topology aggregation (TA) to effectively summarize large-scale networks. These TA techniques are shown to significantly better for path ...