Sciweavers

4908 search results - page 752 / 982
» On the Complexity of Optimal K-Anonymity
Sort
View
CEC
2007
IEEE
16 years 29 days ago
A study on the design issues of Memetic Algorithm
— Over the recent years, there has been increasing research activities made on improving the efficacy of Memetic Algorithm (MA) for solving complex optimization problems. Partic...
Q. H. Nguyen, Yew-Soon Ong, Natalio Krasnogor
DATE
2007
IEEE
130views Hardware» more  DATE 2007»
16 years 29 days ago
A novel criticality computation method in statistical timing analysis
Abstract— The impact of process variations increases as technology scales to nanometer region. Under large process variations, the path and arc/node criticality [18] provide effe...
Feng Wang 0004, Yuan Xie, Hai Ju
DATE
2007
IEEE
150views Hardware» more  DATE 2007»
16 years 29 days ago
Fast memory footprint estimation based on maximal dependency vector calculation
In data dominated applications, loop transformations have a huge impact on the lifetime of array data and therefore on memory footprint. Since a locally optimal loop transformatio...
Qubo Hu, Arnout Vandecappelle, Per Gunnar Kjeldsbe...
DATE
2007
IEEE
114views Hardware» more  DATE 2007»
16 years 29 days ago
Two-level microprocessor-accelerator partitioning
The integration of microprocessors and field-programmable gate array (FPGA) fabric on a single chip increases both the utility and necessity of tools that automatically move softw...
Scott Sirowy, Yonghui Wu, Stefano Lonardi, Frank V...
ECRTS
2007
IEEE
16 years 29 days ago
WCET-Directed Dynamic Scratchpad Memory Allocation of Data
Many embedded systems feature processors coupled with a small and fast scratchpad memory. To the difference with caches, allocation of data to scratchpad memory must be handled by...
Jean-François Deverge, Isabelle Puaut