Sciweavers

2089 search results - page 40 / 418
» A New Problem in String Searching
Sort
View
97
Voted
IJHIS
2006
94views more  IJHIS 2006»
14 years 9 months ago
A new fine-grained evolutionary algorithm based on cellular learning automata
In this paper, a new evolutionary computing model, called CLA-EC, is proposed. This model is a combination of a model called cellular learning automata (CLA) and the evolutionary ...
Reza Rastegar, Mohammad Reza Meybodi, Arash Hariri
78
Voted
ICNC
2005
Springer
15 years 3 months ago
Local Search for the Maximum Parsimony Problem
Abstract. Four local search algorithms are investigated for the phylogenetic tree reconstruction problem under the Maximum Parsimony criterion. A new subtree swapping neighborhood ...
Adrien Goëffon, Jean-Michel Richer, Jin-Kao H...
CJ
2008
97views more  CJ 2008»
14 years 9 months ago
Three Kinds of Probabilistic Induction: Universal Distributions and Convergence Theorems
We will describe three kinds of probabilistic induction problems, and give general solutions for each , with associated convergence theorems that show they tend to give good proba...
Ray J. Solomonoff
EVOW
2008
Springer
14 years 11 months ago
Reactive Stochastic Local Search Algorithms for the Genomic Median Problem
Abstract. The genomic median problem is an optimization problem inspired by a biological issue: it aims at finding the chromosome organization of the common ancestor to multiple li...
Renaud Lenne, Christine Solnon, Thomas Stützl...
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í