Sciweavers

126
Voted
GECCO
2006
Springer
157views Optimization» more  GECCO 2006»
15 years 7 months ago
How randomized search heuristics find maximum cliques in planar graphs
Surprisingly, general search heuristics often solve combinatorial problems quite sufficiently, although they do not outperform specialized algorithms. Here, the behavior of simple...
Tobias Storch
131
Voted
GECCO
2006
Springer
179views Optimization» more  GECCO 2006»
15 years 7 months ago
Evolving cooperative behavior in a power market
This paper presents an evolutionary algorithm to develop cooperative strategies for power buyers in a deregulated electrical power market. Cooperative strategies are evolved throu...
Dipti Srinivasan, Dakun Woo, Lily Rachmawati, Kong...
GECCO
2006
Springer
130views Optimization» more  GECCO 2006»
15 years 7 months ago
An efficient multi-objective evolutionary algorithm with steady-state replacement model
The generic Multi-objective Evolutionary Algorithm (MOEA) aims to produce Pareto-front approximations with good convergence and diversity property. To achieve convergence, most mu...
Dipti Srinivasan, Lily Rachmawati
142
Voted
GECCO
2006
Springer
220views Optimization» more  GECCO 2006»
15 years 7 months ago
Comparing evolutionary algorithms on the problem of network inference
In this paper, we address the problem of finding gene regulatory networks from experimental DNA microarray data. We focus on the evaluation of the performance of different evoluti...
Christian Spieth, Rene Worzischek, Felix Streicher...
GECCO
2006
Springer
165views Optimization» more  GECCO 2006»
15 years 7 months ago
Comparing mathematical models on the problem of network inference
In this paper we address the problem of finding gene regulatory networks from experimental DNA microarray data. We focus on the evaluation of the performance of different mathemat...
Christian Spieth, Nadine Hassis, Felix Streichert