613 search results - page 33 / 123 » The Memory Fragmentation Problem: Solved |
123
Voted
PODC
1999
ACM
15 years 6 months ago
1999
ACM
We study the memory requirements of self-stabilizing leader election (SSLE) protocols. We are mainly interested in two types of systems: anonymous systems and id-based systems. We...
133
Voted
IJSSE
2010
14 years 11 months ago
2010
Memory managers are an important part of any modern language: they are used to dynamically allocate memory for use in the program. Many managers exist and depending on the operati...
129
Voted
GECCO
2009
Springer
15 years 9 months ago
2009
Springer
Recently, a form of memory usage was introduced for genetic programming (GP) called “soft memory.” Rather than have a new value completely overwrite the old value in a registe...
115
click to vote
CASES
2003
ACM
15 years 7 months ago
2003
ACM
Focusing on embedded applications, scratchpad memories (SPMs) look like a best-compromise solution when taking into account performance, energy consumption and die area. The main ...
122
click to vote
AI
2006
Springer
15 years 2 months ago
2006
Springer
Branch-and-bound and branch-and-cut use search trees to identify optimal solutions to combinatorial optimization problems. In this paper, we introduce an iterative search strategy...