693 search results - page 27 / 139 » Complexity Analysis of Heuristic CSP Search Algorithms |
159
click to vote
FOGA
2011
14 years 5 months ago
2011
Analyzing the computational complexity of evolutionary algorithms (EAs) for binary search spaces has significantly informed our understanding of EAs in general. With this paper, ...
131
click to vote
GECCO
2006
Springer
15 years 5 months ago
2006
Springer
In recent decades, many meta-heuristics, including genetic algorithm (GA), ant colony optimization (ACO) and various local search (LS) procedures have been developed for solving a...
109
Voted
ISCAPDCS
2007
15 years 3 months ago
2007
We address distributed real-time applications represented by systems of non-preemptive dependent periodic tasks. This system is described by an acyclic directed graph. Because the...
102
Voted
IDA
2008
Springer
15 years 1 months ago
2008
Springer
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...
ESA
2008
Springer
15 years 3 months ago
2008
Springer
The focus is on black-box optimization of a function f : RN R given as a black box, i. e. an oracle for f-evaluations. This is commonly called direct search, and in fact, most meth...