5105 search results - page 247 / 1021 » An algorithm to determine peer-reviewers |
145
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
— We examine the problem of determining which nodes are neighbors of a given one in a wireless network. We consider an unsupervised network operating on a frequencyflat Gaussian...
171
click to vote
JCO
2007
15 years 6 months ago
2007
We consider the problem of orienting the edges of a graph so that the length of a longest path in the resulting digraph is minimum. As shown by Gallai, Roy and Vitaver, this edge ...
175
click to vote
AAECC
2002
Springer
15 years 6 months ago
2002
Springer
Abstract. For any integral convex polytope in R2 there is an explicit construction of an error-correcting code of length (q - 1)2 over the finite field Fq, obtained by evaluation o...
160
click to vote
ET
2000
15 years 6 months ago
2000
An efficient deterministic BIST scheme based on partial scan chains together with a scan selection algorithm tailored for BIST is presented. The algorithm determines a minimum num...
169
click to vote
AAECC
1998
Springer
15 years 6 months ago
1998
Springer
We describe a new approach of the generalized Bezout identity for linear time-varying ordinary differential control systems. We also explain when and how it can be extended to line...