2445 search results - page 27 / 489 » The Problem with Evolutionary Art Is .. |
163
click to vote
EVOW
2007
Springer
16 years 5 days ago
2007
Springer
We present a Lagrangian decomposition approach for the Knapsack Constrained Maximum Spanning Tree problem yielding upper bounds as well as heuristic solutions. This method is furth...
153
click to vote
CEC
2007
IEEE
16 years 10 days ago
2007
IEEE
— For complex optimization problems, several population-based heuristics like Multi-Objective Evolutionary Algorithms have been developed. These algorithms are aiming to deliver ...
130
click to vote
ISICA
2007
Springer
16 years 4 days ago
2007
Springer
In this paper the authors point out that the Pareto Optimality is unfair, unreasonable and imperfect for Many-objective Optimization Problems (MOPs) underlying the hypothesis that ...
154
click to vote
PPSN
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. The multiple sequence alignment problem (MSA) can be reformulated as the problem of finding a maximum weight trace in an alignment graph, which is derived from all pairw...
131
click to vote
GECCO
2000
Springer
15 years 9 months ago
2000
Springer
This paper describes an evolutionary search scheduling algorithm (ESSA) for the job shop scheduling problem (JSSP). If no specific knowledge of the problem is included in the EA t...