1095 search results - page 62 / 219 » Preprocessing of Intractable Problems |
ASAP
2000
IEEE
15 years 2 months ago
2000
IEEE
This paper explores the problem of efficiently ordering interprocessor communication operations in statically-scheduled multiprocessors for iterative dataflow graphs. In most digi...
DAC
1994
ACM
15 years 1 months ago
1994
ACM
-- 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...
AIPS
2008
15 years 5 days ago
2008
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...
WSC
2008
15 years 5 days ago
2008
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...
115
click to vote
ICMLA
2008
14 years 11 months ago
2008
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...