Sciweavers

233 search results - page 2 / 47
» On Some Optimization Heuristics for Lesk-Like WSD Algorithms
Sort
View
EC
2007
167views ECommerce» more  EC 2007»
13 years 5 months ago
Comparison-Based Algorithms Are Robust and Randomized Algorithms Are Anytime
Randomized search heuristics (e.g., evolutionary algorithms, simulated annealing etc.) are very appealing to practitioners, they are easy to implement and usually provide good per...
Sylvain Gelly, Sylvie Ruette, Olivier Teytaud
ICANNGA
2009
Springer
163views Algorithms» more  ICANNGA 2009»
13 years 9 months ago
Elitistic Evolution: An Efficient Heuristic for Global Optimization
A new evolutionary algorithm, Elitistic Evolution (termed EEv), is proposed in this paper. EEv is an evolutionary method for numerical optimization with adaptive behavior. EEv uses...
Francisco Viveros Jiménez, Efrén Mez...
CCE
2004
13 years 5 months ago
An algorithmic framework for improving heuristic solutions: Part II. A new version of the stochastic traveling salesman problem
The algorithmic framework developed for improving heuristic solutions of the new version of deterministic TSP [Choi et al., 2002] is extended to the stochastic case. To verify the...
Jaein Choi, Jay H. Lee, Matthew J. Realff
AINA
2004
IEEE
13 years 9 months ago
On the Performance of Heuristic H MCOP for Multi-Constrained Optimal-Path QoS Routing
Network services for finding a feasible or an optimal path subject to multiple constraints on performance metrics such as delay, jitter, loss probability, etc. give rise to multip...
Gang Feng
GECCO
2009
Springer
131views Optimization» more  GECCO 2009»
13 years 9 months ago
Adaptive evolution: an efficient heuristic for global optimization
This paper presents a novel evolutionary approach to solve numerical optimization problems, called Adaptive Evolution (AEv). AEv is a new micro-population-like technique because i...
Francisco Viveros Jiménez, Efrén Mez...