Sciweavers

441 search results - page 17 / 89
» Optimal Subsequence Bijection
Sort
View
RTAS
2005
IEEE
15 years 3 months ago
Improving WCET by Optimizing Worst-Case Paths
It is advantageous to perform compiler optimizations to lower the WCET of a task since tasks with lower WCETs are easier to schedule and more likely to meet their deadlines. Compi...
Wankang Zhao, William C. Kreahling, David B. Whall...
CIKM
2005
Springer
15 years 3 months ago
Selectivity-based partitioning: a divide-and-union paradigm for effective query optimization
Modern query optimizers select an efficient join ordering for a physical execution plan based essentially on the average join selectivity factors among the referenced tables. In ...
Neoklis Polyzotis
HEURISTICS
2008
120views more  HEURISTICS 2008»
14 years 9 months ago
A local linear embedding module for evolutionary computation optimization
A Local Linear Embedding (LLE) module enhances the performance of two Evolutionary Computation (EC) algorithms employed as search tools in global optimization problems. The LLE em...
Fabio Boschetti
IEEECIT
2010
IEEE
14 years 8 months ago
Superblock-Based Source Code Optimizations for WCET Reduction
—Superblocks represent regions in a program code that consist of multiple basic blocks. Compilers benefit from this structure since it enables optimization across block boundari...
Paul Lokuciejewski, Timon Kelter, Peter Marwedel
DPHOTO
2009
154views Hardware» more  DPHOTO 2009»
14 years 7 months ago
Optimal color filter array design: quantitative conditions and an efficient search procedure
Most digital cameras employ a spatial subsampling process, implemented as a color filter array (CFA), to capture color images. The choice of CFA patterns has a great impact on the...
Yue M. Lu, Martin Vetterli