94 search results - page 13 / 19 » Memetic Algorithms for the MinLA Problem |
EOR
2010
13 years 7 months 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...
EVOW
2009
Springer
14 years 2 months ago
2009
Springer
The Maximum Parsimony problem aims at reconstructing a phylogenetic tree from DNA, RNA or protein sequences while minimizing the number of evolutionary changes. Much work has been ...
PATAT
1995
Springer
13 years 11 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...
GECCO
2004
Springer
14 years 27 days ago
2004
Springer
This paper discusses the implementation of local search in evolutionary multiobjective optimization (EMO) algorithms for the design of a simple but powerful memetic EMO algorithm. ...
EVOW
2007
Springer
14 years 1 months ago
2007
Springer
This paper proposes a neural network based approach for solving the resource discovery problem in Peer to Peer (P2P) networks and an Adaptive Global Local Memetic Algorithm (AGLMA)...