12459 search results - page 153 / 2492 » cans 2006 |
155
click to vote
JISE
2000
15 years 4 months ago
2000
We present an algorithm for identifyinga set of faults that do not have to be targeted by a sequential delay fault test generator. These faults either cannot independently aect th...
114
click to vote
JPDC
2000
15 years 4 months ago
2000
In this paper we propose a new minimum total communication distance T CD algorithm and an optimal T CD algorithm for broadcast in a 3-dimensional mesh 3-D mesh. The former generat...
105
click to vote
JSS
2000
15 years 4 months ago
2000
To simplify the task of constructing wrapper/monitor for the information sources in data warehouse systems, we provide a modularized design method to re-use the code. By substitut...
133
click to vote
FMSD
2002
15 years 4 months ago
2002
The powerlists data structure, created by Misra in the early 90s, is well suited to express recursive, data-parallel algorithms. Misra has shown how powerlists can be used to give ...
135
click to vote
COMBINATORICS
1998
15 years 4 months ago
1998
A circulant graph G of order n is a Cayley graph over the cyclic group Zn. Equivalently, G is circulant iff its vertices can be ordered such that the corresponding adjacency matr...