Sciweavers

715 search results - page 32 / 143
» Neighborhood structures for genetic local search algorithms
Sort
View
CPHYSICS
2006
127views more  CPHYSICS 2006»
14 years 9 months ago
GenAnneal: Genetically modified Simulated Annealing
A modification of the standard Simulated Annealing (SA) algorithm is presented for finding the global minimum of a continuous multidimensional, multimodal function. We report resu...
Ioannis G. Tsoulos, Isaac E. Lagaris
WABI
2004
Springer
116views Bioinformatics» more  WABI 2004»
15 years 3 months ago
Topological Rearrangements and Local Search Method for Tandem Duplication Trees
—The problem of reconstructing the duplication history of a set of tandemly repeated sequences was first introduced by Fitch [4]. Many recent studies deal with this problem, show...
Denis Bertrand, Olivier Gascuel
EOR
2007
90views more  EOR 2007»
14 years 9 months ago
Tabu search and GRASP for the maximum diversity problem
In this paper, we develop new heuristic procedures for the maximum diversity problem (MDP). This NPhard problem has a significant number of practical applications such as environm...
Abraham Duarte, Rafael Martí
ICDE
2012
IEEE
240views Database» more  ICDE 2012»
13 years 4 days ago
Ego-centric Graph Pattern Census
—There is increasing interest in analyzing networks of all types including social, biological, sensor, computer, and transportation networks. Broadly speaking, we may be interest...
Walaa Eldin Moustafa, Amol Deshpande, Lise Getoor
EVOW
2004
Springer
15 years 3 months ago
A Memetic Algorithm for Protein Structure Prediction in a 3D-Lattice HP Model
This paper presents a memetic algorithm with self-adaptive local search, applied to protein structure prediction in an HP, cubiclattice model. Besides describing in detail how the ...
Andrea Bazzoli, Andrea Tettamanzi