Sciweavers

5757 search results - page 1006 / 1152
» Dynamic Policy Programming
Sort
View
ASPDAC
2004
ACM
97views Hardware» more  ASPDAC 2004»
14 years 2 months ago
Complexity analysis and speedup techniques for optimal buffer insertion with minimum cost
As gate delays decrease faster than wire delays for each technology generation, buffer insertion becomes a popular method to reduce the interconnect delay. Several modern buffer in...
Weiping Shi, Zhuo Li, Charles J. Alpert
CASES
2004
ACM
14 years 2 months ago
A post-compiler approach to scratchpad mapping of code
ScratchPad Memories (SPMs) are commonly used in embedded systems because they are more energy-efficient than caches and enable tighter application control on the memory hierarchy...
Federico Angiolini, Francesco Menichelli, Alberto ...
MM
2004
ACM
183views Multimedia» more  MM 2004»
14 years 2 months ago
Content-based music structure analysis with applications to music semantics understanding
In this paper, we present a novel approach for music structure analysis. A new segmentation method, beat space segmentation, is proposed and used for music chord detection and voc...
Namunu Chinthaka Maddage, Changsheng Xu, Mohan S. ...
CC
2004
Springer
14 years 2 months ago
Developing a Foundation for Code Optimization
Although optimization technology has been successful over the past 40 years, recent trends are emerging that demand we reconsider the paradigm that we are using for code optimizati...
Mary Lou Soffa
ESA
2004
Springer
103views Algorithms» more  ESA 2004»
14 years 2 months ago
Faster Fixed-Parameter Tractable Algorithms for Matching and Packing Problems
Abstract. We obtain faster algorithms for problems such as rdimensional matching, r-set packing, graph packing, and graph edge packing when the size k of the solution is considered...
Michael R. Fellows, Christian Knauer, Naomi Nishim...
« Prev « First page 1006 / 1152 Last » Next »