default search action
Nicholas J. Radcliffe
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2014
- [p2]Patrick D. Surry, Nicholas J. Radcliffe:
Formal Search Algorithms + Problem Characterisations = Executable Search Strategies. Theory and Principled Methods for the Design of Metaheuristics 2014: 247-270 - 2012
- [b1]Nicholas J. Radcliffe, Nicholas H. Tollervey:
Getting Started with Fluidinfo - The Openly Writable Shared Datastore. O'Reilly 2012, ISBN 978-1-449-30709-7, pp. I-XI, 1-119
1990 – 1999
- 1997
- [j5]Felicity A. W. George, Nicholas J. Radcliffe, Mark Smith, Mark H. Birkin, Martin Clarke:
Algorithms for solving a spatial optimisation problem on a parallel computer. Concurr. Pract. Exp. 9(8): 753-780 (1997) - 1996
- [c13]Patrick D. Surry, Nicholas J. Radcliffe:
Inoculation to Initialise Evolutionary Search. Evolutionary Computing, AISB Workshop 1996: 269-285 - [c12]Patrick D. Surry, Nicholas J. Radcliffe:
Real Representations. FOGA 1996: 343-363 - [c11]Ian W. Flockhart, Nicholas J. Radcliffe:
A Genetic Algorithm-Based Approach to Data Mining. KDD 1996: 299-302 - [c10]Patrick D. Surry, Nicholas J. Radcliffe:
Formal Algorithms + Formal Representations = Search Strategies. PPSN 1996: 366-375 - 1995
- [c9]Patrick D. Surry, Nicholas J. Radcliffe, Ian D. Boyd:
A Multi-objective Approach to Constrained Optimisation of Gas Supply Networks: the COMOGA Method. Evolutionary Computing, AISB Workshop 1995: 166-180 - [p1]Nicholas J. Radcliffe, Patrick D. Surry:
Fundamental Limitations on Search Algorithms: Evolutionary Computing in Perspective. Computer Science Today 1995: 275-291 - 1994
- [c8]Nicholas J. Radcliffe, Patrick D. Surry:
Formal Memetic Algorithms. Evolutionary Computing, AISB Workshop 1994: 1-16 - [c7]Nicholas J. Radcliffe, Patrick D. Surry:
Fitness Variance of Formae and Performance Prediction. FOGA 1994: 51-72 - [c6]Patrick D. Surry, Nicholas J. Radcliffe:
RPL2: A Language and Parallel Framework for Evolutionary Computing. PPSN 1994: 628-637 - 1993
- [j4]Nicholas J. Radcliffe:
The Algebra of Genetic Algorithms. Ann. Math. Artif. Intell. 10(4): 339-384 (1993) - [j3]Nicholas J. Radcliffe:
Genetic Set Recombination and Its Application to Neural Network Topology Optimisation. Neural Comput. Appl. 1(1): 67-90 (1993) - [c5]Nicholas J. Radcliffe, Felicity A. W. George:
A Study in Set Recombination. ICGA 1993: 23-30 - 1992
- [c4]Nicholas J. Radcliffe:
Genetic Set Recombination. FOGA 1992: 203-219 - [c3]Nicholas J. Radcliffe:
Non-Linear Genetic Representations. PPSN 1992: 261-270 - 1991
- [j2]Nicholas J. Radcliffe:
Equivalence Class Analysis of Genetic Algorithms. Complex Syst. 5(2) (1991) - [c2]Nicholas J. Radcliffe:
Forma Analysis and Random Respectful Recombination. ICGA 1991: 222-229 - 1990
- [j1]D. M. N. Prior, M. G. Norman, Nicholas J. Radcliffe, L. J. Clarke:
What Price Regularity? Concurr. Pract. Exp. 2(1): 55-78 (1990)
1980 – 1989
- 1989
- [c1]M. G. Norman, Nicholas J. Radcliffe, Gareth D. Richards, Frank J. Smieja, D. J. Wallace, J. F. Collins, S. J. Hayward, B. M. Forrest:
Neural Network Applications in the Edinburgh Concurrent Supercomputer Project. NATO Neurocomputing 1989: 181-193
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-25 05:54 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint