613 search results - page 9 / 123 » The Memory Fragmentation Problem: Solved |
120
click to vote
CEC
2007
IEEE
15 years 6 months ago
2007
IEEE
Abstract-- Shotgun sequencing is the state-of-the-art to decode genome sequence. However this technique needs a lot of fragments. Combining those fragments correctly requires enorm...
191
click to vote
SOFTVIS
2010
ACM
15 years 2 months ago
2010
ACM
A programs memory system performance is one of the key determinants of its overall performance. Lack of understanding of a programs memory system behavior can lead to performance ...
136
click to vote
ASP
2005
Springer
15 years 8 months ago
2005
Springer
Despite all efforts on intelligent grounding, state-of-the-art answer set solvers still have huge memory requirements, because they compute the ground instantiation of the input pr...
103
click to vote
CPM
2003
Springer
15 years 7 months ago
2003
Springer
Given n fragments from k > 2 genomes, we will show how to find an optimal chain of colinear non-overlapping fragments in time O(n logk−2 n log log n) and space O(n logk−2 n...
145
click to vote
TSMC
2010
14 years 9 months ago
2010
The memory dumping problem arises in the context of planning and scheduling activities of the Mars Express mission of the European Space Agency. The problem consists of scheduling...