Theoretical analysis of local search strategies to optimize network communication subject to preserving the total number of links

DOI10.1108/17563780910959893zbMATH Open1175.90210OpenAlexW1984555915MaRDI QIDQ3639488FDOQ3639488

Authors: 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

Recommendations

• Networks
• Search and congestion in complex networks
• Local routing algorithm optimization and design of scale-free networks
• Optimization in designing complex communication networks
• Optimized Design of Dynamic Networks with Heuristic Algorithms

zbMATH Keywords

optimizationcommunication

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Search theory (90B40)

Cites Work

• Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images
• A Noncooperative Model of Network Formation
• Multi-Terminal Network Flows
• A study of drift analysis for estimating computation time of evolutionary algorithms
• Hitting-time and occupation-time bounds implied by drift analysis with applications
• On a network creation game
• Optimum Communication Spanning Trees
• Near-optimal network design with selfish agents
• On the Irreducibility of a Markov Chain Defined on a Space of Genotype Configurations by a Sampling Scheme
• The evolution of group-level pathogenic traits
• On Generating Random Network Structures: Trees
• Some results about the Markov chains associated to GPs and general EAs

Cited In (25)

• 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
• Optimal mutation rates for the \((1+\lambda)\) EA on OneMax through asymptotically tight drift analysis
• Optimal parameter choices via precise black-box analysis
• The interplay of population size and mutation probability in the \((1+\lambda )\) EA on OneMax
• Runtime analysis for self-adaptive mutation rates
• Improved runtime results for simple randomised search heuristics on linear functions with a uniform constraint
• Static and self-adjusting mutation strengths for multi-valued decision variables
• Concentration of first hitting times under additive drift
• Robustness of populations in stochastic environments
• Linear multi-objective drift analysis
• (1+1) genetic programming with functionally complete instruction sets can evolve Boolean conjunctions and disjunctions with arbitrarily small error
• Fixed-target runtime analysis
• Multiplicative up-drift
• First-hitting times under drift
• Lower bounds from fitness levels made easy
• Tail bounds on hitting times of randomized search heuristics using variable drift analysis
• Optimizing linear functions with the \((1 + \lambda)\) evolutionary algorithm -- different asymptotic runtimes for different instances
• Concentrated hitting times of randomized search heuristics with variable drift
• The choice of the offspring population size in the \((1,\lambda)\) evolutionary algorithm
• How majority-vote crossover and estimation-of-distribution algorithms cope with fitness valleys
• Drift analysis and evolutionary algorithms revisited
• Computational Science - ICCS 2004
• Global Linear Convergence of Evolution Strategies on More than Smooth Strongly Convex Functions

This page was built for publication: Theoretical analysis of local search strategies to optimize network communication subject to preserving the total number of links

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3639488)