454 search results - page 26 / 91 » On improving approximate solutions by evolutionary algorithm... |
143
click to vote
ASAP
2004
IEEE
15 years 5 months ago
2004
IEEE
Dynamic programming for approximate string matching is a large family of different algorithms, which vary significantly in purpose, complexity, and hardware utilization. Many impl...
128
click to vote
ARTMED
2002
15 years 1 months ago
2002
This paper presents an evolutionary artificial neural network approach based on the pareto differential evolution algorithm augmented with local search for the prediction of breas...
160
Voted
EC
2011
14 years 8 months ago
2011
Abstract—In the field of evolutionary multi-criterion optimization, the hypervolume indicator is the only single set quality measure that is known to be strictly monotonic with ...
134
click to vote
CSC
2009
15 years 2 months ago
2009
- The Traveling Salesman Problem (TSP) is perhaps the most famous optimization problem in the set NP-hard. Many problems that are natural applications in computer science and engin...
129
click to vote
GECCO
2004
Springer
15 years 6 months ago
2004
Springer
Estimation of distribution algorithms (EDAs) are population-based heuristic search methods that use probabilistic models of good solutions to guide their search. When applied to co...