Sciweavers

6897 search results - page 674 / 1380
» Parallelization of Modular Algorithms
Sort
View
ALGORITHMICA
2002
120views more  ALGORITHMICA 2002»
15 years 7 months ago
An Experimental Study of Algorithms for Weighted Completion Time Scheduling
We consider the total weighted completion time scheduling problem for parallel identical machines and precedence constraints, P jprecj PwiCi. This important and broad class of pro...
Ivan D. Baev, Waleed Meleis, Alexandre E. Eichenbe...
SCHEDULING
2011
15 years 2 months ago
On robust online scheduling algorithms
While standard parallel machine scheduling is concerned with good assignments of jobs to machines, we aim to understand how the quality of an assignment is affected if the jobsâ€...
Michael Gatto, Peter Widmayer
DC
2011
14 years 6 months ago
Distributed algorithms for covering, packing and maximum weighted matching
Abstract This paper gives poly-logarithmic-round, distributed δ-approximation algorithms for covering problems with submodular cost and monotone covering constraints (Submodular-c...
Christos Koufogiannakis, Neal E. Young
DAGSTUHL
1997
15 years 8 months ago
Ray-Based Data Level Comparisons of Direct Volume Rendering Algorithms
This paper describes and demonstrates the e ectiveness of several metrics for data level comparison of direct volume rendering (DVR) algorithms. The focus is not on speed ups from...
Kwansik Kim, Alex Pang
BMCBI
2008
130views more  BMCBI 2008»
15 years 7 months ago
An enhanced partial order curve comparison algorithm and its application to analyzing protein folding trajectories
Background: Understanding how proteins fold is essential to our quest in discovering how life works at the molecular level. Current computation power enables researchers to produc...
Hong Sun, Hakan Ferhatosmanoglu, Motonori Ota, Yus...