Sciweavers

16093 search results - page 352 / 3219
» On the optimality of the neighbor-joining algorithm
Sort
View
STACS
2009
Springer
16 years 1 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
210
Voted
ANTSW
2004
Springer
16 years 7 days 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...
GECCO
2009
Springer
117views Optimization» more  GECCO 2009»
15 years 11 months ago
BBOB-benchmarking a simple estimation of distribution algorithm with cauchy distribution
The restarted estimation of distribution algorithm (EDA) with Cauchy distribution as the probabilistic model is tested on the BBOB 2009 testbed. These tests prove that when using ...
Petr Posik
EVOW
2001
Springer
15 years 11 months ago
Design of Iterated Local Search Algorithms
In this article we investigate the application of iterated local search (ILS) to the single machine total weighted tardiness problem. Our research is inspired by the recently propo...
Matthijs den Besten, Thomas Stützle, Marco Do...
GECCO
1999
Springer
115views Optimization» more  GECCO 1999»
15 years 11 months ago
A Diversity Study in Genetic Algorithms for Job Shop Scheduling Problems
This paper deals with the study of population diversity in Genetic Algorithms for Job Shop Scheduling Problems. A definition of population diversity at the phenotype level and a ...
Carlos A. Brizuela, Nobuo Sannomiya