Search Results

Documents authored by Langdon, William B.

Found 2 Possible Name Variants:

Langdon, William B.

Document
DOI: 10.4230/DagRep.8.1.158
Genetic Improvement of Software (Dagstuhl Seminar 18052)

Authors: Justyna Petke, Claire Le Goues, Stephanie Forrest, and William B. Langdon

Published in: Dagstuhl Reports, Volume 8, Issue 1 (2018)

Abstract
We document the program and the immediate outcomes of Dagstuhl Seminar 18052 "Genetic Improvement of Software". The seminar brought together researchers in Genetic Improvement (GI) and related areas of software engineering to investigate what is achievable with current technology and the current impediments to progress and how GI can affect the software development process. Several talks covered the state-of-the-art and work in progress. Seven emergent topics have been identified ranging from the nature of the GI search space through benchmarking and practical applications. The seminar has already resulted in multiple research paper publications. Four by participants of the seminar will be presented at the GI workshop co-located with the top conference in software engineering - ICSE. Several researchers started new collaborations, results of which we hope to see in the near future.
Cite as

Justyna Petke, Claire Le Goues, Stephanie Forrest, and William B. Langdon. Genetic Improvement of Software (Dagstuhl Seminar 18052). In Dagstuhl Reports, Volume 8, Issue 1, pp. 158-182, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)

Copy BibTex To Clipboard

@Article{petke_et_al:DagRep.8.1.158,
  author =	{Petke, Justyna and Le Goues, Claire and Forrest, Stephanie and Langdon, William B.},
  title =	{{Genetic Improvement of Software (Dagstuhl Seminar 18052)}},
  pages =	{158--182},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2018},
  volume =	{8},
  number =	{1},
  editor =	{Petke, Justyna and Le Goues, Claire and Forrest, Stephanie and Langdon, William B.},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagRep.8.1.158},
  URN =		{urn:nbn:de:0030-drops-92878},
  doi =		{10.4230/DagRep.8.1.158},
  annote =	{Keywords: genetic improvement GI, search-based software engineering SBSE, software optimisation, evolutionary improvement, automated software improvement, automated program repair, evolutionary computation, genetic programming, GP}
}
Document
DOI: 10.4230/DagSemProc.06061.7
On Turing complete T7 and MISC F--4 program fitnes landscapes

Authors: William B. Langdon and Riccardo Poli

Published in: Dagstuhl Seminar Proceedings, Volume 6061, Theory of Evolutionary Algorithms (2006)

Abstract
We use the minimal instruction set F-4 computer to define a minimal Turing complete T7 computer suitable for genetic programming (GP) and amenable to theoretical analysis. Experimental runs and mathematical analysis of the T7, show the fraction of halting programs is drops to zero as bigger programs are run.
Cite as

William B. Langdon and Riccardo Poli. On Turing complete T7 and MISC F--4 program fitnes landscapes. In Theory of Evolutionary Algorithms. Dagstuhl Seminar Proceedings, Volume 6061, pp. 1-28, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2006)

Copy BibTex To Clipboard

@InProceedings{langdon_et_al:DagSemProc.06061.7,
  author =	{Langdon, William B. and Poli, Riccardo},
  title =	{{On Turing complete T7 and MISC F--4 program fitnes landscapes}},
  booktitle =	{Theory of Evolutionary Algorithms},
  pages =	{1--28},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2006},
  volume =	{6061},
  editor =	{Dirk V. Arnold and Thomas Jansen and Michael D. Vose and Jonathan E. Rowe},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.06061.7},
  URN =		{urn:nbn:de:0030-drops-5956},
  doi =		{10.4230/DagSemProc.06061.7},
  annote =	{Keywords: Genetic programming}
}

Langdon, William

Document
DOI: 10.4230/DagSemProc.10361.2
2-bit Flip Mutation Elementary Fitness Landscapes

Authors: William Langdon

Published in: Dagstuhl Seminar Proceedings, Volume 10361, Theory of Evolutionary Algorithms (2010)

Abstract
Genetic Programming parity is not elementary. GP parity cannot be represented as the sum of a small number of elementary landscapes. Statistics, including fitness distance correlation, of Parity's fitness landscape are calculated. Using Walsh analysis the eigen values and eigenvectors of the Laplacian of the two bit flip fitness landscape are given and a ruggedness measure for elementary landscapes is proposed. An elementary needle in a haystack (NIH) landscape is given.
Cite as

William Langdon. 2-bit Flip Mutation Elementary Fitness Landscapes. In Theory of Evolutionary Algorithms. Dagstuhl Seminar Proceedings, Volume 10361, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2010)

Copy BibTex To Clipboard

@InProceedings{langdon:DagSemProc.10361.2,
  author =	{Langdon, William},
  title =	{{2-bit Flip Mutation Elementary Fitness Landscapes}},
  booktitle =	{Theory of Evolutionary Algorithms},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2010},
  volume =	{10361},
  editor =	{Anne Auger and Jonathan L. Shapiro and L. Darrell Whitley and Carsten Witt},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.10361.2},
  URN =		{urn:nbn:de:0030-drops-28146},
  doi =		{10.4230/DagSemProc.10361.2},
  annote =	{Keywords: Genetic Algorithms, Genetic Programming, search, optimisation, graph theory, Laplacian, Hamming cube}
}
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2024 Schloss Dagstuhl – LZI GmbH Imprint Privacy Contact