Sciweavers

1688 search results - page 119 / 338
» Implementing Optimizations at Decode Time
Sort
View
CGO
2005
IEEE
14 years 4 months ago
Optimizing Sorting with Genetic Algorithms
The growing complexity of modern processors has made the generation of highly efficient code increasingly difficult. Manual code generation is very time consuming, but it is oft...
Xiaoming Li, María Jesús Garzar&aacu...
STOC
2004
ACM
157views Algorithms» more  STOC 2004»
14 years 10 months ago
Derandomizing homomorphism testing in general groups
The main result of this paper is a near-optimal derandomization of the affine homomorphism test of Blum, Luby and Rubinfeld (Journal of Computer and System Sciences, 1993). We sho...
Amir Shpilka, Avi Wigderson
GLOBECOM
2006
IEEE
14 years 4 months ago
Cooperative Relay Networks Using Fountain Codes
We investigate a cooperative communications scheme with N parallel relays, where both the transmissions from the source to the relays and from the relays to the destination use fo...
Andreas F. Molisch, Neelesh B. Mehta, Jonathan S. ...
DAC
2003
ACM
14 years 3 months ago
Instruction set compiled simulation: a technique for fast and flexible instruction set simulation
Instruction set simulators are critical tools for the exploration and validation of new programmable architectures. Due to increasing complexity of the architectures and timeto-ma...
Mehrdad Reshadi, Prabhat Mishra, Nikil D. Dutt
DAC
2003
ACM
14 years 11 months ago
Optimal integer delay budgeting on directed acyclic graphs
Delay budget is an excess delay each component of a design can tolerate under a given timing constraint. Delay budgeting has been widely exploited to improve the design quality. W...
Elaheh Bozorgzadeh, Soheil Ghiasi, Atsushi Takahas...