Sciweavers

586 search results - page 4 / 118
» A Recursive Technique for Computing Lower-Bound Performance ...
Sort
View
MICRO
1999
IEEE
110views Hardware» more  MICRO 1999»
13 years 12 months ago
Balance Scheduling: Weighting Branch Tradeoffs in Superblocks
Since there is generally insufficient instruction level parallelism within a single basic block, higher performance is achieved by speculatively scheduling operations in superbloc...
Alexandre E. Eichenberger, Waleed Meleis
ICCV
2007
IEEE
14 years 9 months ago
Limits of Learning-Based Superresolution Algorithms
Learning-based superresolution (SR) are popular SR techniques that use application dependent priors to infer the missing details in low resolution images (LRIs). However, their pe...
Zhouchen Lin, Junfeng He, Xiaoou Tang, Chi-Keung T...
IFM
2010
Springer
190views Formal Methods» more  IFM 2010»
13 years 6 months ago
On Model Checking Techniques for Randomized Distributed Systems
Abstract. The automata-based model checking approach for randomized distributed systems relies on an operational interleaving semantics of the system by means of a Markov decision ...
Christel Baier
LCPC
2000
Springer
13 years 11 months ago
Recursion Unrolling for Divide and Conquer Programs
This paper presents recursion unrolling, a technique for improving the performance of recursive computations. Conceptually, recursion unrolling inlines recursive calls to reduce c...
Radu Rugina, Martin C. Rinard
GECCO
2010
Springer
233views Optimization» more  GECCO 2010»
14 years 13 days ago
Evolutionary-based conflict-free scheduling of collective communications on spidergon NoCs
The Spidergon interconnection network has become popular recently in multiprocessor systems on chips. To the best of our knowledge, algorithms for collective communications (CC) h...
Jirí Jaros, Vaclav Dvorak