1051 search results - page 169 / 211 » Foundations of Constraint Satisfaction |
149
click to vote
STOC
2009
ACM
16 years 6 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...
145
click to vote
ICCAD
2004
IEEE
16 years 2 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 ...
149
Voted
DATE
2009
IEEE
16 years 17 days 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, ...
194
Voted
ICMT
2009
Springer
16 years 11 days 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...
164
click to vote
COMPSAC
2008
IEEE
16 years 8 days 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 ...