7522 search results - page 11 / 1505 » Spacing memetic algorithms |
EOR
2010
15 years 11 days ago
2010
Given an undirected graph G = (V, E) with a set V of vertices and a set E of edges, the graph coloring problem consists of partitioning all vertices into k independent sets and th...
87
Voted
GECCO
2007
Springer
15 years 6 months ago
2007
Springer
Finding binary sequences with low autocorrelation is a very hard problem with many practical applications. In this paper we analyze several metaheuristic approaches to tackle the ...
105
click to vote
PATAT
1995
Springer
15 years 3 months ago
1995
Springer
The scheduling of exams in institutions of higher education is known to be a highly constrained problem. The advent of modularity in many institutions in the UK has resulted in a s...
118
click to vote
CEC
2007
IEEE
15 years 13 days ago
2007
IEEE
— Memetic algorithms (MAs) combine the global exploration abilities of evolutionary algorithms with a local search to further improve the solutions. While a neighborhood can be e...
AISB
1994
Springer
15 years 4 months ago
1994
Springer
Abstract. A formal, representation-independent form of a memetic algorithm-a genetic algorithm incorporating local search--is introduced. A generalisedform of N-point crossover is ...