4117 search results - page 177 / 824 » On the Satisfiability of Complex Constraints |
106
click to vote
STOC
2004
ACM
16 years 6 months ago
2004
ACM
We continue the study of the trade-off between the length of PCPs and their query complexity, establishing the following main results (which refer to proofs of satisfiability of c...
164
click to vote
IAT
2007
IEEE
15 years 10 months ago
2007
IEEE
Multiagent systems (MAS) satisfy to design requirements for open physical complex systems. However, up to now, no method allows to build software/hardware hybrid multiagent system...
161
click to vote
AIML
2008
15 years 8 months ago
2008
In this paper we prove that Japaridze's Polymodal Logic is PSPACE-decidable. To show this, we describe a decision procedure for satisfiability on hereditarily ordered frames t...
153
click to vote
JAPLL
2006
15 years 6 months ago
2006
This paper presents a model checking algorithm for Propositional Dynamic Logic (PDL) with looping, repeat, test, intersection, converse, program complementation as well as context...
162
click to vote
ICIP
2000
IEEE
16 years 8 months ago
2000
IEEE
In this paper, we study rate-complexity-distortion (R-C-D) tradeoffs for video coding, where we focus on the complexity of computing the inverse DCT. A quadtree coding approach is...