Sciweavers

816 search results - page 147 / 164
» Interconnect design methods for memory design
Sort
View
EOR
2007
90views more  EOR 2007»
13 years 7 months ago
Tabu search and GRASP for the maximum diversity problem
In this paper, we develop new heuristic procedures for the maximum diversity problem (MDP). This NPhard problem has a significant number of practical applications such as environm...
Abraham Duarte, Rafael Martí
IJHPCA
2007
116views more  IJHPCA 2007»
13 years 7 months ago
Parallel Languages and Compilers: Perspective From the Titanium Experience
We describe the rationale behind the design of key features of Titanium—an explicitly parallel dialect of JavaTM for high-performance scientific programming—and our experienc...
Katherine A. Yelick, Paul N. Hilfinger, Susan L. G...
TEC
2008
100views more  TEC 2008»
13 years 7 months ago
Real-Valued Compact Genetic Algorithms for Embedded Microcontroller Optimization
Recent research on compact genetic algorithms (cGAs) has proposed a number of evolutionary search methods with reduced memory requirements. In cGAs, the evolution of populations is...
Ernesto Mininno, Francesco Cupertino, David Naso
IPPS
2010
IEEE
13 years 5 months ago
Highly scalable parallel sorting
Sorting is a commonly used process with a wide breadth of applications in the high performance computing field. Early research in parallel processing has provided us with comprehen...
Edgar Solomonik, Laxmikant V. Kalé
JCST
2010
147views more  JCST 2010»
13 years 2 months ago
A Multi-Key Pirate Decoder Against Traitor Tracing Schemes
In this paper we introduce an architecture for a multi-key pirate decoder which employs decryption keys from multiple traitors. The decoder has built-in monitoring and self protect...
Yongdong Wu, Robert H. Deng