Searching for the best elimination sequence in Bayesian networks by using ant colony optimization

This publication has 13 references indexed in Scilit:

• Partial abductive inference in Bayesian belief networks using a genetic algorithm
  Pattern Recognition Letters, 1999
• Ant Algorithms for Discrete Optimization
  Artificial Life, 1999
• An efficient algorithm for finding the M most probable configurationsin probabilistic expert systems
  Statistics and Computing, 1998
• Ant colony system: a cooperative learning approach to the traveling salesman problem
  IEEE Transactions on Evolutionary Computation, 1997
• Decomposing Bayesian networks: triangulation of the moral graph with genetic algorithms
  Statistics and Computing, 1997
• Ant system: optimization by a colony of cooperating agents
  IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics), 1996
• Abductive reasoning in Bayesian belief networks using a genetic algorithm
  Pattern Recognition Letters, 1995
• Optimal decomposition of probabilistic networks by simulated annealing
  Statistics and Computing, 1992
• Distributed revision of composite beliefs
  Artificial Intelligence, 1987
• Fusion, propagation, and structuring in belief networks
  Artificial Intelligence, 1986