3864 search results - page 144 / 773 » time 2005 |
147
click to vote
PAM
2005
Springer
15 years 12 months ago
2005
Springer
We propose a practical technique for the identification of lossy network links from end-to-end measurements. Our scheme is based on a function that computes the likelihood of each...
145
click to vote
ICCAD
2005
IEEE
16 years 3 months ago
2005
IEEE
Process variations in nanometer technologies are becoming an important issue for cutting-edge FPGAs with a multimillion gate capacity. Considering both die-to-die and withindie va...
154
click to vote
ISCIS
2005
Springer
15 years 12 months ago
2005
Springer
Abstract. We investigate the problem of enumerating schedules, consisting of course-section assignments, in increasing order of the number of conflicts they contain. We define th...
143
click to vote
DAM
2006
15 years 6 months ago
2006
We observe that a formula given by S. Negami [Trans. Amer. Math. Soc. 299 (1987), 601-622] for the Tutte polynomial of a k-sum of two graphs generalizes to a colored Tutte polynom...
132
click to vote
DFT
2005
IEEE
16 years 20 hour ago
2005
IEEE
In this paper, we present two novel methodologies for testing the interconnect fabrics of network-on-chip (NoC) based chips. Both use the concept of recursive testing, with differ...