Sciweavers

8025 search results - page 152 / 1605
» Combinators Introduction: An Algorithm
Sort
View
102
Voted
STACS
2009
Springer
15 years 8 months ago
Semi-Online Preemptive Scheduling: One Algorithm for All Variants
We present a unified optimal semi-online algorithm for preemptive scheduling on uniformly related machines with the objective to minimize the makespan. This algorithm works for a...
Tomás Ebenlendr, Jiri Sgall
145
Voted
ANTSW
2004
Springer
15 years 7 months ago
A Comparison Between ACO Algorithms for the Set Covering Problem
Abstract. In this paper we present a study of several Ant Colony Optimization (ACO) algorithms for the Set Covering Problem. In our computational study we emphasize the influence ...
Lucas Lessing, Irina Dumitrescu, Thomas Stütz...
STOC
2010
ACM
186views Algorithms» more  STOC 2010»
15 years 6 months ago
Faster approximation schemes for fractional multicommodity flow problems via dynamic graph algorithms
We combine the work of Garg and K¨onemann, and Fleischer with ideas from dynamic graph algorithms to obtain faster (1 − ε)-approximation schemes for various versions of the mu...
Aleksander Madry
SI3D
1997
ACM
15 years 6 months ago
3D Chainmail: A Fast Algorithm for Deforming Volumetric Objects
An algorithm is presented that enables fast deformation of volumetric objects. Using this algorithm, rigid, deformable, elastic and plastic materials can be modeled by adjusting d...
Sarah F. Frisken Gibson
GECCO
2010
Springer
183views Optimization» more  GECCO 2010»
15 years 5 months ago
Benchmarking a MOS-based algorithm on the BBOB-2010 noisy function testbed
In this paper, a hybrid algorithm based on the Multiple Offspring Sampling framework is presented and benchmarked on the BBOB-2010 noisy testbed. MOS allows the seamless combinat...
Antonio LaTorre, Santiago Muelas, José Mar&...