Sciweavers

233 search results - page 12 / 47
» On Some Optimization Heuristics for Lesk-Like WSD Algorithms
Sort
View
CAS
2008
68views more  CAS 2008»
13 years 7 months ago
Very Strongly Constrained Problems: an Ant Colony Optimization Approach
: Ant Colony Optimization (ACO) is a class of metaheuristic algorithms sharing the common approach of constructing a solution on the basis of information provided both by a standar...
Vittorio Maniezzo, Matteo Roffilli
IJAIT
2010
167views more  IJAIT 2010»
13 years 6 months ago
Bee Colony Optimization with Local Search for Traveling Salesman Problem
Many real world industrial applications involve finding a Hamiltonian path with minimum cost. Some instances that belong to this category are transportation routing problem, scan c...
Li-Pei Wong, Malcolm Yoke-Hean Low, Chin Soon Chon...
WEA
2004
Springer
129views Algorithms» more  WEA 2004»
14 years 27 days ago
Experimental Comparison of Greedy Randomized Adaptive Search Procedures for the Maximum Diversity Problem
Abstract. The maximum diversity problem (MDP) consists of identifying optimally diverse subsets of elements from some larger collection. The selection of elements is based on the d...
Geiza C. Silva, Luiz Satoru Ochi, Simone L. Martin...
SODA
2004
ACM
124views Algorithms» more  SODA 2004»
13 years 9 months ago
On contract-and-refine transformations between phylogenetic trees
The inference of evolutionary trees using approaches which attempt to solve the maximum parsimony (MP) and maximum likelihood (ML) optimization problems is a standard part of much...
Ganeshkumar Ganapathy, Vijaya Ramachandran, Tandy ...
GECCO
2003
Springer
128views Optimization» more  GECCO 2003»
14 years 23 days ago
Evolving Consensus Sequence for Multiple Sequence Alignment with a Genetic Algorithm
In this paper we present an approach that evolves the consensus sequence [25] for multiple sequence alignment (MSA) with genetic algorithm (GA). We have developed an encoding schem...
Conrad Shyu, James A. Foster