3471 search results - page 496 / 695 » Obstacle Numbers of Graphs |
206
click to vote
ISPDC
2005
IEEE
16 years 4 days ago
2005
IEEE
Abstract— In this article, we propose a fully distributed algorithm for finding all primes in an given interval [2..n] (or (L, R), more generally), based on the SMER — Schedul...
156
click to vote
DCOSS
2005
Springer
16 years 3 days ago
2005
Springer
We present an efficient distributed data structure, called the D-SPANNER, for maintaining proximity information among communicating mobile nodes. The D-SPANNER is a kinetic sparse...
167
click to vote
SAMOS
2004
Springer
15 years 12 months ago
2004
Springer
A high-performance data-path to implement DSP kernels is proposed in this paper. The data-path is based on a flexible, universal, and regular component to optimally exploiting both...
171
click to vote
VTS
2003
IEEE
15 years 12 months ago
2003
IEEE
—We present a dictionary-based test data compression approach for reducing test data volume and testing time in SOCs. The proposed method is based on the use of a small number of...
151
click to vote
ISAAC
2001
Springer
15 years 11 months ago
2001
Springer
Abstract. We first consider adaptive serial diagnosis for multiprocessor systems. We present an adaptive diagnosis algorithm using N + t − 1 tests, which is the smallest possibl...