Sciweavers

440 search results - page 34 / 88
» Local Search Heuristics for the Multidimensional Assignment ...
Sort
View
GECCO
2004
Springer
134views Optimization» more  GECCO 2004»
14 years 1 months ago
Central Point Crossover for Neuro-genetic Hybrids
In this paper, we consider each neural network as a point in a multi-dimensional problem space and suggest a crossover that locates the central point of a number of neural networks...
Soonchul Jung, Byung Ro Moon
BIBE
2005
IEEE
126views Bioinformatics» more  BIBE 2005»
14 years 1 months ago
Highly Scalable and Accurate Seeds for Subsequence Alignment
We propose a method for finding seeds for the local alignment of two nucleotide sequences. Our method uses randomized algorithms to find approximate seeds. We present a dynamic ...
Abhijit Pol, Tamer Kahveci
GECCO
2005
Springer
109views Optimization» more  GECCO 2005»
14 years 1 months ago
A hybrid evolutionary algorithm for the p-median problem
A hybrid evolutionary algorithm (EA) for the p-median problem consist of two stages, each of which is a steady-state hybrid EA. These EAs encode selections of medians as subsets o...
István Borgulya
SAC
2009
ACM
14 years 2 months ago
Heuristic approach for automated shelf space allocation
Shelf space allocation is the problem of efficiently arranging retail products on shelves in order to maximise profit, improve stock control, improve customer satisfaction, etc. ...
Dario Landa Silva, Fathima Marikar, Khoi Le
HEURISTICS
2006
120views more  HEURISTICS 2006»
13 years 7 months ago
A study of ACO capabilities for solving the maximum clique problem
This paper investigates the capabilities of the Ant Colony Optimization (ACO) meta-heuristic for solving the maximum clique problem, the goal of which is to find a largest set of ...
Christine Solnon, Serge Fenet