273 search results - page 7 / 55 » Problem formulation as the reduction of a decision model |
IFM
2009
Springer
14 years 3 months ago
2009
Springer
We present the new technique of dynamic path reduction (DPR), which allows one to prune redundant paths from the state space of a program under verification. DPR is a very general...
ICCAD
2002
IEEE
14 years 5 months ago
2002
IEEE
- This paper addresses the problem of maximizing capacity utilization of the battery power source in a portable electronic system under latency and loss rate constraints. First, a ...
ENTCS
2007
13 years 8 months ago
2007
Symbolic model checking is PSPACE complete. Since QBF is the standard PSPACE complete problem, it is most natural to encode symbolic model checking problems as QBF formulas and th...
CVPR
2009
IEEE
15 years 3 months ago
2009
IEEE
We introduce a new technique that can reduce any
higher-order Markov random field with binary labels into
a first-order one that has the same minima as the original.
Moreover, w...
NIPS
2008
13 years 10 months ago
2008
We use graphical models and structure learning to explore how people learn policies in sequential decision making tasks. Studies of sequential decision-making in humans frequently...