Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Journal=Theor.~Comput.~Sci. AND Volume=545
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
On the runtime analysis of the Simple Genetic Algorithm
Pietro S. Oliveto
,
Carsten Witt
Theoretical Computer Science
545
, 2014, pp. 2-19
The choice of the offspring population size in the
(1,\lambda)
evolutionary algorithm
Jonathan E. Rowe
,
Dirk Sudholt
Theoretical Computer Science
545
, 2014, pp. 20-38
Performance analysis of randomised search heuristics operating with a fixed budget
Thomas Jansen
,
Christine Zarges
Theoretical Computer Science
545
, 2014, pp. 39-58
The component model for elementary landscapes and partial neighborhoods
Darrell Whitley
,
Andrew M. Sutton
,
Gabriela Ochoa
,
Francisco Chicano
Theoretical Computer Science
545
, 2014, pp. 59-75
Exact computation of the expectation surfaces for uniform crossover along with bit-flip mutation
Francisco Chicano
,
Darrell Whitley
,
Enrique Alba
Theoretical Computer Science
545
, 2014, pp. 76-93
The Max problem revisited: The importance of mutation in genetic programming
Timo Kötzing
,
Andrew M. Sutton
,
Frank Neumann
,
Una-May O'Reilly
Theoretical Computer Science
545
, 2014, pp. 94-107
Reducing the arity in unbiased black-box complexity
Benjamin Doerr
,
Carola Winzen
Theoretical Computer Science
545
, 2014, pp. 108-121