613 search results - page 38 / 123 » The Memory Fragmentation Problem: Solved |
149
Voted
GECCO
2007
Springer
15 years 4 months ago
2007
Springer
In autonomous agent systems, memory is an important element to handle agent behaviors appropriately. We present the analysis of memory requirements for robotic tasks including wal...
101
click to vote
CORR
2007
Springer
15 years 2 months ago
2007
Springer
— Finding low-weight multiples of a binary polynomial is a difficult problem arising in the context of stream ciphers cryptanalysis. The best algorithms to solve this problem ar...
117
Voted
IPPS
2000
IEEE
15 years 7 months ago
2000
IEEE
Consider any known sequential algorithm for matrix multiplication over an arbitrary ring with time complexity O N , where 2 3. We show that such an algorithm can be parallelize...
130
Voted
ICPP
1998
IEEE
15 years 6 months ago
1998
IEEE
To execute a shared memory program efficiently, we have to manage memory consistency with low overheads, and have to utilize communication bandwidth of the platform as much as pos...
132
Voted
ISCA
2006
IEEE
15 years 2 months ago
2006
IEEE
The assumption of maximum parallelism support for the successful realization of scalable quantum computers has led to homogeneous, "sea-of-qubits" architectures. The res...