1120 search results - page 14 / 224 » time 1999 |
ISCAS
1999
IEEE
15 years 2 months ago
1999
IEEE
In this paper, we present a new method for verifying the realizability of a timing diagram with linear timing constraints, thus ensuring that the implementation of the underlying ...
FCT
1999
Springer
15 years 2 months ago
1999
Springer
Abstract. It is proved that everywhere-dense Min 2SAT and everywheredense Min Eq both have polynomial time approximation schemes.
RTCSA
1999
IEEE
15 years 2 months ago
1999
IEEE
EMERALDS (Extensible Microkernel for Embedded, ReALtime, Distributed Systems) is a real-time microkernel designed for small-memory embedded applications. These applications must r...
TABLEAUX
1999
Springer
15 years 2 months ago
1999
Springer
We prove, by introducing a new kind of sequent calculus, that the decision problem for the non-associative Lambek calculus with product belongs to PTIME. This solves an open prolem...
CORR
1999
Springer
14 years 10 months ago
1999
Springer
: We introduce a generalization of Selman's P-selectivity that yields a more exible notion of selectivity, called polynomial-time multi-selectivity, in which the