260 search results - page 12 / 52 » Range and Set Abstraction using SAT |
FSTTCS
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. We consider exchange economies where the traders’ preferences are expressed in terms of the extensively used constant elasticity of substitution (CES) utility functions...
TABLEAUX
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. Model checking is a technique for verifying that a finite-state concurrent system is correct with respect to its specification. In bounded model checking (BMC), the sys...
ICST
2010
IEEE
13 years 6 months ago
2010
IEEE
Abstract—Software Product Lines (SPL) are difficult to validate due to combinatorics induced by variability across their features. This leads to combinatorial explosion of the n...
CP
2005
Springer
14 years 1 months ago
2005
Springer
Abstract Competition and cooperation can boost the performance of a combinatorial search process. Both can be implemented with a portfolio of algorithms which run in parallel, give...
ICFEM
2004
Springer
14 years 26 days ago
2004
Springer
d Abstract) Carsten Sinz and Wolfgang K¨uchlin Symbolic Computation Group, WSI for Computer Science, University of T¨ubingen and Steinbeis Technology Transfer Center OIT, 72076 T...