Robert B. Heckendorn, Alden H. Wright  Home/Search
Context Related
| umt.edu/u/wright/p...ight_probing.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: umt.edu/u/wright/papers/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: This paper addresses the problem of discovering the structure of a fitness function from binary strings to the reals under the assumption of bounded epistasis. Two loci (string positions) are epistatically linked if the effect of changing the allele (value) at one locus depends on the allele at the other locus. Similarly, a group of loci are epistatically linked if the effect of changing the allele at one locus depends on the alleles at all other loci of the group. Under the assumption... (Update)
Cited by: More
On the Convergence of an Estimation of Distribution.. - Wright, Pulavarty (2005) (Correct)
Genetic Algorithms - Sastry, Goldberg, Kendall (2005) (Correct)
Upper Bounds on the Time and Space Complexity of Optimizing.. - Streeter (2004) (Correct)
Active bibliography (related documents): More All
1.2: Efficient Linkage Discovery by Limited Probing - Heckendorn, Wright (2003) (Correct)
0.5: A Walsh Analysis of NK-Landscapes - Heckendorn, Whitley (1997) (Correct)
0.3: Probabilistic Methods in Landscape Analysis: Phase.. - Gao, Culberson (Correct)
Similar documents based on text:
0.0: Unknown - (Correct)
Related documents from co-citation: More All
4: and Bayesian networks (context) - Pelikan, Goldberg et al.
4: The design of innovation: Lessons from and for competent genetic algorithms (context) - Goldberg - 2002
4: Linkage identification by non-monotonicity detection for overlapping functions - Munetomo, Goldberg - 1999
BibTeX entry: (Update)
R. B. Heckendorn and A. H. Wright, "Efficient linkage discovery by limited probing," Proceedings of the Genetic and Evolutionary Computation Conference, pp. 1003--1014, 2003. http://citeseer.ist.psu.edu/article/heckendorn03efficient.html More
@misc{ heckendorn03efficient,
author = "R. Heckendorn and A. Wright",
title = "Efficient linkage discovery by limited probing",
text = "R. B. Heckendorn and A. H. Wright, Efficient linkage discovery by limited
probing, Proceedings of the Genetic and Evolutionary Computation Conference,
pp. 1003--1014, 2003.",
year = "2003",
url = "citeseer.ist.psu.edu/article/heckendorn03efficient.html" }
Citations (may not include all citations):2138 Genetic Algorithms in Search (context) - Goldberg - 1989
951 Computational Complexity (context) - Papadimitriou - 1994
63 The gambler's ruin problem (context) - Harik, Cant et al. - 1999
51 BOA: The Bayesian optimization algorithm - Pelikan, Goldberg et al. - 1999
51 Linkage learning via probabilistic modeling in the ECGA - Harik - 1999
48 The gene expression messy genetic algorithm - Kargupta - 1996
46 Analyzing deception in trap functions (context) - Deb, Goldberg - 1992
44 MIMIC: Finding optima by estimating probability densities - de Bonet, Isbell et al. - 1997
30 distributions and graphical models in evolutionary optimizat.. (context) - uhlenbein, Mahnig et al. - 1999
18 Convergence theory and application of the factorized distrib.. - uhlenbein, Mahnig - 1999
13 Bayesian optimization algorithm - Pelikan, Goldberg et al. - 2000
10 A tractable Walsh analysis of SAT and its implications for g.. - Rana, Heckendorn et al. - 1998
7 Linkage identification by nonmonotonicity detection for over.. - Munetomo, Goldberg - 1999
7 Predicting epistasis from mathematical models (context) - Heckendorn, Whitley - 1999
5 Identifying linkage group by nonlinearitynon monotonicity de.. (context) - Goldberg, groups et al. - 1999
5 Gene expression and fast construction of distributed evoluti.. - Kargupta, Park - 1993
4 Learning linkage through probabilistic expression (context) - Harik, Goldberg - 2000
3 Space complexity of estimation of distribution algorithms (context) - Gao - 2003
2 Mathematics of Choice (context) - Niven - 1965
2 accurate optimization of difficult optimization problems usi.. (context) - Goldberg, Deb et al. - 1993
2 Why Evolutionary Genetics Doesn't Always Add Up (context) - Brodie - 2000
1 Linkage identification with epistasis measures considering m.. (context) - Munetomo - 2002
1 Special issue SAT problems (context) - Hogg, Huberman et al. - 1996
1 Embedded landscapes (context) - Heckendorn - 2002
1 Tightness time for the linkage learning genetic algorithm - Chen, Goldberg - 2003
1 Walsh Analysis (context) - Heckendorn - 1999
1 Constraint satisfaction by survey propagation (context) - Braunstein, Mezard et al. - 2003
1 Linkage identification based on epistasis measures to realiz.. (context) - Munetomo - 2002
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cs.umt.edu/u/wright/papers/): More
Allele Diffusion in Linear Genetic Programming and.. - Poli, Rowe, al. (2001) (Correct)
Analysis of the Simple Genetic Algorithm on the Single-peak.. - Wright, Rowe (Correct)
A Fixed Point Analysis of a Gene Pool GA with Mutation - Alden Wright University (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC