613 search results - page 16 / 123 » The Memory Fragmentation Problem: Solved |
138
click to vote
RTCSA
2005
IEEE
15 years 8 months ago
2005
IEEE
Most prior theoretical research on partitioning algorithms for real-time multiprocessor platforms has focused on ensuring that the cumulative computing requirements of the tasks a...
147
click to vote
ADC
2008
Springer
15 years 8 months ago
2008
Springer
Existing graph mining algorithms typically assume that the dataset can fit into main memory. As many large graph datasets cannot satisfy this condition, truly scalable graph minin...
109
click to vote
DISOPT
2006
15 years 2 months ago
2006
We propose an effective heuristic to save memory in dynamic programming on tree decompositions when solving graph optimization problems. The introduced "anchor technique"...
150
click to vote
ECRTS
2004
IEEE
15 years 6 months ago
2004
IEEE
Dynamic storage allocation (DSA) algorithms play an important role in the modern software engineering paradigms and techniques (such as object oriented programming). Using DSA inc...
111
click to vote
GPCE
2005
Springer
15 years 8 months ago
2005
Springer
Abstract. In meta programming with concrete object syntax, object-level programs are composed from fragments written in concrete syntax. The use of small program fragments in such ...