Meta-heuristics such as simulated annealing, genetic algorithms and tabu search have been successfully applied to many difficult optimization problems for which no satisfactory pro...
We present a search space analysis and its application in improving local search algorithms for the graph coloring problem. Using a classical distance measure between colorings, w...
Daniel Cosmin Porumbel, Jin-Kao Hao, Pascale Kuntz
Query substitution is an important problem in information retrieval. Much work focuses on how to find substitutes for any given query. In this paper, we study how to efficiently ...
Grid search and manual search are the most widely used strategies for hyper-parameter optimization. This paper shows empirically and theoretically that randomly chosen trials are ...
Artificial Development Systems have been introduced as a technique aimed at increasing the scalability of evolutionary algorithms. Most commonly the development model is part of ...