Sciweavers

1278 search results - page 149 / 256
» The Complexity of Weighted Boolean
Sort
View
KDD
1995
ACM
130views Data Mining» more  KDD 1995»
14 years 1 months ago
Compression-Based Evaluation of Partial Determinations
Our work tackles the problem of finding partial determinations in databases and proposes a compressionbased measure to evaluate them. Partial determinations can be viewed as gener...
Bernhard Pfahringer, Stefan Kramer
CAV
2010
Springer
206views Hardware» more  CAV 2010»
14 years 1 months ago
Dynamic Cutoff Detection in Parameterized Concurrent Programs
We consider the class of finite-state programs executed by an unbounded number of replicated threads communicating via shared variables. The thread-state reachability problem for t...
Alexander Kaiser, Daniel Kroening, Thomas Wahl
ASPDAC
2005
ACM
102views Hardware» more  ASPDAC 2005»
14 years 11 days ago
A framework for automated and optimized ASIP implementation supporting multiple hardware description languages
— Architecture Description Languages (ADLs) are widely used to perform design space exploration for Application Specific Instruction Set Processors (ASIPs). While the design spa...
Oliver Schliebusch, Anupam Chattopadhyay, David Ka...
CSCLP
2008
Springer
14 years 6 days ago
Challenges in Constraint-Based Analysis of Hybrid Systems
In the analysis of hybrid discrete-continuous systems, rich arithmetic constraint formulae with complex Boolean structure arise naturally. The iSAT algorithm, a solver for such for...
Andreas Eggers, Natalia Kalinnik, Stefan Kupfersch...
ICAI
2007
13 years 12 months ago
Mining and Dynamic Simulation of Sub-Networks from Large Biomolecular Networks
Biomolecular networks dynamically respond to stimuli and implement cellular function. Understanding these dynamic changes is the key challenge for cell biologists. As biomolecular...
Xiaohua Hu, Fang-Xiang Wu, Michael K. Ng, Bahrad A...