Sciweavers

5331 search results - page 158 / 1067
» Algebraic Methods for Optimization Problems
Sort
View
DEXAW
2008
IEEE
119views Database» more  DEXAW 2008»
15 years 4 months ago
Evolutionary Approaches to Linear Ordering Problem
Linear Ordering Problem (LOP) is a well know optimization problem attractive for its complexity (it is a NPhard problem), rich collection of testing data and variety of real world...
Václav Snásel, Pavel Krömer, Ja...
CASC
2009
Springer
157views Mathematics» more  CASC 2009»
15 years 4 months ago
On the Complexity of Reliable Root Approximation
This work addresses the problem of computing a certified ǫ-approximation of all real roots of a square-free integer polynomial. We proof an upper bound for its bit complexity, b...
Michael Kerber
GECCO
2004
Springer
117views Optimization» more  GECCO 2004»
15 years 3 months ago
Comparing Search Algorithms for the Temperature Inversion Problem
Several inverse problems exist in the atmospheric sciences that are computationally costly when using traditional gradient based methods. Unfortunately, many standard evolutionary ...
Monte Lunacek, L. Darrell Whitley, Philip Gabriel,...
EVOW
2000
Springer
15 years 1 months ago
An Ant Algorithm with a New Pheromone Evaluation Rule for Total Tardiness Problems
Ant Colony Optimization is an evolutionary method that has recently been applied to scheduling problems. We propose an ACO algorithm for the Single Machine Total Weighted Tardiness...
Daniel Merkle, Martin Middendorf
GECCO
2005
Springer
115views Optimization» more  GECCO 2005»
15 years 3 months ago
A generator for hierarchical problems
We describe a generator for hierarchical problems called the Hierarchical Problem Generator (HPG). Hierarchical problems are of interest since they constitute a class of problems ...
Edwin D. de Jong, Richard A. Watson, Dirk Thierens