Automata, Languages and Programming
From MaRDI portal
Publication:5716810
DOI10.1007/11523468zbMath1084.68123OpenAlexW2940595899WikidataQ56656999 ScholiaQ56656999MaRDI QIDQ5716810
Publication date: 10 January 2006
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11523468
Combinatorial optimization (90C27) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items (24)
Does comma selection help to cope with local optima? ⋮ Simulated annealing versus Metropolis for a TSP instance ⋮ A landscape-based analysis of fixed temperature and simulated annealing ⋮ Runtime analysis for self-adaptive mutation rates ⋮ First Steps Towards a Runtime Analysis of Neuroevolution ⋮ Crossover can provably be useful in evolutionary computation ⋮ Analysis of an iterated local search algorithm for vertex cover in sparse random graphs ⋮ Choosing the right algorithm with hints from complexity theory ⋮ Simulated annealing is a polynomial-time approximation scheme for the minimum spanning tree problem ⋮ Runtime analysis for permutation-based evolutionary algorithms ⋮ The use of tail inequalities on the probable computational time of randomized search heuristics ⋮ Hybridizing evolutionary algorithms with variable-depth search to overcome local optima ⋮ Scheduling Massively Parallel Multigrid for Multilevel Monte Carlo Methods ⋮ The \((1+\lambda)\) evolutionary algorithm with self-adjusting mutation rate ⋮ A comparison of simulated annealing with a simple evolutionary algorithm on pseudo-Boolean functions of unitation ⋮ Potential induced random teleportation on finite graphs ⋮ Simulated annealing algorithm for the robust spanning tree problem ⋮ The runtime of the compact genetic algorithm on jump functions ⋮ How to escape local optima in black box optimisation: when non-elitism outperforms elitism ⋮ Optimal static and self-adjusting parameter choices for the \((1+(\lambda ,\lambda ))\) genetic algorithm ⋮ A novel feature-based approach to characterize algorithm performance for the traveling salesperson problem ⋮ Playing mastermind with constant-size memory ⋮ Ant colony optimization and the minimum spanning tree problem ⋮ Runtime analysis of a simple ant colony optimization algorithm
This page was built for publication: Automata, Languages and Programming
