4117 search results - page 78 / 824 » On the Satisfiability of Complex Constraints |
157
click to vote
FOCS
1999
IEEE
15 years 11 months ago
1999
IEEE
We show1 that non-deterministic time NTIME(n) is not contained in deterministic time n 2and polylogarithmic space, for any > 0. This implies that (infinitely often) satisfiabi...
154
click to vote
ICIP
2004
IEEE
16 years 8 months ago
2004
IEEE
This paper proposes two techniques for low-complexity rate-distortion (R-D) optimized streaming of packetized video. These techniques enable computing packet transmission schedule...
188
click to vote
IPPS
2008
IEEE
16 years 1 months ago
2008
IEEE
High-performance microprocessors, e.g., multithreaded and multicore processors, are being implemented in embedded real-time systems because of the increasing computational require...
178
click to vote
ADHOCNOW
2008
Springer
16 years 1 months ago
2008
Springer
We study two algorithmical problems inspired from routing constraints in a multihop synchronous radio network. Our objective is to satisfy a given set of communication requests in ...
168
click to vote
ICPP
2007
IEEE
16 years 1 months ago
2007
IEEE
Sequence alignment is a fundamental problem in the computational biology. Many alignment methods have been proposed in the literature, such as pair-wise sequence alignment (2SA), ...