default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAlden H. Wright
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[c28]Alden H. Wright, Cheyenne L. Laue:
Evolving Complexity is Hard. GPTP 2022: 233-253- [i2]Alden H. Wright, Cheyenne L. Laue:
Evolving Complexity is Hard. CoRR abs/2209.13013 (2022) - 2021
- [c27]Alden H. Wright, Cheyenne L. Laue:
Evolvability and complexity properties of the digital circuit genotype-phenotype map. GECCO 2021: 840-848
2010 – 2019
- 2013
- [c26]Peter A. Whigham, Grant Dick, Alden H. Wright, Hamish G. Spencer
:
Structured Populations and the Maintenance of Sex. EvoBIO 2013: 56-67 - 2011
- [c25]Alden H. Wright, Tomás Gedeon, J. Neal Richter:
On the movement of vertex fixed points in the simple GA. FOGA 2011: 193-208 - [i1]Alden H. Wright:
The Exact Schema Theorem. CoRR abs/1105.3538 (2011) - 2010
- [j17]Jonathan E. Rowe, Michael D. Vose, Alden H. Wright:
Representation Invariant Genetic Operators. Evol. Comput. 18(4): 635-660 (2010)
2000 – 2009
- 2009
- [j16]Jonathan E. Rowe, Michael D. Vose, Alden H. Wright:
Reinterpreting No Free Lunch. Evol. Comput. 17(1): 117-129 (2009) - [j15]Seppo J. Ovaska, Bernhard Sick, Alden H. Wright:
Periodical switching between related goals for improving evolvability to a fixed goal in multi-objective problems. Inf. Sci. 179(23): 4046-4056 (2009) - 2008
- [j14]Boris Mitavskiy, Jonathan E. Rowe, Alden H. Wright, Lothar M. Schmitt:
Quotients of Markov chains and asymptotic properties of the stationary distribution of the Markov chain associated to an evolutionary algorithm. Genet. Program. Evolvable Mach. 9(2): 109-123 (2008) - [c24]J. Neal Richter, Alden H. Wright, John T. Paxton:
Ignoble Trails - Where Crossover Is Provably Harmful. PPSN 2008: 92-101 - 2007
- [c23]Jonathan E. Rowe, Michael D. Vose, Alden H. Wright:
Neighborhood Graphs and Symmetric Genetic Operators. FOGA 2007: 110-122 - 2006
- [j13]Jonathan E. Rowe, Michael D. Vose, Alden H. Wright:
Differentiable coarse graining. Theor. Comput. Sci. 361(1): 111-129 (2006) - [c22]Riccardo Poli, Alden H. Wright, Nicholas Freitag McPhee, William B. Langdon:
Emergent Behaviour, Population-based Search and Low-pass Filtering. IEEE Congress on Evolutionary Computation 2006: 88-95 - [c21]Alden H. Wright, J. Neal Richter:
Strong recombination, weak selection, and mutation. GECCO 2006: 1369-1376 - [c20]Boris Mitavskiy, Jonathan E. Rowe, Alden H. Wright, Lothar M. Schmitt:
Exploiting Quotients of Markov Chains to Derive Properties of the Stationary Distribution of the Markov Chain Associated to an Evolutionary Algorithm. SEAL 2006: 726-733 - 2005
- [j12]Jonathan E. Rowe, Michael D. Vose, Alden H. Wright:
State Aggregation and Population Dynamics in Linear Systems. Artif. Life 11(4): 473-492 (2005) - [c19]Jonathan E. Rowe, Michael D. Vose, Alden H. Wright:
Coarse Graining Selection and Mutation. FOGA 2005: 176-191 - [c18]Christopher R. Stephens, Adolfo Zamora, Alden H. Wright:
Perturbation Theory and the Renormalization Group in Genetic Dynamics. FOGA 2005: 192-214 - [c17]Alden H. Wright, Sandeep Pulavarty:
On the convergence of an estimation of distribution algorithm based on linkage discovery and factorization. GECCO 2005: 695-702 - [c16]J. Neal Richter, John T. Paxton, Alden H. Wright:
EA models and population fixed-points versus mutation rates for functions of unitation. GECCO 2005: 1233-1240 - [e1]Alden H. Wright, Michael D. Vose, Kenneth A. De Jong, Lothar M. Schmitt:
Foundations of Genetic Algorithms, 8th International Workshop, FOGA 2005, Aizu-Wakamatsu City, Japan, January 5-9, 2005, Revised Selected Papers. Lecture Notes in Computer Science 3469, Springer 2005, ISBN 3-540-27237-2 [contents] - 2004
- [j11]Jonathan E. Rowe, Michael D. Vose, Alden H. Wright:
Structural Search Spaces and Genetic Operators. Evol. Comput. 12(4): 461-493 (2004) - [j10]Robert B. Heckendorn, Alden H. Wright:
Efficient Linkage Discovery by Limited Probing. Evol. Comput. 12(4): 517-545 (2004) - [c15]Alden H. Wright, Greg Cripe:
Bistability of the Needle Function in the Presence of Truncation Selection. GECCO (2) 2004: 330-342 - [c14]Alden H. Wright, Riccardo Poli, Christopher R. Stephens, William B. Langdon, Sandeep Pulavarty:
An Estimation of Distribution Algorithm Based on Maximum Entropy. GECCO (2) 2004: 343-354 - 2003
- [c13]Robert B. Heckendorn, Alden H. Wright:
Efficient Linkage Discovery by Limited Probing. GECCO 2003: 1003-1014 - [c12]Alden H. Wright, Michael D. Vose, Jonathan E. Rowe:
Implicit Parallelism. GECCO 2003: 1505-1517 - 2002
- [j9]Jonathan E. Rowe, Michael D. Vose, Alden H. Wright:
Group Properties of Crossover and Mutation. Evol. Comput. 10(2): 151-184 (2002) - [c11]Alden H. Wright, Jonathan E. Rowe, James R. Neil:
Analysis of the simple genetic algorithm on the single-peak and double-peak landscapes. IEEE Congress on Evolutionary Computation 2002: 214-219 - [c10]Riccardo Poli, Jonathan E. Rowe, Christopher R. Stephens, Alden H. Wright:
Allele Diffusion in Linear Genetic Programming and Variable-Length Genetic Algorithms with Subtree Crossover. EuroGP 2002: 212-227 - [c9]Riccardo Poli, Christopher R. Stephens, Alden H. Wright, Jonathan E. Rowe:
A Schema-Theory-Based Extension of Geiringer's Theorem for Linear GP and Varialbe-length GAs under Homologous Crossover. FOGA 2002: 45-62 - [c8]Alden H. Wright, Jonathan E. Rowe, Christopher R. Stephens, Riccardo Poli:
Bistability in a Gene Pool GA with Mutation. FOGA 2002: 63-80 - [c7]Christopher R. Stephens, Riccardo Poli, Alden H. Wright, Jonathan E. Rowe:
Exact Results From A Coarse Grained Formulation Of The Dynamics Of Variable-length Genetic Algorithms. GECCO 2002: 578-585 - [c6]Alden H. Wright, Jonathan E. Rowe, Riccardo Poli, Christopher R. Stephens:
A Fixed Point Analysis Of A Gene Pool GA With Mutation. GECCO 2002: 642-649 - [c5]Riccardo Poli, Christopher R. Stephens, Alden H. Wright, Jonathan E. Rowe:
On The Search Biases Of Homologuous Crossover In Linear Genetic Programming And Variable-length Genetic Algorithms. GECCO 2002: 868-876 - 2000
- [j8]Alden H. Wright, Richard K. Thompson, Jian Zhang:
The computational complexity of N-K fitness functions. IEEE Trans. Evol. Comput. 4(4): 373-379 (2000) - [c4]Alden H. Wright, Jonathan E. Rowe:
Continuous Dynamical System Models of Steady-State Genetic Algorithms. FOGA 2000: 209-225
1990 – 1999
- 1998
- [j7]Michael D. Vose, Alden H. Wright:
The Simple Genetic Algorithm and the Walsh Transform: Part I, Theory. Evol. Comput. 6(3): 253-273 (1998) - [j6]Michael D. Vose, Alden H. Wright:
The Simple Genetic Algorithm and the Walsh Transform: Part II, The Inverse. Evol. Comput. 6(3): 275-289 (1998) - 1996
- [c3]Alden H. Wright, Garrett Bidwell:
A Search for Counterexamples to Two Conjectures on the Simple Genetic Algorithm. FOGA 1996: 73-84 - 1995
- [j5]Alden H. Wright, Michael D. Vose:
Finiteness of the Fixed Point Set for the Simple Genetic Algorithm. Evol. Comput. 3(3): 299-309 (1995) - 1994
- [j4]Michael D. Vose, Alden H. Wright:
Simple Genetic Algorithms with Linear Fitness. Evol. Comput. 2(4): 347-368 (1994) - [j3]Alden H. Wright:
Approximate String Matching using Within-word Parallelism. Softw. Pract. Exp. 24(4): 337-362 (1994) - [c2]Michael D. Vose, Alden H. Wright:
Stability of Vertex Fixed Points and Applications. FOGA 1994: 103-113 - 1993
- [j2]Yi Jiang, Alden H. Wright:
O(k) parallel algorithm for approximate string matching. Neural Parallel Sci. Comput. 1: 443-452 (1993) - 1990
- [c1]Alden H. Wright:
Genetic Algorithms for Real Parameter Optimization. FOGA 1990: 205-218
1980 – 1989
- 1981
- [j1]Alden H. Wright:
The octahedral algorithm, a new simplicial fixed point algorithm. Math. Program. 21(1): 47-69 (1981)
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-06-04 20:44 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:
