Sciweavers

1095 search results - page 62 / 219
» Preprocessing of Intractable Problems
Sort
View
ASAP
2000
IEEE
142views Hardware» more  ASAP 2000»
14 years 2 months ago
Contention-Conscious Transaction Ordering in Embedded Multiprocessors
This paper explores the problem of efficiently ordering interprocessor communication operations in statically-scheduled multiprocessors for iterative dataflow graphs. In most digi...
Mukul Khandelia, Shuvra S. Bhattacharyya
DAC
1994
ACM
14 years 1 months ago
New Techniques for Efficient Verification with Implicitly Conjoined BDDs
-- In previous work, Hu and Dill identified a common cause of BDD-size blowup in high-level design verification and proposed the method of implicitly conjoined invariants to addres...
Alan J. Hu, Gary York, David L. Dill
AIPS
2008
14 years 13 days ago
Exact Dynamic Programming for Decentralized POMDPs with Lossless Policy Compression
High dimensionality of belief space in DEC-POMDPs is one of the major causes that makes the optimal joint policy computation intractable. The belief state for a given agent is a p...
Abdeslam Boularias, Brahim Chaib-draa
WSC
2008
14 years 13 days ago
Selecting the best linear simulation metamodel
We consider the output of a simulation model of a system about which little is initially known. This output is often dependent on a large number of factors. It is helpful, in exam...
Russell Cheng
ICMLA
2008
13 years 11 months ago
A Bayesian Approach to Switching Linear Gaussian State-Space Models for Unsupervised Time-Series Segmentation
Time-series segmentation in the fully unsupervised scenario in which the number of segment-types is a priori unknown is a fundamental problem in many applications. We propose a Ba...
Silvia Chiappa