On the public citation graph

Estimation-of-Distribution Algorithms for Multi-Valued Decision Variables

https://doi.org/10.2139/ssrn.4673284
0 signed · 51 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/978-1-4615-1539-5openalex-extracted
Estimation of Distribution Algorithms
inferredcites →https://doi.org/10.1007/978-3-030-29414-4_1openalex-extracted
Probabilistic Tools for the Analysis of Randomized Optimization Heuristics
inferredcites →https://doi.org/10.1007/978-3-030-29414-4_9openalex-extracted
Theory of Estimation-of-Distribution Algorithms
inferredcites →https://doi.org/10.1007/978-3-030-43680-3_4openalex-extracted
The Univariate Marginal Distribution Algorithm Copes Well with Deception and Epistasis
inferredcites →https://doi.org/10.1007/978-3-662-12788-9_6openalex-extracted
Concentration
inferredcites →https://doi.org/10.1007/978-3-662-43505-2_45openalex-extracted
Estimation of Distribution Algorithms
inferredcites →https://doi.org/10.1007/s00453-015-9975-zopenalex-extracted
MMAS Versus Population-Based EA on a Family of Dynamic Fitness Functions
inferredcites →https://doi.org/10.1007/s00453-017-0341-1openalex-extracted
Static and Self-Adjusting Mutation Strengths for Multi-valued Decision Variables
inferredcites →https://doi.org/10.1007/s00453-018-0463-0openalex-extracted
Upper Bounds on the Running Time of the Univariate Marginal Distribution Algorithm on OneMax
inferredcites →https://doi.org/10.1007/s00453-018-0480-zopenalex-extracted
On the Choice of the Update Strength in Estimation-of-Distribution Algorithms and Ant Colony Optimization
inferredcites →https://doi.org/10.1007/s00453-020-00778-4openalex-extracted
The Complex Parameter Landscape of the Compact Genetic Algorithm
inferredcites →https://doi.org/10.1007/s00453-020-00780-wopenalex-extracted
The Runtime of the Compact Genetic Algorithm on Jump Functions
inferredcites →https://doi.org/10.1007/s11047-006-9001-0openalex-extracted
A rigorous analysis of the compact genetic algorithm for linear functions
inferredcites →https://doi.org/10.1016/j.tcs.2020.11.028openalex-extracted
A simplified run time analysis of the univariate marginal distribution algorithm on LeadingOnes
inferredcites →https://doi.org/10.1016/j.tcs.2022.08.014openalex-extracted
How majority-vote crossover and estimation-of-distribution algorithms cope with fitness valleys
inferredcites →https://doi.org/10.1016/j.tcs.2023.114074openalex-extracted
Bivariate estimation-of-distribution algorithms can find an exponential number of optima
inferredcites →https://doi.org/10.1016/s0304-3975(01)00182-7openalex-extracted
On the analysis of the (1+1) evolutionary algorithm
inferredcites →https://doi.org/10.1109/4235.797971openalex-extracted
The compact genetic algorithm
inferredcites →https://doi.org/10.1109/cec.2007.4424506openalex-extracted
On the analysis of average time complexity of estimation of distribution algorithms
inferredcites →https://doi.org/10.1109/cec.2009.4983116openalex-extracted
When is an estimation of distribution algorithm better than an evolutionary algorithm?
inferredcites →https://doi.org/10.1109/tevc.2007.906095openalex-extracted
Protein Folding in Simplified Models With Estimation of Distribution Algorithms
inferredcites →https://doi.org/10.1109/tevc.2009.2040019openalex-extracted
Analysis of Computational Time of Simple Estimation of Distribution Algorithms
inferredcites →https://doi.org/10.1109/tevc.2014.2378891openalex-extracted
Switch Analysis for Running Time Analysis of Evolutionary Algorithms
inferredcites →https://doi.org/10.1109/tevc.2016.2613739openalex-extracted
The Compact Genetic Algorithm is Efficient under Extreme Gaussian Noise
inferredcites →https://doi.org/10.1109/tevc.2019.2956633openalex-extracted
Significance-Based Estimation-of-Distribution Algorithms
inferredcites →https://doi.org/10.1109/tevc.2020.2987361openalex-extracted
Sharp Bounds for Genetic Drift in Estimation of Distribution Algorithms
inferredcites →https://doi.org/10.1109/tevc.2022.3229038openalex-extracted
The Competing Genes Evolutionary Algorithm: Avoiding Genetic Drift Through Competition, Local Search, and Majority Voting
inferredcites →https://doi.org/10.1109/wict.2013.7113130openalex-extracted
Model-based template-recombination in Markov network estimation of distribution algorithms for problems with discrete representation
inferredcites →https://doi.org/10.1145/1068009.1068124openalex-extracted
Not all linear functions are equally difficult for the compact genetic algorithm
inferredcites →https://doi.org/10.1145/1967654.1967665openalex-extracted
Runtime analysis of the (1+1) evolutionary algorithm on strings over finite alphabets
inferredcites →https://doi.org/10.1145/2460239.2460245openalex-extracted
When do evolutionary algorithms optimize separable functions in parallel?
inferredcites →https://doi.org/10.1145/2725494.2725502openalex-extracted
(1+1) EA on Generalized Dynamic OneMax
inferredcites →https://doi.org/10.1145/2739480.2754814openalex-extracted
Simplified Runtime Analysis of Estimation of Distribution Algorithms
inferredcites →https://doi.org/10.1145/3040718.3040724openalex-extracted
Lower Bounds on the Run Time of the Univariate Marginal Distribution Algorithm on OneMax
inferredcites →https://doi.org/10.1145/3205455.3205553openalex-extracted
Significance-based estimation-of-distribution algorithms
inferredcites →https://doi.org/10.1145/3205455.3205581openalex-extracted
Domino convergence
inferredcites →https://doi.org/10.1145/3205455.3205608openalex-extracted
On the runtime dynamics of the compact genetic algorithm on jump functions
inferredcites →https://doi.org/10.1145/3299904.3340316openalex-extracted
On the limitations of the univariate marginal distribution algorithm to deception and where bivariate EDAs might help
inferredcites →https://doi.org/10.1145/3321707.3321834openalex-extracted
Runtime analysis of the univariate marginal distribution algorithm under low selective pressure and prior noise
inferredcites →https://doi.org/10.1145/3377930.3390177openalex-extracted
Bivariate estimation-of-distribution algorithms can find an exponential number of optima
inferredcites →https://doi.org/10.1145/3449639.3459350openalex-extracted
A rigorous runtime analysis of the 2-MMAS ib on jump functions
inferredcites →https://doi.org/10.1145/3512290.3528776openalex-extracted
The compact genetic algorithm struggles on Cliff functions
inferredcites →https://doi.org/10.1145/3520304.3534069openalex-extracted
Choosing the right algorithm with hints from complexity theory
inferredcites →https://doi.org/10.1145/3583131.3590523openalex-extracted
Estimation-of-Distribution Algorithms for Multi-Valued Decision Variables
inferredcites →https://doi.org/10.1162/1063656053583414openalex-extracted
Drift and Scaling in Estimation of Distribution Algorithms
inferredcites →https://doi.org/10.1162/evco.1997.5.3.303openalex-extracted
The Equation for Response to Selection and Its Use for Prediction
inferredcites →https://doi.org/10.1162/evco_a_00002openalex-extracted
Learning Factorizations in Estimation of Distribution Algorithms Using Affinity Propagation
inferredcites →https://doi.org/10.21236/ada419567openalex-extracted
The 2003 Genetic and Evolutionary Computation Conference
inferredcites →https://doi.org/10.48550/arxiv.1607.04063openalex-extracted
Update Strength in EDAs and ACO: How to Avoid Genetic Drift
inferredcites →https://doi.org/10.48550/arxiv.2204.04904openalex-extracted
The Compact Genetic Algorithm Struggles on Cliff Functions
inferredcites →https://doi.org/10.48550/arxiv.2206.09090openalex-extracted
From Understanding Genetic Drift to a Smart-Restart Mechanism for Estimation-of-Distribution Algorithms
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.