Optimal decomposition of probabilistic networks by simulated annealing
- 1 March 1992
- journal article
- Published by Springer Nature in Statistics and Computing
- Vol. 2 (1), 7-17
- https://doi.org/10.1007/bf01890544
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- A MUNIN NETWORK FOR THE MEDIAN NERVE-A CASE STUDY ON LOOPSApplied Artificial Intelligence, 1989
- Probabilistic Inference and Influence DiagramsOperations Research, 1988
- Generalized Simulated Annealing for Function OptimizationTechnometrics, 1986
- Convergence of an annealing algorithmMathematical Programming, 1986
- Applications of the annealing algorithm to combinatorial problems in statisticsBiometrika, 1985
- Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of ImagesIEEE Transactions on Pattern Analysis and Machine Intelligence, 1984
- Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic HypergraphsSIAM Journal on Computing, 1984
- Optimization by Simulated AnnealingScience, 1983
- Algorithmic Aspects of Vertex Elimination on GraphsSIAM Journal on Computing, 1976
- Triangulated graphs and the elimination processJournal of Mathematical Analysis and Applications, 1970