Theoretical analysis of local search strategies to optimize network communication subject to preserving the total number of links
From MaRDI portal
Publication:3639488
DOI10.1108/17563780910959893zbMath1175.90210OpenAlexW1984555915MaRDI QIDQ3639488
Boris S. Mitavskiy, Chris Cannings, Jonathan E. Rowe
Publication date: 30 October 2009
Published in: International Journal of Intelligent Computing and Cybernetics (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/9ddecba074e00a393d789df4c5661d9052e4ae00
Related Items (24)
The interplay of population size and mutation probability in the \((1+\lambda )\) EA on OneMax ⋮ Tail bounds on hitting times of randomized search heuristics using variable drift analysis ⋮ Robustness of populations in stochastic environments ⋮ Concentration of first hitting times under additive drift ⋮ Drift Analysis and Evolutionary Algorithms Revisited ⋮ Fixed-target runtime analysis ⋮ Linear multi-objective drift analysis ⋮ Global Linear Convergence of Evolution Strategies on More than Smooth Strongly Convex Functions ⋮ Runtime analysis for self-adaptive mutation rates ⋮ Concentrated Hitting Times of Randomized Search Heuristics with Variable Drift ⋮ (1+1) genetic programming with functionally complete instruction sets can evolve Boolean conjunctions and disjunctions with arbitrarily small error ⋮ Lower bounds from fitness levels made easy ⋮ How majority-vote crossover and estimation-of-distribution algorithms cope with fitness valleys ⋮ The \((1+\lambda)\) evolutionary algorithm with self-adjusting mutation rate ⋮ Upper bounds on the running time of the univariate marginal distribution algorithm on OneMax ⋮ Drift analysis of ant colony optimization of stochastic linear pseudo-Boolean functions ⋮ Optimizing linear functions with the \((1 + \lambda)\) evolutionary algorithm -- different asymptotic runtimes for different instances ⋮ Multiplicative up-drift ⋮ Improved runtime results for simple randomised search heuristics on linear functions with a uniform constraint ⋮ Optimal mutation rates for the \((1+\lambda)\) EA on OneMax through asymptotically tight drift analysis ⋮ Static and self-adjusting mutation strengths for multi-valued decision variables ⋮ The choice of the offspring population size in the \((1,\lambda)\) evolutionary algorithm ⋮ Optimal parameter choices via precise black-box analysis ⋮ First-hitting times under drift
Cites Work
- A study of drift analysis for estimating computation time of evolutionary algorithms
- The evolution of group-level pathogenic traits
- Some results about the Markov chains associated to GPs and general EAs
- On a network creation game
- Optimum Communication Spanning Trees
- On Generating Random Network Structures: Trees
- Near-optimal network design with selfish agents
- Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images
- Multi-Terminal Network Flows
- Hitting-time and occupation-time bounds implied by drift analysis with applications
- A Noncooperative Model of Network Formation
- On the Irreducibility of a Markov Chain Defined on a Space of Genotype Configurations by a Sampling Scheme
This page was built for publication: Theoretical analysis of local search strategies to optimize network communication subject to preserving the total number of links
