4117 search results - page 171 / 824 » On the Satisfiability of Complex Constraints |
159
click to vote
LICS
1999
IEEE
15 years 10 months ago
1999
IEEE
The complexity of set constraints has been extensively studied over the last years and was often found quite high. At the lower end of expressiveness, there are atomic set constra...
172
click to vote
CDC
2008
IEEE
16 years 1 months ago
2008
IEEE
Abstract— This paper is concerned with the robust stabilization of a class of stochastic large-scale systems. The uncertainties satisfy integral quadratic constraints. The random...
168
click to vote
FOCS
2006
IEEE
16 years 18 days ago
2006
IEEE
In this paper we present a new approximation algorithm for Unique Games. For a Unique Game with n vertices and k states (labels), if a (1 − ε) fraction of all constraints is sa...
164
click to vote
ICCD
2003
IEEE
15 years 11 months ago
2003
IEEE
We present a test scheduling methodology for core-based system-on-chips that allows tradeoff between system power dissipation and overall test time. The basic strategy is to use t...
164
click to vote
FSTTCS
2003
Springer
15 years 11 months ago
2003
Springer
For monoids that satisfy a weak cancellation condition, it is shown that the decidability of the existential theory of word equations is preserved under graph products. Furthermore...