Sciweavers

233 search results - page 8 / 47
» Efficient Combination of Decision Procedures for MUS Computa...
Sort
View
CADE
2007
Springer
14 years 8 months ago
Towards Efficient Satisfiability Checking for Boolean Algebra with Presburger Arithmetic
Boolean Algebra with Presburger Arithmetic (BAPA) is a decidable logic that combines 1) Boolean algebra of sets of uninterpreted elements (BA) and 2) Presburger arithmetic (PA). BA...
Viktor Kuncak, Martin C. Rinard
ICPR
2002
IEEE
14 years 8 months ago
Speeding up SVM Decision Based on Mirror Points
In this paper, we propose a new method to speed up SVM decision based on the idea of mirror points. Decisions based on multiple simple classifiers, which are formed as a result of...
Jiun-Hung Chen, Chu-Song Chen
FMCAD
1998
Springer
13 years 12 months ago
Combining Symbolic Model Checking with Uninterpreted Functions for Out-of-Order Processor Verification
We present a new approach to the verification of hardware systems with data dependencies using temporal logic symbolic model checking. As a benchmark we take Tomasulo's algori...
Sergey Berezin, Armin Biere, Edmund M. Clarke, Yun...
CSDA
2006
91views more  CSDA 2006»
13 years 7 months ago
Maximum a posteriori pruning on decision trees and its application to bootstrap BUMPing
The cost-complexity pruning generates nested subtrees and selects the best one. However, its computational cost is large since it uses holdout sample or cross-validation. On the o...
Jinseog Kim, Yongdai Kim
IPPS
2006
IEEE
14 years 1 months ago
An overview of the Jahob analysis system: project goals and current status
We present an overview of the Jahob system for modular analysis of data structure properties. Jahob uses a subset of Java as the implementation language and annotations with formu...
Viktor Kuncak, Martin C. Rinard