Sciweavers

499 search results - page 47 / 100
» A Dynamic-Programming Based ASP-Solver
Sort
View
ICML
2009
IEEE
14 years 11 months ago
Structure learning of Bayesian networks using constraints
This paper addresses exact learning of Bayesian network structure from data and expert's knowledge based on score functions that are decomposable. First, it describes useful ...
Cassio Polpo de Campos, Zhi Zeng, Qiang Ji
CAV
2009
Springer
171views Hardware» more  CAV 2009»
14 years 11 months ago
CalFuzzer: An Extensible Active Testing Framework for Concurrent Programs
Active testing has recently been introduced to effectively test concurrent programs. Active testing works in two phases. It first uses predictive off-the-shelf static or dynamic pr...
Pallavi Joshi, Mayur Naik, Chang-Seo Park, Koushik...
VLSID
2002
IEEE
160views VLSI» more  VLSID 2002»
14 years 11 months ago
An Efficient Hierarchical Timing-Driven Steiner Tree Algorithm for Global Routing
In this paper, we propose a hierarchical timing-driven Steiner tree algorithm for global routing which considers the minimization of timing delay during the tree construction as t...
Jingyu Xu, Xianlong Hong, Tong Jing, Yici Cai, Jun...
STOC
2005
ACM
167views Algorithms» more  STOC 2005»
14 years 11 months ago
Approximately counting integral flows and cell-bounded contingency tables
We consider the problem of approximately counting integral flows in a network. We show that there is an fpras based on volume estimation if all capacities are sufficiently large, ...
Mary Cryan, Martin E. Dyer, Dana Randall
CC
2010
Springer
243views System Software» more  CC 2010»
14 years 5 months ago
Optimizing Matlab through Just-In-Time Specialization
Abstract. Scientists are increasingly using dynamic programming languages like Matlab for prototyping and implementation. Effectively compiling Matlab raises many challenges due t...
Maxime Chevalier-Boisvert, Laurie J. Hendren, Clar...