Sciweavers

16093 search results - page 290 / 3219
» On the optimality of the neighbor-joining algorithm
Sort
View
GECCO
2009
Springer
133views Optimization» more  GECCO 2009»
15 years 4 months ago
Improved analysis methods for crossover-based algorithms
We deepen the theoretical analysis of the genetic algorithm for the all-pairs shortest path problem proposed by Doerr, Happ and Klein (GECCO 2008). We show that the growth of the ...
Benjamin Doerr, Madeleine Theile
GECCO
2006
Springer
159views Optimization» more  GECCO 2006»
15 years 10 months ago
A new version of the ant-miner algorithm discovering unordered rule sets
The Ant-Miner algorithm, first proposed by Parpinelli and colleagues, applies an ant colony optimization heuristic to the classification task of data mining to discover an ordered...
James Smaldon, Alex Alves Freitas
TCS
2008
15 years 6 months ago
Comparing evolutionary algorithms to the (1+1)-EA
In this paper, we study the conditions in which the (1+1)-EA compares favorably to other evolutionary algorithms (EAs) in terms of fitness function distribution at given iteration...
Pavel A. Borisovsky, Anton V. Eremeev
SIAMCOMP
2010
104views more  SIAMCOMP 2010»
15 years 1 months ago
Server Scheduling to Balance Priorities, Fairness, and Average Quality of Service
Often server systems do not implement the best known algorithms for optimizing average Quality of Service (QoS) out of concern of that these algorithms may be insufficiently fair ...
Nikhil Bansal, Kirk Pruhs
AAIM
2008
Springer
110views Algorithms» more  AAIM 2008»
16 years 1 months ago
Fixed-Parameter Algorithms for Kemeny Scores
The Kemeny Score problem is central to many applications in the context of rank aggregation. Given a set of permutations (votes) over a set of candidates, one searches for a “con...
Nadja Betzler, Michael R. Fellows, Jiong Guo, Rolf...