Sciweavers

373 search results - page 1 / 75
» An ACO Algorithm for the Most Probable Explanation Problem
Sort
View
AUSAI
2004
Springer
13 years 9 months ago
An ACO Algorithm for the Most Probable Explanation Problem
We describe an Ant Colony Optimization (ACO) algorithm, ANT-MPE, for the most probable explanation problem in Bayesian network inference. After tuning its parameters settings, we c...
Haipeng Guo, Prashanth R. Boddhireddy, William H. ...
PREMI
2007
Springer
13 years 10 months ago
Cunning Ant System for Quadratic Assignment Problem with Local Search and Parallelization
Abstract. The previously proposed cunning ant system (cAS), a variant of the ACO algorithm, worked well on the TSP and the results showed that the cAS could be one of the most prom...
Shigeyoshi Tsutsui
JCSS
2007
116views more  JCSS 2007»
13 years 4 months ago
The most probable annotation problem in HMMs and its application to bioinformatics
Hidden Markov models (HMMs) are often used for biological sequence annotation. Each sequence feature is represented by a collection of states with the same label. In annotating a ...
Brona Brejová, Daniel G. Brown 0001, Tom&aa...
SLS
2009
Springer
250views Algorithms» more  SLS 2009»
13 years 11 months ago
Running Time Analysis of ACO Systems for Shortest Path Problems
Ant Colony Optimization (ACO) is inspired by the ability of ant colonies to find shortest paths between their nest and a food source. We analyze the running time of different ACO...
Christian Horoba, Dirk Sudholt
AI
2003
Springer
13 years 9 months ago
An Improved Ant Colony Optimisation Algorithm for the 2D HP Protein Folding Problem
The prediction of a protein’s structure from its amino-acid sequence is one of the most important problems in computational biology. In the current focus on a widely studied abst...
Alena Shmygelska, Holger H. Hoos