Sciweavers

554 search results - page 32 / 111
» Approximate Probabilistic Model Checking
Sort
View
ACSD
2010
IEEE
219views Hardware» more  ACSD 2010»
13 years 5 months ago
The Model Checking View to Clock Gating and Operand Isolation
Abstract--Clock gating and operand isolation are two techniques to reduce the power consumption in state-of-the-art hardware designs. Both approaches basically follow a two-step pr...
Jens Brandt, Klaus Schneider, Sumit Ahuja, Sandeep...
ACL
2010
13 years 5 months ago
Viterbi Training for PCFGs: Hardness Results and Competitiveness of Uniform Initialization
We consider the search for a maximum likelihood assignment of hidden derivations and grammar weights for a probabilistic context-free grammar, the problem approximately solved by ...
Shay B. Cohen, Noah A. Smith
DFG
2009
Springer
14 years 2 months ago
A Survey on Approximation Algorithms for Scheduling with Machine Unavailability
In this chapter we present recent contributions in the field of sequential job scheduling on network machines which work in parallel; these are subject to temporary unavailability...
Florian Diedrich, Klaus Jansen, Ulrich M. Schwarz,...
IPMU
2010
Springer
13 years 6 months ago
Approximation of Data by Decomposable Belief Models
It is well known that among all probabilistic graphical Markov models the class of decomposable models is the most advantageous in the sense that the respective distributions can b...
Radim Jirousek
ASIACRYPT
1999
Springer
14 years 11 hour ago
Approximation Hardness and Secure Communication in Broadcast Channels
Problems of secure communication and computation have been studied extensively in network models. Goldreich, Goldwasser, and Linial, Franklin and Yung, and Franklin and Wright have...
Yvo Desmedt, Yongge Wang