Sciweavers

511 search results - page 22 / 103
» Using Combinatorial Optimization Methods for Quantification ...
Sort
View
ALGORITHMICA
2002
120views more  ALGORITHMICA 2002»
15 years 1 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...
ICIP
2005
IEEE
15 years 7 months ago
Receiver-driven rate-distortion optimized streaming of light fields
Previous work on rate-distortion optimized streaming of light fields assumes that the scheduling task is performed by a central server. To scale to large numbers of simultaneous ...
Prashant Ramanathan, Bernd Girod
JCIT
2007
174views more  JCIT 2007»
15 years 1 months ago
Scheduling of scientific workflows using Discrete PSO Algorithm for Grids
Grid computing systems utilize distributive owned and geographically dispersed resources for providing a wide variety of services for various applications. It is possible that the...
Shajulin Benedict V. Vasudevan
116
Voted
STOC
2004
ACM
150views Algorithms» more  STOC 2004»
16 years 2 months ago
Typical properties of winners and losers in discrete optimization
We present a probabilistic analysis for a large class of combinatorial optimization problems containing, e.g., all binary optimization problems defined by linear constraints and a...
René Beier, Berthold Vöcking
DAC
2006
ACM
16 years 2 months ago
Design space exploration using time and resource duality with the ant colony optimization
Design space exploration during high level synthesis is often conducted through ad-hoc probing of the solution space using some scheduling algorithm. This is not only time consumi...
Gang Wang, Wenrui Gong, Brian DeRenzi, Ryan Kastne...