Sciweavers

4342 search results - page 602 / 869
» Improved Algorithms for Optimal Embeddings
Sort
View
GECCO
2006
Springer
218views Optimization» more  GECCO 2006»
15 years 9 months ago
A survey of mutation techniques in genetic programming
The importance of mutation varies across evolutionary computation domains including: genetic programming, evolution strategies, and genetic algorithms. In the genetic programming ...
Alan Piszcz, Terence Soule
GECCO
2006
Springer
133views Optimization» more  GECCO 2006»
15 years 9 months ago
Selecting for evolvable representations
Evolutionary algorithms tend to produce solutions that are not evolvable: Although current fitness may be high, further search is impeded as the effects of mutation and crossover ...
Joseph Reisinger, Risto Miikkulainen
GECCO
2010
Springer
157views Optimization» more  GECCO 2010»
15 years 7 months ago
Mirrored variants of the (1, 4)-CMA-ES compared on the noiseless BBOB-2010 testbed
Derandomization by means of mirrored samples has been recently introduced to enhance the performances of (1, λ)Evolution-Strategies (ESs) with the aim of designing fast and robus...
Anne Auger, Dimo Brockhoff, Nikolaus Hansen
MONET
2006
107views more  MONET 2006»
15 years 5 months ago
Utilization and fairness in spectrum assignment for opportunistic spectrum access
The Open Spectrum approach to spectrum access can achieve near-optimal utilization by allowing devices to sense and utilize available spectrum opportunistically. However, a naive d...
Chunyi Peng, Haitao Zheng, Ben Y. Zhao
PR
2008
85views more  PR 2008»
15 years 5 months ago
Quadratic boosting
This paper presents a strategy to improve the AdaBoost algorithm with a quadratic combination of base classifiers. We observe that learning this combination is necessary to get be...
Thang V. Pham, Arnold W. M. Smeulders