4117 search results - page 90 / 824 » On the Satisfiability of Complex Constraints |
141
click to vote
ISCAS
1999
IEEE
15 years 10 months ago
1999
IEEE
In this paper, the problem of determining if a given sequential specification can be made to fit a predetermined set of shape constraints is explored. Shape constraints are constr...
164
click to vote
GECCO
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. The current trend in Embedded Systems (ES) design is moving towards the integration of increasingly complex applications on a single chip. An Embedded System has to satis...
158
click to vote
DASFAA
2007
IEEE
16 years 21 days ago
2007
IEEE
To support secure exchanging and sharing of XML data over the Internet, a myriad of XML access control mechanisms have been proposed. In the setting of node-level fine-grained acc...
246
click to vote
WAOA
2010
Springer
15 years 4 months ago
2010
Springer
In this paper, we improve a result by Arora, Khot, Kolla, Steurer, Tulsiani, and Vishnoi on solving the Unique Games problem on expanders. Given a (1-)-satisfiable instance of Uniq...
195
click to vote
SIAMCOMP
2000
15 years 6 months ago
2000
In this paper we consider the complexity of several problems involving finite algebraic structures. Given finite algebras A and B, these problems ask the following. (1) Do A and B ...