Sciweavers

315 search results - page 17 / 63
» Shortest path optimization under limited information
Sort
View
ICCD
1995
IEEE
83views Hardware» more  ICCD 1995»
13 years 11 months ago
Concurrent timing optimization of latch-based digital systems
Many design techniques have been proposed to optimize the performance of a digital system implemented in a given technology. Each of these techniques can be advantageous in partic...
Hong-Yean Hsieh, Wentai Liu, Ralph K. Cavin III, C...
DCOSS
2005
Springer
14 years 1 months ago
Routing Explicit Side Information for Data Compression in Wireless Sensor Networks
Abstract. Two difficulties in designing data-centric routes [2–5] in wireless sensor networks are the lack of reasonably practical data aggregation models and the high computatio...
Huiyu Luo, Gregory J. Pottie
MICRO
2006
IEEE
117views Hardware» more  MICRO 2006»
14 years 1 months ago
PathExpander: Architectural Support for Increasing the Path Coverage of Dynamic Bug Detection
Dynamic software bug detection tools are commonly used because they leverage run-time information. However, they suffer from a fundamental limitation, the Path Coverage Problem: t...
Shan Lu, Pin Zhou, Wei Liu, Yuanyuan Zhou, Josep T...
ICUMT
2009
13 years 5 months ago
Large system analysis of beamforming for MIMO systems with limited training
We consider multiple-input multiple-output (MIMO) systems exploiting the full diversity order of a MIMO fading channel via optimal beamforming and combining. Specifically, an analy...
Francisco Rubio, Dongning Guo, Michael L. Honig, X...
ASAP
1997
IEEE
107views Hardware» more  ASAP 1997»
13 years 11 months ago
Tiling with limited resources
In the framework of perfect loop nests with uniform dependences, tiling has been extensively studied as a source-to-source program transformation. Little work has been devoted to ...
Pierre-Yves Calland, Jack Dongarra, Yves Robert