Sciweavers

2095 search results - page 188 / 419
» Improved pebbling bounds
Sort
View
ATS
2009
IEEE
135views Hardware» more  ATS 2009»
16 years 1 months ago
On Scan Chain Diagnosis for Intermittent Faults
Diagnosis is increasingly important, not only for individual analysis of failing ICs, but also for high-volume test response analysis which enables yield and test improvement. Sca...
Dan Adolfsson, Joanna Siew, Erik Jan Marinissen, E...
ICC
2009
IEEE
111views Communications» more  ICC 2009»
16 years 1 months ago
A Study of the Percolation Threshold for k-Collaborative Wireless Networks
—How to efficiently use the air interface is a crucial issue in wireless networks. In order to improve the performance, mechanisms have been proposed to improve the reach and th...
Cédric Westphal
ISQED
2007
IEEE
152views Hardware» more  ISQED 2007»
16 years 25 days ago
Variation Aware Timing Based Placement Using Fuzzy Programming
In nanometer regime, the effects of variations are having an increasing impact on the delay and power characteristics of devices as well as the yield of the circuit. Statistical t...
Venkataraman Mahalingam, N. Ranganathan
EUC
2007
Springer
16 years 21 days ago
Consensus-Driven Distributable Thread Scheduling in Networked Embedded Systems
We demonstrate an improved consensus-driven utility accrual scheduling algorithm (DUA-CLA) for distributable threads which execute under run-time uncertainties in execution time, ...
Jonathan Stephen Anderson, Binoy Ravindran, E. Dou...
WEA
2007
Springer
117views Algorithms» more  WEA 2007»
16 years 19 days ago
Better Landmarks Within Reach
We study the real algorithm for the point-to-point shortest path problem. It combines A∗ search search, landmark-based lower bounds, and reach-based pruning. We suggest several ...
Andrew V. Goldberg, Haim Kaplan, Renato Fonseca F....