Sciweavers

1042 search results - page 96 / 209
» Fast Population Coding
Sort
View
118
Voted
HIS
2009
14 years 10 months ago
A Memetic Algorithm for the Generalized Minimum Vertex-Biconnected Network Problem
Abstract--The generalized minimum vertex-biconnected network problem plays an important role in the design of survivable backbone networks that should be fault tolerant to single c...
Bin Hu, Günther R. Raidl
116
Voted
FAST
2011
14 years 4 months ago
Exploiting Half-Wits: Smarter Storage for Low-Power Devices
This work analyzes the stochastic behavior of writing to embedded flash memory at voltages lower than recommended by a microcontroller’s specifications to reduce energy consum...
Mastooreh Salajegheh, Yue Wang, Kevin Fu, Anxiao J...
121
Voted
CGO
2005
IEEE
15 years 6 months ago
Maintaining Consistency and Bounding Capacity of Software Code Caches
Software code caches are becoming ubiquitous, in dynamic optimizers, runtime tool platforms, dynamic translators, fast simulators and emulators, and dynamic compilers. Caching fre...
Derek Bruening, Saman P. Amarasinghe
115
Voted
ISCA
2007
IEEE
198views Hardware» more  ISCA 2007»
15 years 6 months ago
Making the fast case common and the uncommon case simple in unbounded transactional memory
Hardware transactional memory has great potential to simplify the creation of correct and efficient multithreaded programs, allowing programmers to exploit more effectively the s...
Colin Blundell, Joe Devietti, E. Christopher Lewis...
106
Voted
CP
2001
Springer
15 years 5 months ago
Fast Optimal Instruction Scheduling for Single-Issue Processors with Arbitrary Latencies
Instruction scheduling is one of the most important steps for improving the performance of object code produced by a compiler. The local instruction scheduling problem is to nd a m...
Peter van Beek, Kent D. Wilken