Sciweavers

1159 search results - page 111 / 232
» Binary Decision Graphs
Sort
View
DATE
2003
IEEE
104views Hardware» more  DATE 2003»
15 years 11 months ago
Symbolic Analysis of Nonlinear Analog Circuits
A new method is presented to model symbolically strongly nonlinear circuits, characterized by Piece-Wise Linear (PWL) functions. The method follows the idea of Bokhoven and Leenae...
Alicia Manthe, Zhao Li, C.-J. Richard Shi, Kartike...
TIME
2007
IEEE
16 years 20 days ago
Temporal Relations of Intervals with a Gap
Forty-four relations are found between an interval and an interval with a gap ( rIIg ), capturing semantics that are distinct from those of the sets of constituting intervals and ...
Max J. Egenhofer
COCOA
2007
Springer
16 years 17 days ago
A New Exact Algorithm for the Two-Sided Crossing Minimization Problem
The Two-Sided Crossing Minimization (TSCM) problem calls for minimizing the number of edge crossings of a bipartite graph where the two sets of vertices are drawn on two parallel l...
Lanbo Zheng, Christoph Buchheim
IJCAI
2007
15 years 7 months ago
State Space Search for Risk-Averse Agents
We investigate search problems under risk in statespace graphs, with the aim of finding optimal paths for risk-averse agents. We consider problems where uncertainty is due to the...
Patrice Perny, Olivier Spanjaard, Louis-Xavier Sto...
IJAR
2010
152views more  IJAR 2010»
15 years 4 months ago
Structural-EM for learning PDG models from incomplete data
Probabilistic Decision Graphs (PDGs) are a class of graphical models that can naturally encode some context specific independencies that cannot always be efficiently captured by...
Jens D. Nielsen, Rafael Rumí, Antonio Salme...