T-N Plane Abstraction (E-TNPA) proposed in this paper realizes work-conserving and efficient optimal real-time scheduling on multiprocessors relative to the original T-N Plane Ab...
We present a polynomial-time approximation scheme (PTAS) for the Steiner tree problem with polygonal obstacles in the plane with running time O(n log2 n), where n denotes the numb...
: Data filtering is an important approach to reduce energy consumption. Following this idea, Interest is used as a constraint to filter uninterested data in sensor networks. Within...
Abstract. In this paper, some sufficient conditions are obtained to guarantee that discrete time cellular neural networks (DTCNNs) can have some stable memory patterns. These condi...
In this paper we propose a new compression algorithm geared to reduce the time needed to test scan-based designs. Our scheme compresses the test vector set by encoding the bits th...