Gene Expression and Fast Construction of Distributed Evolutionary Representation | Citedby Results | Evolutionary Computation | MIT Press

Skip to Main Content

Skip Nav Destination

Gene Expression and Fast Construction of Distributed Evolutionary Representation

Evolutionary Computation (2001) 9 (1): 43–69.

This article has been cited by the following articles in journals that are participating in Crossref Cited-by Linking.

A Novel Approach to Designing Surrogate-assisted Genetic Algorithms by Combining Efficient Learning of Walsh Coefficients and Dependencies

Arkadiy Dushatskiy
Tanja Alderliesten
Peter A. N. Bosman

ACM Transactions on Evolutionary Learning and Optimization (2021) 1 (2): 1.

Computing the moments of k-bounded pseudo-Boolean functions over Hamming spheres of arbitrary radius in polynomial time

Andrew M. Sutton
L. Darrell Whitley
Adele E. Howe

Theoretical Computer Science (2012) 425: 58.

Almost tight upper bound for finding Fourier coefficients of bounded pseudo-Boolean functions

Sung-Soon Choi
Kyomin Jung
Jeong Han Kim

Journal of Computer and System Sciences (2011) 77 (6): 1039.

Optimal query complexity bounds for finding graphs

Sung-Soon Choi
Jeong Han Kim

Artificial Intelligence (2010) 174 (9-10): 551.

Lower and Upper Bounds for Linkage Discovery

IEEE Transactions on Evolutionary Computation (2009) 13 (2): 201.

Detecting the epistatic structure of generalized embedded landscape

Shude Zhou
Robert B. Heckendorn
Zengqi Sun

Genetic Programming and Evolvable Machines (2008) 9 (2): 125.

Linkage Identification by Fitness Difference Clustering

Miwako Tsuji
Masaharu Munetomo
Kiyoshi Akama

Evolutionary Computation (2006) 14 (4): 383.

Efficient Linkage Discovery by Limited Probing

Robert B. Heckendorn
Alden H. Wright

Evolutionary Computation (2004) 12 (4): 517.

Hyperplane ranking, nonlinearity and the simple genetic algorithm

Darrell Whitley
Robert B Heckendorn
Soraya Stevens

Information Sciences (2003) 156 (3-4): 123.