1051 search results - page 169 / 211 » Foundations of Constraint Satisfaction |
STOC
2009
ACM
14 years 10 months ago
2009
ACM
In this paper we study a fundamental open problem in the area of probabilistic checkable proofs: What is the smallest s such that NP naPCP1,s[O(log n), 3]? In the language of har...
ICCAD
2004
IEEE
14 years 6 months ago
2004
IEEE
Improving logic capacity by time-sharing, dynamically reconfigurable FPGAs are employed to handle designs of high complexity and functionality. In this paper, we model each task ...
DATE
2009
IEEE
14 years 4 months ago
2009
IEEE
This paper demonstrates a system that performs multiobjective sizing across 100,000 analog circuit topologies simultaneously, with SPICE accuracy. It builds on a previous system, ...
ICMT
2009
Springer
14 years 4 months ago
2009
Springer
Testing model transformations requires input models which are graphs of inter-connected objects that must conform to a meta-model and meta-constraints from heterogeneous sources su...
COMPSAC
2008
IEEE
14 years 4 months ago
2008
IEEE
We discuss the suitability of service-oriented computing for the automotive domain. We present a formal high-level language in which complex automotive activities can be modelled ...