On the public citation graph
Construction of high-order deceptive functions using low-order Walsh coefficients
0 signed · 47 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1016/b978-0-08-050684-5.50017-3openalex-snapshot
Fundamental Principles of Deception in Genetic Search
inferredcites →https://doi.org/10.1080/09528139008953717openalex-snapshot
Representational issues in genetic optimization
inferredcites →https://doi.org/10.5860/choice.27-0936openalex-snapshot
Genetic algorithms in search, optimization, and machine learning
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/0-306-48041-7_15openalex-snapshot
A Genetic Algorithm Heuristic for Finite Horizon Partially Observed Markov Decision Problems
inferred← citeshttps://doi.org/10.1007/11844297_79openalex-snapshot
Some Steps Towards Understanding How Neutrality Affects Evolutionary Search
inferred← citeshttps://doi.org/10.1007/3-540-45110-2_48openalex-snapshot
On the Locality of Representations
inferred← citeshttps://doi.org/10.1007/978-3-540-73482-6_9openalex-snapshot
On the Effects of Bit-Wise Neutrality on Fitness Distance Correlation, Phenotypic Mutation Rates and Problem Hardness
inferred← citeshttps://doi.org/10.1007/978-3-7091-7535-4_43openalex-snapshot
Typology of Boolean Functions Using Walsh Analysis
inferred← citeshttps://doi.org/10.1007/bf00993046openalex-snapshot
What makes a problem hard for a genetic algorithm? Some anomalous results and their explanation
inferred← citeshttps://doi.org/10.1007/bf01530780openalex-snapshot
Deception, dominance and implicit parallelism in genetic search
inferred← citeshttps://doi.org/10.1007/bf01531277openalex-snapshot
Sufficient conditions for deceptive and easy binary functions
inferred← citeshttps://doi.org/10.1007/s10710-011-9136-3openalex-snapshot
Defining locality as a problem difficulty measure in genetic programming
inferred← citeshttps://doi.org/10.1007/s12530-011-9030-5openalex-snapshot
Neutrality in evolutionary algorithms… What do we know?
inferred← citeshttps://doi.org/10.1007/s12555-010-0117-8openalex-snapshot
Fitness landscape for simple genetic algorithms supplied with adequate superior order-1 building blocks
inferred← citeshttps://doi.org/10.1007/s12555-014-0377-9openalex-snapshot
Encoding selection for a class of fitness functions based on locus interdependency
inferred← citeshttps://doi.org/10.1016/b978-0-08-050684-5.50017-3openalex-snapshot
Fundamental Principles of Deception in Genetic Search
inferred← citeshttps://doi.org/10.1016/b978-0-08-094832-4.50011-8openalex-snapshot
Deception Considered Harmful* *With apologies to Edsger Dijkstra (Dijkstra, 1968).
inferred← citeshttps://doi.org/10.1016/b978-0-08-094832-4.50012-xopenalex-snapshot
Analyzing Deception in Trap Functions
inferred← citeshttps://doi.org/10.1016/b978-1-55860-356-1.50016-9openalex-snapshot
Genetic Algorithm Difficulty and the Modality of Fitness Landscapes
inferred← citeshttps://doi.org/10.1016/j.mehy.2009.10.019openalex-snapshot
Optimization aspects of carcinogenesis
inferred← citeshttps://doi.org/10.1016/s0020-0255(96)00048-5openalex-snapshot
On an exact populationary model of genetic algorithms
inferred← citeshttps://doi.org/10.1016/s0304-3975(99)00092-4openalex-snapshot
Fourier Analysis of Genetic Algorithms
inferred← citeshttps://doi.org/10.1023/a:1022626114466openalex-snapshot
What Makes a Problem Hard for a Genetic Algorithm? Some Anomalous Results and Their Explanation
inferred← citeshttps://doi.org/10.1080/18756891.2009.9727643openalex-snapshot
On the Supply of Superior Order-1 Building Blocks for a Class of Periodical Fitness Functions
inferred← citeshttps://doi.org/10.1080/18756891.2014.964007openalex-snapshot
Selection of Encoding Cardinality for a Class of Fitness Functions to Obtain Order-1 Building Blocks
inferred← citeshttps://doi.org/10.1109/4235.728208openalex-snapshot
Holder functions and deception of genetic algorithms
inferred← citeshttps://doi.org/10.1109/4235.873233openalex-snapshot
Markov chain models of parallel genetic algorithms
inferred← citeshttps://doi.org/10.1109/cec.2009.4983121openalex-snapshot
Viral infection + tropism for improving small population performance under noisy environment
inferred← citeshttps://doi.org/10.1109/cec.2010.5586365openalex-snapshot
Proposal of a multi-core processor from the viewpoint of evolutionary computation
inferred← citeshttps://doi.org/10.1109/icec.1994.349990openalex-snapshot
Are deception and complexity conjugate variables in genetic learning?
inferred← citeshttps://doi.org/10.1109/icec.1998.700082openalex-snapshot
Bitwise regularity and GA-hardness
inferred← citeshttps://doi.org/10.1109/tevc.2011.2132726openalex-snapshot
The Effects of Constant and Bit-Wise Neutrality on Problem Hardness, Fitness Distance Correlation and Phenotypic Mutation Rates
inferred← citeshttps://doi.org/10.1145/1389095.1389319openalex-snapshot
Improving small population performance under noise with viral infection + tropism
inferred← citeshttps://doi.org/10.1162/106365602760234081openalex-snapshot
A Species Conserving Genetic Algorithm for Multimodal Function Optimization
inferred← citeshttps://doi.org/10.1162/106365603321829023openalex-snapshot
Erratum: A Species Conserving Genetic Algorithm for Multimodal Function Optimization
inferred← citeshttps://doi.org/10.1162/evco.1993.1.2.101openalex-snapshot
A Sequential Niche Technique for Multimodal Function Optimization
inferred← citeshttps://doi.org/10.1162/evco.1998.6.3.253openalex-snapshot
The Simple Genetic Algorithm and the Walsh Transform: Part I, Theory
inferred← citeshttps://doi.org/10.1162/evco_a_00176openalex-snapshot
Generating, Maintaining, and Exploiting Diversity in a Memetic Algorithm for Protein Structure Prediction
inferred← citeshttps://doi.org/10.1201/9781420050073.ax1openalex-snapshot
An Indexed Bibliography of Genetic Algorithms
inferred← citeshttps://doi.org/10.1214/11-aoas475openalex-snapshot
Modeling item–item similarities for personalized recommendations on Yahoo! front page
inferred← citeshttps://doi.org/10.1214/16-ejs1147openalex-snapshot
Matrix completion via max-norm constrained optimization
inferred← citeshttps://doi.org/10.2991/ijcis.2015.8.1.6openalex-snapshot
Selection of Encoding Cardinality for a Class of Fitness Functions to Obtain Order-1 Building Blocks
inferred← citeshttps://doi.org/10.5220/0005585601330137openalex-snapshot
Supply of Order-1 Building Blocks for Functions Linearly Combined of Sinusoidal Bases with Integral Frequencies
inferred← citeshttps://doi.org/10.5555/1757524.1757533openalex-snapshot
On the effects of bit-wise neutrality on fitness distance correlation, phenotypic mutation rates and problem hardness
inferred← citeshttps://doi.org/10.5815/ijisa.2011.04.02openalex-snapshot
A Growing Evolutionary Algorithm and Its Application for Data Mining
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.