5159 search results - page 715 / 1032 » Structural Testing of Executables |
205
click to vote
ICMLA
2007
15 years 8 months ago
2007
We introduce a polynomial-time algorithm to learn Bayesian networks whose structure is restricted to nodes with in-degree at most k and to edges consistent with the optimal branch...
208
click to vote
NIPS
2007
15 years 8 months ago
2007
Dynamic Bayesian networks are structured representations of stochastic processes. Despite their structure, exact inference in DBNs is generally intractable. One approach to approx...
189
click to vote
IJCAI
2001
15 years 8 months ago
2001
Combinatorial auctions where bidders can bid on bundles of items can lead to more economical allocations, but determining the winners is NP-complete and inapproximable. We present...
166
click to vote
MS
2003
15 years 8 months ago
2003
Manufacturing test structures of microsensors and microactuators is very expensive in terms of time and materials. In a conventional design process, this limits the number of desi...
222
click to vote
NIPS
2003
15 years 8 months ago
2003
We describe a pattern acquisition algorithm that learns, in an unsupervised fashion, a streamlined representation of linguistic structures from a plain natural-language corpus. Th...