On the public citation graph
Optimal decomposition of probabilistic networks by simulated annealing
0 signed · 102 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/978-3-642-95549-5_16openalex-snapshot
MUNIN — On the Case for Probabilities in Medical Expert Systems — a Practical Exercise
inferredcites →https://doi.org/10.1007/bf01582166openalex-snapshot
Convergence of an annealing algorithm
inferredcites →https://doi.org/10.1016/0022-247x(70)90282-9openalex-snapshot
Triangulated graphs and the elimination process
inferredcites →https://doi.org/10.1016/b978-0-444-70058-2.50009-7openalex-snapshot
Probabilistic Reasoning in Predictive Expert Systems
inferredcites →https://doi.org/10.1016/b978-1-4832-3187-7.50018-0openalex-snapshot
A GRAPH-THEORETIC STUDY OF THE NUMERICAL SOLUTION OF SPARSE POSITIVE DEFINITE SYSTEMS OF LINEAR EQUATIONS
inferredcites →https://doi.org/10.1080/00401706.1986.10488128openalex-snapshot
Generalized Simulated Annealing for Function Optimization
inferredcites →https://doi.org/10.1080/08839518908949933openalex-snapshot
A MUNIN NETWORK FOR THE MEDIAN NERVE-A CASE STUDY ON LOOPS
inferredcites →https://doi.org/10.1093/biomet/72.1.191openalex-snapshot
Applications of the Annealing Algorithm to Combinatorial Problems in Statistics
inferredcites →https://doi.org/10.1093/imammb/3.3.167openalex-snapshot
Optimal Computation of Probability Functions for Pedigree Analysis
inferredcites →https://doi.org/10.1109/tpami.1984.4767596openalex-snapshot
Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images
inferredcites →https://doi.org/10.1109/tsmc.1987.4309045openalex-snapshot
Uncertainty in Artificial Intelligence
inferredcites →https://doi.org/10.1111/j.2517-6161.1988.tb01721.xopenalex-snapshot
Local Computations with Probabilities on Graphical Structures and Their Application to Expert Systems
inferredcites →https://doi.org/10.1126/science.220.4598.671openalex-snapshot
Optimization by Simulated Annealing
inferredcites →https://doi.org/10.1137/0205021openalex-snapshot
Algorithmic Aspects of Vertex Elimination on Graphs
inferredcites →https://doi.org/10.1137/0213035openalex-snapshot
Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
inferredcites →https://doi.org/10.1287/opre.36.4.589openalex-snapshot
Probabilistic Inference and Influence Diagrams
inferredcites →https://doi.org/10.48550/arxiv.1304.1111openalex-snapshot
Optimal Decomposition of Belief Networks
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/0471667196.ess1100openalex-snapshot
Moral Graph, Triangulation of
inferred← citeshttps://doi.org/10.1002/0471667196.ess1100.pub2openalex-snapshot
Moral Graph, Triangulation of
inferred← citeshttps://doi.org/10.1002/1098-111x(200011)15:11<1027::aid-int4>3.0.co;2-#openalex-snapshot
Penniless propagation in join trees
inferred← citeshttps://doi.org/10.1002/9781118445112.stat02260openalex-snapshot
Moral Graph, Triangulation of
inferred← citeshttps://doi.org/10.1002/int.10079openalex-snapshot
Triangulation of Bayesian networks by retriangulation
inferred← citeshttps://doi.org/10.1002/j.2333-8504.2009.tb02160.xopenalex-snapshot
EFFICIENT FULL INFORMATION MAXIMUM LIKELIHOOD ESTIMATION FOR MULTIDIMENSIONAL IRT MODELS
inferred← citeshttps://doi.org/10.1002/j.2333-8504.2010.tb02231.xopenalex-snapshot
MEASURING MULTIDIMENSIONAL LATENT GROWTH
inferred← citeshttps://doi.org/10.1007/11518655_5openalex-snapshot
Penniless Propagation with Mixtures of Truncated Exponentials
inferred← citeshttps://doi.org/10.1007/11875604_16openalex-snapshot
Triangulation of Bayesian Networks Using an Adaptive Genetic Algorithm
inferred← citeshttps://doi.org/10.1007/3-540-45471-3_39openalex-snapshot
Tree Decompositions with Small Cost
inferred← citeshttps://doi.org/10.1007/978-3-319-10557-4_36openalex-snapshot
Probabilistic Inference in the Physical Simulation of Interdependent Critical Infrastructure Systems
inferred← citeshttps://doi.org/10.1007/978-3-319-59776-8_30openalex-snapshot
htd – A Free, Open-Source Framework for (Customized) Tree Decompositions and Beyond
inferred← citeshttps://doi.org/10.1007/978-3-319-62428-0_30openalex-snapshot
Metaheuristic Hybridized Applied to Solve the Capacity Vehicle Routing Problem
inferred← citeshttps://doi.org/10.1007/978-3-540-39879-0_4openalex-snapshot
Hierarchical Junction Trees: Conditional Independence Preservation and Forecasting in Dynamic Bayesian Networks with Heterogeneous Evolution
inferred← citeshttps://doi.org/10.1007/978-3-540-68996-6_6openalex-snapshot
A Review on Distinct Methods and Approaches to Perform Triangulation for Bayesian Networks
inferred← citeshttps://doi.org/10.1007/978-3-540-70807-0_9openalex-snapshot
An Iterative Heuristic Algorithm for Tree Decomposition
inferred← citeshttps://doi.org/10.1007/978-3-540-71615-0_12openalex-snapshot
Generation of Tree Decompositions by Iterated Local Search
inferred← citeshttps://doi.org/10.1007/978-3-642-12139-5_9openalex-snapshot
Ant Colony Optimization for Tree Decompositions
inferred← citeshttps://doi.org/10.1007/978-3-642-18381-2_37openalex-snapshot
A Local Search Algorithm for Branchwidth
inferred← citeshttps://doi.org/10.1007/978-3-662-43505-2_64openalex-snapshot
Metaheuristic Algorithms and Tree Decomposition
inferred← citeshttps://doi.org/10.1007/978-94-017-1737-3_9openalex-snapshot
Algorithms for Imprecise Probabilities
inferred← citeshttps://doi.org/10.1007/bf00146954openalex-snapshot
A note on the four-colourability of pedigrees and its consequences for probability calculations
inferred← citeshttps://doi.org/10.1007/bf00162500openalex-snapshot
Heuristic algorithms for finding inexpensive elimination schemes
inferred← citeshttps://doi.org/10.1007/bf01889682openalex-snapshot
A segmented algorithm for simulated annealing
inferred← citeshttps://doi.org/10.1007/s10559-007-0080-4openalex-snapshot
Tree decomposition and discrete optimization problems: A survey
inferred← citeshttps://doi.org/10.1007/s42081-018-0007-5openalex-snapshot
Multiplicity adjustment for temporal and spatial scan statistics using Markov property
inferred← citeshttps://doi.org/10.1016/0004-3702(95)00118-2openalex-snapshot
Local conditioning in Bayesian networks
inferred← citeshttps://doi.org/10.1016/0167-9473(93)e0055-9openalex-snapshot
On the effective implementation of the iterative proportional fitting procedure
inferred← citeshttps://doi.org/10.1016/0167-9473(93)e0056-aopenalex-snapshot
The EM algorithm for graphical association models with missing data
inferred← citeshttps://doi.org/10.1016/0169-2070(94)02003-8openalex-snapshot
dHugin: a computational system for dynamic time-sliced Bayesian networks
inferred← citeshttps://doi.org/10.1016/0888-613x(94)90031-0openalex-snapshot
An algorithm directly finding the K most probable configurations in Bayesian networks
inferred← citeshttps://doi.org/10.1016/b978-1-4832-8287-9.50021-9openalex-snapshot
A computational scheme for reasoning in dynamic probabilistic networks
inferred← citeshttps://doi.org/10.1016/j.artint.2006.09.003openalex-snapshot
Controlled generation of hard and easy Bayesian networks: Impact on maximal clique size in tree clustering
inferred← citeshttps://doi.org/10.1016/j.artint.2018.11.007openalex-snapshot
Learning tractable Bayesian networks in the space of elimination orders
inferred← citeshttps://doi.org/10.1016/j.dam.2004.01.008openalex-snapshot
Tree decompositions with small cost
inferred← citeshttps://doi.org/10.1016/j.ic.2009.03.008openalex-snapshot
Treewidth computations I. Upper bounds
inferred← citeshttps://doi.org/10.1016/j.ijar.2004.04.001openalex-snapshot
Anytime anyspace probabilistic inference
inferred← citeshttps://doi.org/10.1016/j.ijar.2006.06.007openalex-snapshot
Approximate probability propagation with mixtures of truncated exponentials
inferred← citeshttps://doi.org/10.1016/j.ijar.2008.09.002openalex-snapshot
Triangulation of Bayesian networks with recursive estimation of distribution algorithms
inferred← citeshttps://doi.org/10.1016/j.ijar.2017.10.024openalex-snapshot
Tractability of most probable explanations in multidimensional Bayesian network classifiers
inferred← citeshttps://doi.org/10.1016/j.ins.2012.12.051openalex-snapshot
A review on evolutionary algorithms in Bayesian network learning and inference tasks
inferred← citeshttps://doi.org/10.1016/j.patcog.2019.02.025openalex-snapshot
Tractable learning of Bayesian networks from partially observed data
inferred← citeshttps://doi.org/10.1016/s0167-8655(01)00123-4openalex-snapshot
Searching for the best elimination sequence in Bayesian networks by using ant colony optimization
inferred← citeshttps://doi.org/10.1016/s0167-9473(01)00013-5openalex-snapshot
An implementation of the iterative proportional fitting procedure by propagation trees
inferred← citeshttps://doi.org/10.1016/s0167-9473(99)00110-3openalex-snapshot
Importance sampling in Bayesian networks using probability trees
inferred← citeshttps://doi.org/10.1016/s0888-613x(01)00043-3openalex-snapshot
Partial abductive inference in Bayesian belief networks by simulated annealing
inferred← citeshttps://doi.org/10.1017/s0269888910000251openalex-snapshot
Learning Bayesian networks: approaches and issues
inferred← citeshttps://doi.org/10.1023/a:1018553211613openalex-snapshot
Decomposing Bayesian networks: triangulation of the moral graph with genetic algorithms
inferred← citeshttps://doi.org/10.1023/b:stco.0000035300.39728.03openalex-snapshot
Node deletion sequences in influence diagrams using genetic algorithms
inferred← citeshttps://doi.org/10.1088/2632-072x/ab9d2fopenalex-snapshot
Tree decompositions of real-world networks from simulated annealing
inferred← citeshttps://doi.org/10.1093/comjnl/bxm037openalex-snapshot
Combinatorial Optimization on Graphs of Bounded Treewidth
inferred← citeshttps://doi.org/10.1108/978-1-64113-563-420251008openalex-snapshot
The use of Graphs in Latent Variable Modeling
inferred← citeshttps://doi.org/10.1109/21.364839openalex-snapshot
A framework for ordering composite beliefs in belief networks
inferred← citeshttps://doi.org/10.1109/3477.979956openalex-snapshot
Maximal prime subgraph decomposition of Bayesian networks
inferred← citeshttps://doi.org/10.1109/iadcc.2014.6779417openalex-snapshot
Ordering strategies for removing redundant fill edges
inferred← citeshttps://doi.org/10.1109/iceee.2010.5608653openalex-snapshot
An adaptive multi-heuristic ant colony system for finding optimal elimination orderings in Bayesian networks
inferred← citeshttps://doi.org/10.1109/vetecs.2006.1682971openalex-snapshot
Comparison of probabilistic models used for diagnosis in cellular networks
inferred← citeshttps://doi.org/10.1155/2016/7357123openalex-snapshot
Multiphase Simulated Annealing Based on Boltzmann and Bose-Einstein Distribution Applied to Protein Folding Problem
inferred← citeshttps://doi.org/10.1198/jcgs.2010.09044openalex-snapshot
An Improved Iterative Proportional Scaling Procedure for Gaussian Graphical Models
inferred← citeshttps://doi.org/10.1214/ss/1081443232openalex-snapshot
Graphical Models for Genetic Analyses
inferred← citeshttps://doi.org/10.1214/ss/1177010888openalex-snapshot
Bayesian Analysis in Expert Systems
inferred← citeshttps://doi.org/10.1287/educ.1053.0017openalex-snapshot
Branch and Tree Decomposition Techniques for Discrete Optimization
inferred← citeshttps://doi.org/10.1287/mnsc.47.9.1235.9779openalex-snapshot
Representing and Solving Decision Problems with Limited Information
inferred← citeshttps://doi.org/10.1504/ejie.2007.014690openalex-snapshot
Genetic algorithms for generalised hypertree decompositions
inferred← citeshttps://doi.org/10.15622/sp.26.16openalex-snapshot
Approaches for algebraic Bayesian networks primary structure cyclicity elimination
inferred← citeshttps://doi.org/10.1609/aaai.v25i1.7828openalex-snapshot
Pushing the Power of Stochastic Greedy Ordering Schemes for Inference in Graphical Models
inferred← citeshttps://doi.org/10.1609/aaai.v25i1.8021openalex-snapshot
Stopping Rules for Randomized Greedy Triangulation Schemes
inferred← citeshttps://doi.org/10.1613/jair.5312openalex-snapshot
Improving the Efficiency of Dynamic Programming on Tree Decompositions via Machine Learning
inferred← citeshttps://doi.org/10.20868/upm.thesis.16609openalex-snapshot
Regularized model learning in EDAs for continuous and multi-objective optimization
inferred← citeshttps://doi.org/10.20868/upm.thesis.56439openalex-snapshot
Learning Tractable Bayesian Networks
inferred← citeshttps://doi.org/10.21474/ijar01/1627openalex-snapshot
A REVIEW OF OPTIMIZATION TECHNIQUES IN ARTIFICIAL NETWORKS.
inferred← citeshttps://doi.org/10.26021/1918openalex-snapshot
Bayesian Student Modelling and Decision-Theoretic Selection of Tutorial Actions in Intelligent Tutoring Systems
inferred← citeshttps://doi.org/10.30973/progmat/2014.6.2/5openalex-snapshot
Resolviendo el problema de ruteo de vehículos de capacidad con demandas estocásticas aplicando el algoritmo de recocido simulado
inferred← citeshttps://doi.org/10.4018/978-1-4666-9779-9.ch018openalex-snapshot
Hybrid Multi-Annealing Simulated Annealing Applied to Vehicle Routing Problem
inferred← citeshttps://doi.org/10.4018/978-1-5225-2990-3.ch022openalex-snapshot
Solving Vehicle Routing Problem With Multi-Phases Simulated Annealing Algorithm
inferred← citeshttps://doi.org/10.48550/arxiv.1212.2448openalex-snapshot
On Triangulating Dynamic Graphical Models
inferred← citeshttps://doi.org/10.48550/arxiv.1301.3881openalex-snapshot
Evaluating Influence Diagrams using LIMIDs
inferred← citeshttps://doi.org/10.5402/2012/178658openalex-snapshot
Simulated Annealing with Previous Solutions Applied to DNA Sequence Alignment
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.