18 search results - page 1 / 4 » Two novel Ant Colony Optimization approaches for Bayesian ne... |
CEC
2010
IEEE
13 years 5 months ago
2010
IEEE
Learning Bayesian networks from data is an N-P hard problem with important practical applications. Several researchers have designed algorithms to overcome the computational comple...
CORR
2004
Springer
13 years 4 months ago
2004
Springer
Social insect societies and more specifically ant colonies, are distributed systems that, in spite of the simplicity of their individuals, present a highly structured social organi...
AIRS
2006
Springer
13 years 8 months ago
2006
Springer
Recently, much research has been proposed using nature inspired algorithms to perform complex machine learning tasks. Ant Colony Optimization (ACO) is one such algorithm based on s...
ICANN
2009
Springer
13 years 9 months ago
2009
Springer
This paper proposes a clustering method SOMAK, which is composed by Self-Organizing Maps (SOM) followed by the Ant K-means (AK) algorithm. The aim of this method is not to find an...
PPSN
2010
Springer
13 years 2 months ago
2010
Springer
Abstract. The rooted delay-constrained minimum spanning tree problem is an NP-hard combinatorial optimization problem arising for example in the design of centralized broadcasting ...