Skip navigation
Home
Browse
Communities
& Collections
Browse Items by:
Issue Date
Author
Title
Advisor
Help
Sign on to:
My DSpace
Receive email
updates
Edit Profile
Adelaide Research & Scholarship
Adelaide Research & Scholarship
Search
Search:
All collections
Schools and Disciplines
School of Computer Science
Computer Science publications
for
Current filters:
Title
Author
Subject
Date Issued
Advisor
School
Department
Organisation
Equals
Contains
ID
Not Equals
Not Contains
Not ID
Title
Author
Subject
Date Issued
Advisor
School
Department
Organisation
Equals
Contains
ID
Not Equals
Not Contains
Not ID
Start a new search
Add filters:
Use filters to refine the search results.
Title
Author
Subject
Date Issued
Advisor
School
Department
Organisation
Equals
Contains
ID
Not Equals
Not Contains
Not ID
Results 81-90 of 120 (Search time: 0.003 seconds).
previous
1
...
6
7
8
9
10
11
12
next
Item hits:
Preview
Issue Date
Title
Author(s)
2011
Runtime analysis of the 1-ANT ant colony optimizer
Doerr, B.
;
Neumann, F.
;
Sudholt, D.
;
Witt, C.
2017
Expected Fitness Gains of Randomized Search Heuristics for the Traveling Salesperson Problem
Nallaperuma, S.
;
Neumann, F.
;
Sudholt, D.
2017
Time Complexity Analysis of Evolutionary Algorithms on Random Satisfiable k-CNF Formulas
Doerr, B.
;
Neumann, F.
;
Sutton, A.
2013
Evolving pacing strategies for team pursuit track cycling
Wagner, M.
;
Day, J.
;
Jordan, C.
;
Kroeger, T.
;
Neumann, F.
;
Metaheuristics International Conference (9th : 2011 : Udine, Italy)
2018
Design and analysis of diversity-based parent selection schemes for speeding up evolutionary multi-objective optimisation
Covantes Osuna, E.
;
Gao, W.
;
Neumann, F.
;
Sudholt, D.
2012
Computational complexity analysis of multi-objective genetic programming
Neumann, F.
;
Soule, T.
;
Genetic and Evolutionary Computation Conference (14th : 2012 : Philadelphia, Pennsylvania)
2017
Ahura: a heuristic-based racer for the open racing car simulator
Bonyadi, M.
;
Michalewicz, Z.
;
Nallaperuma, S.
;
Neumann, F.
2011
Computational Complexity Analysis of Genetic Programming - Initial Results and Future Directions
Neumann, F.
;
O'Reilly, U.
;
Wagner, M.
;
Riolo, R.
;
Vladislavleva, E.
;
Moore, J.
2011
Computational complexity analysis of simple genetic programming on two problems modeling isolated program semantics
Durrett, G.
;
Neumann, F.
;
O'Reilly, U.
;
ACM SIGEVO Workshop on Foundations of Genetic Algorithms (11th : 2011 : Schwarzenberg, Austria)
2010
Bioinspired computation in combinatorial optimization : algorithms and their computational complexity
Neumann, F.
;
Witt, C.
Discover
Author
31
Wagner, M.
21
Friedrich, T.
13
Nallaperuma, S.
12
Sutton, A.
11
Gao, W.
9
Doerr, B.
9
Sudholt, D.
9
Witt, C.
8
Kotzing, T.
8
Neumann, A.
.
next >
Subject
6
Genetic programming
6
theory
5
runtime analysis
5
Theory
3
Ant Colony Optimization
3
Runtime Analysis
2
Algorithms
2
Approximation
2
Classification
2
Evolutionary Algorithms
.
next >
Date issued
15
2018
12
2017
10
2016
14
2015
12
2014
16
2013
16
2012
13
2011
12
2010