4117 search results - page 51 / 824 » On the Satisfiability of Complex Constraints |
JC
2008
14 years 11 months ago
2008
We study the complexity of randomized solution of initial value problems for systems of ordinary differential equations (ODE). The input data are assumed to be -smooth ( = r+ : th...
AIML
2004
15 years 1 months ago
2004
This paper shows that satisfiability for Propositional Dynamic Logic with Intersection is EXPSPACE-hard. The proof uses a reduction from the word problem for alternating, exponent...
111
click to vote
SOFSEM
1999
Springer
15 years 4 months ago
1999
Springer
We study learning scenarios in which multiple learners are involved and “nature” imposes some constraints that force the predictions of these learners to behave coherently. Thi...
CORR
2007
Springer
14 years 11 months ago
2007
Springer
— Design criteria and full-diversity Distributed Space Time Codes (DSTCs) for the two phase transmission based cooperative diversity protocol of Jing-Hassibi and the Generalized ...
128
click to vote
SIAMCOMP
1998
14 years 11 months ago
1998
Motivated by applications in computer graphics, visualization, and scienti c computation, we study the computational complexity of the following problem: Given a set S of n points...