Sciweavers

439 search results - page 6 / 88
» Neighborhood Structures for GPU-Based Local Search Algorithm...
Sort
View
EVOW
2009
Springer
14 years 1 months ago
Finding Balanced Incomplete Block Designs with Metaheuristics
This paper deals with the generation of balanced incomplete block designs (BIBD), a hard constrained combinatorial problem with multiple applications. This problem is here formulat...
David Rodríguez Rueda, Carlos Cotta, Antoni...
EVOW
2008
Springer
13 years 10 months ago
Efficient Local Search Limitation Strategies for Vehicle Routing Problems
In this paper we examine five different strategies for limiting the local search neighborhoods in the context of vehicle routing problems. The vehicle routing problem deals with th...
Yuichi Nagata, Olli Bräysy
GLOBECOM
2010
IEEE
13 years 6 months ago
Layered Tabu Search Algorithm for Large-MIMO Detection and a Lower Bound on ML Performance
In this paper, we are concerned with low-complexity detection in large multiple-input multiple-output (MIMO) systems with tens of transmit/receive antennas. Our new contributions i...
N. Srinidhi, Tanumay Datta, Ananthanarayanan Chock...
FGCS
2007
106views more  FGCS 2007»
13 years 8 months ago
A parallel hybrid genetic algorithm for protein structure prediction on the computational grid
Solving the structure prediction problem for complex proteins is difficult and computationally expensive. In this paper, we propose a bicriterion parallel hybrid genetic algorith...
Alexandru-Adrian Tantar, Nouredine Melab, El-Ghaza...
TCBB
2008
107views more  TCBB 2008»
13 years 8 months ago
Progressive Tree Neighborhood Applied to the Maximum Parsimony Problem
Abstract-- The Maximum Parsimony problem aims at reconstructing a phylogenetic tree from DNA sequences while minimizing the number of genetic transformations. To solve this NP-comp...
Adrien Goëffon, Jean-Michel Richer, Jin-Kao H...