Sciweavers

373 search results - page 4 / 75
» An ACO Algorithm for the Most Probable Explanation Problem
Sort
View
GECCO
2008
Springer
129views Optimization» more  GECCO 2008»
13 years 8 months ago
Searching for liveness property violations in concurrent systems with ACO
Liveness properties in concurrent systems are, informally, those properties that stipulate that something good eventually happens during execution. In order to prove that a given ...
Enrique Alba, J. Francisco Chicano
CIE
2007
Springer
13 years 8 months ago
Finding Most Likely Solutions
Abstract. As one simple type of statistical inference problems we consider Most Likely Solution problem, a task of finding a most likely solution (MLS in short) for a given proble...
Osamu Watanabe, Mikael Onsjö
COR
2008
122views more  COR 2008»
13 years 7 months ago
First steps to the runtime complexity analysis of ant colony optimization
: The paper presents results on the runtime complexity of two ant colony optimization (ACO) algorithms: Ant System, the oldest ACO variant, and GBAS, the first ACO variant for whic...
Walter J. Gutjahr
UAI
1996
13 years 8 months ago
Bucket elimination: A unifying framework for probabilistic inference
Probabilistic inference algorithms for belief updating, nding the most probable explanation, the maximum a posteriori hypothesis, and the maximum expected utility are reformulated...
Rina Dechter
GECCO
2009
Springer
139views Optimization» more  GECCO 2009»
13 years 11 months ago
Meta-heuristics for reconstructing cross cut shredded text documents
In this work, we present two new approaches based on variable neighborhood search (VNS) and ant colony optimization (ACO) for the reconstruction of cross cut shredded text documen...
Matthias Prandtstetter, Günther R. Raidl