Sciweavers

2147 search results - page 232 / 430
» Evolutionary Algorithms
Sort
View
GECCO
2004
Springer
129views Optimization» more  GECCO 2004»
15 years 12 months ago
Encoding Bounded-Diameter Spanning Trees with Permutations and with Random Keys
Permutations of vertices can represent constrained spanning trees for evolutionary search via a decoder based on Prim’s algorithm, and random keys can represent permutations. Tho...
Bryant A. Julstrom
SAC
2009
ACM
16 years 1 months ago
A gradient oriented recombination scheme for evolution strategies
This paper proposes a novel recombination scheme for evolutionary algorithms, which can guide the new population generation towards the maximum increase of the objective function....
Haifeng Chen, Guofei Jiang
ICAISC
2010
Springer
15 years 8 months ago
UMTS Base Station Location Planning with Invasive Weed Optimization
The problem of finding optimal locations of base stations, their pilot powers and channel assignments in UMTS mobile networks belongs to a class of NP-hard problems, and hence, me...
Rafal Zdunek, Tomasz Ignor
GECCO
2008
Springer
118views Optimization» more  GECCO 2008»
15 years 7 months ago
Unsupervised learning of echo state networks: balancing the double pole
A possible alternative to fine topology tuning for Neural Network (NN) optimization is to use Echo State Networks (ESNs), recurrent NNs built upon a large reservoir of sparsely r...
Fei Jiang, Hugues Berry, Marc Schoenauer
EMO
2009
Springer
235views Optimization» more  EMO 2009»
16 years 1 months ago
Bi-objective Optimization for the Vehicle Routing Problem with Time Windows: Using Route Similarity to Enhance Performance
Abstract. The Vehicle Routing Problem with Time Windows is a complex combinatorial optimization problem which can be seen as a fusion of two well known sub-problems: the Travelling...
Abel Garcia-Najera, John A. Bullinaria