Tight Analysis of the (1 + 1)-EA for the Single Source Shortest Path Problem.
- Published in:
- Evolutionary Computation, 2011, v. 19, n. 4, p. 673, doi. 10.1162/EVCO_a_00047
- By:
- Publication type:
- Article
Works matching IS 10636560 AND DT 2011 AND VI 19 AND IP 4
Results: 6
1
2
Formal Analysis, Hardness, and Algorithms for Extracting Internal Structure of Test-Based Problems.
- Published in:
- Evolutionary Computation, 2011, v. 19, n. 4, p. 639
- By:
- Publication type:
- Article
3
Revisiting the Restricted Growth Function Genetic Algorithm for Grouping Problems.
- Published in:
- Evolutionary Computation, 2011, v. 19, n. 4, p. 693, doi. 10.1162/EVCO_a_00040
- By:
- Publication type:
- Article
4
AMethodology to Find the Elementary Landscape Decomposition of Combinatorial Optimization Problems.
- Published in:
- Evolutionary Computation, 2011, v. 19, n. 4, p. 597, doi. 10.1162/EVCO_a_00039
- By:
- Publication type:
- Article
5
An Adaptive EvolutionaryMulti-Objective Approach Based on Simulated Annealing.
- Published in:
- Evolutionary Computation, 2011, v. 19, n. 4, p. 561, doi. 10.1162/EVCO_a_00038
- By:
- Publication type:
- Article
6
Multi-Objective Reliability-Based Optimization with Stochastic Metamodels.
- Published in:
- Evolutionary Computation, 2011, v. 19, n. 4, p. 525, doi. 10.1162/EVCO_a_00034
- By:
- Publication type:
- Article