Result 1 to 20 of 122 total
Local search and the traveling salesman problem: a feature-based characterization of problem hardness. (English)
Hamadi, Youssef (ed.) et al., Learning and intelligent optimization. 6th international conference, LION 6, Paris, France, January 16‒20, 2012. Revised selected papers. Berlin: Springer (ISBN 978-3-642-34412-1/pbk). Lecture Notes in Computer Science 7219, 115-129 (2012).
1
Convergence of set-based multi-objective optimization, indicators and deteriorative cycles. (English)
Theor. Comput. Sci. 456, 2-17 (2012).
2
Optimising spatial and tonal data for homogeneous diffusion inpainting. (English)
Bruckstein, Alfred M. (ed.) et al., Scale space and variational methods in computer vision. Third international conference, SSVM 2011, Ein-Gedi, Israel, May 29‒June 2, 2011. Revised selected papers. Berlin: Springer (ISBN 978-3-642-24784-2/pbk). Lecture Notes in Computer Science 6667, 26-37 (2012).
3
Computational complexity analysis of genetic programming - initial results and future directions. (English)
Riolo, Rick (ed.) et al., Genetic programming theory and practice IX. Selected papers based on the presentations at the 9th workshop, Ann Arbor, MI, USA, May 12‒14, 2011. Foreword by Una-Maay O’Reilly. New York, NY: Springer (ISBN 978-1-4614-1769-9/hbk; 978-1-4614-1770-5/ebook). Genetic and Evolutionary Computation, 113-128 (2011).
4
Weighted preferences in evolutionary multi-objective optimization. (English)
Wang, Dianhui (ed.) et al., AI 2011: Advances in artificial intelligence. 24th Australasian joint conference, Perth, Australia, December 5‒8, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-25831-2/pbk). Lecture Notes in Computer Science 7106. Lecture Notes in Artificial Intelligence, 291-300 (2011).
5
Evolutionary algorithms and dynamic programming. (English)
Theor. Comput. Sci. 412, No. 43, 6020-6035 (2011).
6
Evolving pacing strategies for team pursuit track cycling. (English)
Comput. Res. Repos. 2011, Article No. 1104.0775 (2011).
7
Computational complexity results for genetic programming and the sorting problem. (English)
Comput. Res. Repos. 2011, Article No. 1103.5797 (2011).
8
Computing minimum cuts by randomized search heuristics. (English)
Algorithmica 59, No. 3, 323-342 (2011).
9
Runtime analysis of the 1-ANT ant colony optimizer. (English)
Theor. Comput. Sci. 412, No. 17, 1629-1644 (2011).
10
Illustration of fairness in evolutionary multi-objective optimization. (English)
Theor. Comput. Sci. 412, No. 17, 1546-1556 (2011).
11
Velocity adaptation in particle swarm optimization. (English)
Panigrahi, Bijaya Ketan (ed.) et al., Handbook of swarm intelligence. Concepts, principles and applications. Berlin: Springer (ISBN 978-3-642-17389-9/hbk; 978-3-642-17390-5/ebook). Adaptation, Learning, and Optimization 8, 155-173 (2011).
12
Foundations of evolutionary multi-objective optimization (English)
GECCO (Companion), 1213-1232 (2011).
13
On the effectiveness of crossover for migration in parallel evolutionary algorithms (English)
GECCO, 1587-1594 (2011).
14
PAC learning and genetic programming (English)
GECCO, 2091-2096 (2011).
15
Computational complexity and evolutionary computation (English)
GECCO (Companion), 1053-1080 (2011).
16
Approximation-guided evolutionary multi-objective optimization (English)
IJCAI, 1198-1203 (2011).
17
Weighted preferences in evolutionary multi-objective optimization (English)
Australasian Conference on Artificial Intelligence, 291-300 (2011).
18
Simple Max-min ant systems and the optimization of linear pseudo-Boolean functions (English)
FOGA, 209-218 (2011).
19
Computational complexity analysis of simple genetic programming on two problems modeling isolated program semantics (English)
FOGA, 69-80 (2011).
20
Result 1 to 20 of 122 total