Skip to search formSkip to main contentSkip to account menu

Influence diagram

Known as: Informational arrow, Decision node, Relevance diagrams 
An influence diagram (ID) (also called a relevance diagram, decision diagram or a decision network) is a compact graphical and mathematical… 
Wikipedia (opens in a new tab)

Related topics

Related topics

15 relations
AnalyticaArtificial intelligenceBayesian networkBelief propagation

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2008
2008
Symbolic Heuristic Search Value Iteration for Factored POMDPs
We propose Symbolic heuristic search value iteration (Symbolic HSVI) algorithm, which extends the heuristic search value… 
2007
2007
Probabilistic decision diagrams for exact probabilistic analysis
A decision diagram based framework is proposed for representing the probabilistic behavior of circuits with faulty gates. The… 
2004
2004
Stochastic modeling of a terrorist event via the ASAM system
The ability of terrorist networks to conduct sophisticated and simultaneous attacks - the most recent one on March 11, 2004 in… 
2001
2001
Quantum-Dot Logic Circuits Based on the Shared Binary-Decision Diagram
We propose a method of constructing quantum-dot logic circuits that can be used to develop large digital systems with ultralow… 
1997
1997
Functional decomposition of MVL functions using multi-valued decision diagrams
In this paper, the minimization of incompletely specified multi-valued functions using functional decomposition is discussed… 
1993
1993
Comparing two-level and ordered binary decision diagram representations of logic functions
  • S. Devadas
  • IEEE Trans. Comput. Aided Des. Integr. Circuits…
  • 1993
  • Corpus ID: 1429972
An example is given of a class of functions with 2n+logn inputs that have two-level or sum-of-products representations containing… 
1992
1992
An efficient test generation algorithm based on search state dominance
J. Giraldi and M.L. Bushnell (1990) proposed a new test generation method, called the EST (equivalent state hashing) algorithm… 
1991
1991
An Efficient Method of Computing Generalized Reed-Muller Expansions from Binary Decision Diagram
  • S. Purwar
  • IEEE Trans. Computers
  • 1991
  • Corpus ID: 44607650
An efficient method for the generation of all the 2/sup n/ sets of generalized Reed-Muller (GRM) coefficients for a Boolean… 
1990
1990
Multi-Valued Decision Diagrams
Many problems can he stated naturally using variables that have multiple values (i.e., lake their valuesfrom a discretesci… 
Highly Cited
1988
Highly Cited
1988
A method of delay fault test generation
The authors propose an efficient deterministic method of delay fault test generation. For most common circuits, the proposed… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)