Sciweavers

890 search results - page 59 / 178
» New Approaches to Compare Phylogenetic Search Heuristics
Sort
View
TIME
2002
IEEE
15 years 6 months ago
Applying Local Search to Temporal Reasoning
Local search techniques have attracted considerable interest in the Artificial Intelligence (AI) community since the development of GSAT [9] and the min-conflicts heuristic [5] ...
John Thornton, Matthew Beaumont, Abdul Sattar, Mic...
EVOW
2003
Springer
15 years 7 months ago
Search Space Analysis of the Linear Ordering Problem
Abstract. The Linear Ordering Problem (LOP) is an NP-hard combinatorial optimization problem that arises in a variety of applications and several algorithmic approaches to its solu...
Tommaso Schiavinotto, Thomas Stützle
GECCO
2007
Springer
276views Optimization» more  GECCO 2007»
15 years 8 months ago
Meta-optimizing semantic evolutionary search
I present MOSES (meta-optimizing semantic evolutionary search), a new probabilistic modeling (estimation of distribution) approach to program evolution. Distributions are not esti...
Moshe Looks
CPAIOR
2006
Springer
15 years 5 months ago
AND/OR Branch-and-Bound Search for Pure 0/1 Integer Linear Programming Problems
Abstract. AND/OR search spaces have recently been introduced as a unifying paradigm for advanced algorithmic schemes for graphical models. The main virtue of this representation is...
Radu Marinescu 0002, Rina Dechter
IPPS
2009
IEEE
15 years 8 months ago
Parallel reconstruction of neighbor-joining trees for large multiple sequence alignments using CUDA
Computing large multiple protein sequence alignments using progressive alignment tools such as ClustalW requires several hours on state-of-the-art workstations. ClustalW uses a th...
Yongchao Liu, Bertil Schmidt, Douglas L. Maskell