default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDStephen Dignum
Person information
- affiliation: University of Essex, Colchester, UK
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2012
[j2]Sara Silva
, Stephen Dignum, Leonardo Vanneschi:
Operator equalisation for bloat free genetic programming and a survey of bloat control methods. Genet. Program. Evolvable Mach. 13(2): 197-238 (2012)- [j1]Malcolm Clark, Yunhyong Kim, Udo Kruschwitz, Dawei Song, M-Dyaa Albakour, Stephen Dignum, Ulises Cerviño Beresi, Maria Fasli, Anne N. De Roeck:
Automatically structuring domain knowledge from text: An overview of current research. Inf. Process. Manag. 48(3): 552-568 (2012) - 2010
- [c11]Stephen Dignum, Riccardo Poli:
Sub-tree Swapping Crossover and Arity Histogram Distributions. EuroGP 2010: 38-49 - [c10]Stephen Dignum, Udo Kruschwitz, Maria Fasli, Yunhyong Kim, Dawei Song, Ulises Cerviño Beresi, Anne N. De Roeck:
Incorporating Seasonality into Search Suggestions Derived from Intranet Query Logs. Web Intelligence 2010: 425-430 - [e1]Anna Isabel Esparcia-Alcázar, Anikó Ekárt, Sara Silva, Stephen Dignum, A. Sima Etaner-Uyar:
Genetic Programming, 13th European Conference, EuroGP 2010, Istanbul, Turkey, April 7-9, 2010. Proceedings. Lecture Notes in Computer Science 6021, Springer 2010, ISBN 978-3-642-12147-0 [contents]
2000 – 2009
- 2009
- [c9]Sara Silva, Stephen Dignum:
Extending Operator Equalisation: Fitness Based Self Adaptive Length Distribution for Bloat Free GP. EuroGP 2009: 159-170 - [c8]Stephen Dignum, Yunhyong Kim, Udo Kruschwitz, Dawei Song, Maria Fasli, Anne N. De Roeck:
Using Domain Models for Context-Rich User Logging. UIIR@SIGIR 2009 - 2008
- [b1]Stephen Dignum:
An analysis of genetic programming sub-tree swapping crossover with applications. University of Essex, Colchester, UK, 2008 - [c7]Stephen Dignum, Riccardo Poli:
Operator Equalisation and Bloat Free GP. EuroGP 2008: 110-121 - [c6]Stephen Dignum, Riccardo Poli:
Crossover, Sampling, Bloat and the Harmful Effects of Size Limits. EuroGP 2008: 158-169 - [c5]Edgar Galván López, Stephen Dignum, Riccardo Poli:
The Effects of Constant Neutrality on Performance and Problem Hardness in GP. EuroGP 2008: 312-324 - [c4]Stephen Dignum, Riccardo Poli:
Sub-tree Swapping Crossover, Allele Diffusion and GP Convergence. PPSN 2008: 368-377 - 2007
- [c3]Riccardo Poli, William B. Langdon, Stephen Dignum:
On the Limiting Distribution of Program Sizes in Tree-Based Genetic Programming. EuroGP 2007: 193-204 - [c2]Stephen Dignum, Riccardo Poli:
Generalisation of the limiting distribution of program sizes in tree-based genetic programming and analysis of its effects on bloat. GECCO 2007: 1588-1595 - 2004
- [c1]Stephen Dignum, Riccardo Poli:
Multi-agent Foreign Exchange Market Modelling Via GP. GECCO (1) 2004: 255-256
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:06 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
