paper-with-me

홈 › Papers

On Heuristics for Finding Loop Cutsets in Multiply-Connected Belief Networks

2013-03-27 · Jonathan Stillman

We introduce a new heuristic algorithm for the problem of finding minimum size loop cutsets in multiply connected belief networks. We compare this algorithm to that proposed in [Suemmondt and Cooper, 1988]. We provide lower bounds on the performance of these algorithms with respect to one another and with respect to optimal. We demonstrate that no heuristic algorithm for this problem cam be guaranteed to produce loop cutsets within a constant difference from optimal. We discuss experimental results based on randomly generated networks, and discuss future work and open questions.

📄 PDF Abstract BibTeX arXiv:1304.1113

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

Updating Probabilities in Multiply-Connected Belief Networks

2013-03-27 · Jaap Suermondt, Gregory F. Cooper

This paper focuses on probability updates in multiply-connected belief networks. Pearl has designed the method of conditioning, which enables us to apply his algorithm for belief updates in singly-connected networks to m…

QCMC: Quasi-conformal Parameterizations for Multiply-connected domains

2014-03-26 · Kin Tat Ho, Lok Ming Lui

This paper presents a method to compute the {\it quasi-conformal parameterization} (QCMC) for a multiply-connected 2D domain or surface. QCMC computes a quasi-conformal map from a multiply-connected domain $S$ onto a pun…

Propagation Stability Concepts for Network Synchronization Processes

2022-10-09 · Sandip Roy, Subir Sarker, Mengran Xue

A notion of disturbance propagation stability is defined for dynamical network processes, in terms of decrescence of an input-output energy metric along cutsets away from the disturbance source. A characterization of the…

Unity

An Empirical Analysis of Likelihood-Weighting Simulation on a Large, Multiply-Connected Belief Network

2013-03-27 · Michael Shwe, Gregory F. Cooper

We analyzed the convergence properties of likelihood- weighting algorithms on a two-level, multiply connected, belief-network representation of the QMR knowledge base of internal medicine. Specifically, on two difficult …

Diagnostic

Topology-Preserving Scalar Field Optimization for Boundary-Conforming Spiral Toolpaths on Multiply Connected Freeform Surfaces

2025-12-27 · Shen Changqing, Xu Bingzhou, Qi Bosong, Zhang Xiaojian 외 arxiv

Multiply connected freeform surface features are widely encountered in industrial components, where toolpath generation often suffers from discontinuities, sharp turns, non-uniform scallop heights, and incomplete boundar…