Sciweavers

402 search results - page 16 / 81
» Random Search for Hyper-Parameter Optimization
Sort
View
93
Voted
STACS
2005
Springer
15 years 3 months ago
Worst-Case and Average-Case Approximations by Simple Randomized Search Heuristics
Abstract. In recent years, probabilistic analyses of algorithms have received increasing attention. Despite results on the average-case complexity and smoothed complexity of exact ...
Carsten Witt
GECCO
2000
Springer
120views Optimization» more  GECCO 2000»
15 years 1 months ago
An Improved Adaptive Multi-Start Approach to Finding Near-Optimal Solutions to the Euclidean TSP
We present an "adaptive multi-start" genetic algorithm for the Euclidean traveling salesman problem that uses a population of tours locally optimized by the Lin-Kernigha...
Dan Bonachea, Eugene Ingerman, Joshua Levy, Scott ...
TEC
2002
163views more  TEC 2002»
14 years 9 months ago
Ants can solve constraint satisfaction problems
In this paper, we describe a new incomplete approach for solving constraint satisfaction problems (CSPs) based on the ant colony optimization (ACO) metaheuristic. The idea is to us...
Christine Solnon
WEA
2004
Springer
129views Algorithms» more  WEA 2004»
15 years 3 months ago
Experimental Comparison of Greedy Randomized Adaptive Search Procedures for the Maximum Diversity Problem
Abstract. The maximum diversity problem (MDP) consists of identifying optimally diverse subsets of elements from some larger collection. The selection of elements is based on the d...
Geiza C. Silva, Luiz Satoru Ochi, Simone L. Martin...
74
Voted
ICANNGA
2007
Springer
15 years 1 months ago
Particle Swarms for Multimodal Optimization
Abstract. In this paper, five previous Particle Swarm Optimization (PSO) algorithms for multimodal function optimization are reviewed. A new and a successful PSO based algorithm, n...
Ender Özcan, Murat Yilmaz