Sciweavers

526 search results - page 76 / 106
» On the Number of Minimal Addition Chains
Sort
View
ESTIMEDIA
2006
Springer
15 years 1 months ago
Loop Nest Splitting for WCET-Optimization and Predictability Improvement
This paper presents the influence of the loop nest splitting source code optimization on the worst-case execution time (WCET). Loop nest splitting minimizes the number of executed...
Heiko Falk, Martin Schwarzer
EUC
2006
Springer
15 years 1 months ago
Cross-Layer Duty Cycle Scheduling with Data Aggregation Routing in Wireless Sensor Networks
Abstract. Well-scheduled communications, in conjunction with the aggregation of data reduce the energy waste on idle listening and redundant transmissions. In addition, the adjusta...
Yean-Fu Wen, Frank Yeong-Sung Lin
ICPADS
2000
IEEE
15 years 1 months ago
Optimal Fault-Tolerant Routing in Hypercubes Using Extended Safety Vectors
1 Reliable communication in cube-based multicomputers using the extended safety vector concept is studied in this paper. In our approach, each node in a cube-based multicomputer o...
Jie Wu, Feng Gao, Zhongcheng Li, Yinghua Min
DATE
2008
IEEE
126views Hardware» more  DATE 2008»
14 years 11 months ago
State Skip LFSRs: Bridging the Gap between Test Data Compression and Test Set Embedding for IP Cores
1 We present a new type of Linear Feedback Shift Registers, State Skip LFSRs. State Skip LFSRs are normal LFSRs with the addition of a small linear circuit, the State Skip circuit,...
V. Tenentes, Xrysovalantis Kavousianos, Emmanouil ...
SODA
2004
ACM
104views Algorithms» more  SODA 2004»
14 years 11 months ago
Tight bounds for the partial-sums problem
We close the gaps between known lower and upper bounds for the online partial-sums problem in the RAM and group models of computation. If elements are chosen from an abstract grou...
Mihai Patrascu, Erik D. Demaine