613 search results - page 21 / 123 » The Memory Fragmentation Problem: Solved |
200
Voted
ARC
2012
Springer
13 years 10 months ago
2012
Springer
Iterative numerical algorithms with high memory bandwidth requirements but medium-size data sets (matrix size ∼ a few 100s) are highly appropriate for FPGA acceleration. This pap...
116
Voted
CORR
2006
Springer
15 years 2 months ago
2006
Springer
We study a generalized version of reversal bounded Turing machines where, apart from several tapes on which the number of head reversals is bounded by r(n), there are several furth...
124
click to vote
DAC
2008
ACM
16 years 3 months ago
2008
ACM
Boolean function bi-decomposition is a fundamental operation in logic synthesis. A function f(X) is bi-decomposable under a variable partition XA, XB, XC on X if it can be written...
118
click to vote
ICCBR
2005
Springer
15 years 8 months ago
2005
Springer
We use case-injected genetic algorithms for learning how to competently play computer strategy games. Case-injected genetic algorithms combine genetic algorithm search with a case-...
120
click to vote
PPL
2010
15 years 28 days ago
2010
We present the Input Acceptance of Transactional Memory (TM). Despite the large interest for performance of TMs, no existing research work has investigated the impact of solving a...