Sciweavers

845 search results - page 148 / 169
» Diagnosabilities of regular networks
Sort
View
SAC
2006
ACM
14 years 1 months ago
Evaluating unstructured peer-to-peer lookup overlays
Unstructured peer-to-peer lookup systems incur small constant overhead per single join or leave operation, and can easily support keyword searches. Hence, they are suitable for dy...
Idit Keidar, Roie Melamed
CGO
2005
IEEE
14 years 1 months ago
A Progressive Register Allocator for Irregular Architectures
Register allocation is one of the most important optimizations a compiler performs. Conventional graphcoloring based register allocators are fast and do well on regular, RISC-like...
David Koes, Seth Copen Goldstein
DATE
2005
IEEE
107views Hardware» more  DATE 2005»
14 years 1 months ago
Exploring NoC Mapping Strategies: An Energy and Timing Aware Technique
Complex applications implemented as Systems on Chip (SoCs) demand extensive use of system level modeling and validation. Their implementation gathers a large number of complex IP ...
César A. M. Marcon, Ney Laert Vilar Calazan...
PRDC
2005
IEEE
14 years 1 months ago
Partitioned Cache Shadowing for Deep Sub-Micron (DSM) Regime
An important issue in modern cache designs is bridging the gap between wire and device delays. This warrants the use of more regular and modular structures to mask wire latencies....
Heng Xu, Arun K. Somani
AUSAI
2005
Springer
14 years 1 months ago
Accelerating Real-Valued Genetic Algorithms Using Mutation-with-Momentum
: In a canonical genetic algorithm, the reproduction operators (crossover and mutation) are random in nature. The direction of the search carried out by the GA system is driven pur...
Luke Temby, Peter Vamplew, Adam Berry