Sciweavers

14 search results - page 2 / 3
» An Efficient Decision Procedure for Functional Decomposable ...
Sort
View
AMAI
2004
Springer
13 years 11 months ago
Using Automatic Case Splits and Efficient CNF Translation to Guide a SAT-solver when Formally Verifying Out-Of-Order Processors
The paper integrates automatically generated case-splitting expressions, and an efficient translation to CNF, in order to formally verify an out-of-order superscalar processor havi...
Miroslav N. Velev
TACAS
2010
Springer
255views Algorithms» more  TACAS 2010»
13 years 4 months ago
Satisfiability Modulo the Theory of Costs: Foundations and Applications
Abstract. We extend the setting of Satisfiability Modulo Theories (SMT) by introducing a theory of costs C, where it is possible to model and reason about resource consumption and ...
Alessandro Cimatti, Anders Franzén, Alberto...
KR
2004
Springer
13 years 11 months ago
GAI Networks for Utility Elicitation
This paper deals with preference representation and elicitation in the context of multiattribute utility theory under risk. Assuming the decision maker behaves according to the EU...
Christophe Gonzales, Patrice Perny
CODES
2010
IEEE
13 years 4 months ago
Improving platform-based system synthesis by satisfiability modulo theories solving
Due to the ever increasing system complexity, deciding whether a given platform is sufficient to implement a set of applications under given constraints becomes a serious bottlene...
Felix Reimann, Michael Glaß, Christian Haube...
TKDE
2012
245views Formal Methods» more  TKDE 2012»
11 years 8 months ago
Semi-Supervised Maximum Margin Clustering with Pairwise Constraints
—The pairwise constraints specifying whether a pair of samples should be grouped together or not have been successfully incorporated into the conventional clustering methods such...
Hong Zeng, Yiu-ming Cheung