613 search results - page 44 / 123 » The Memory Fragmentation Problem: Solved |
135
Voted
KR
2004
Springer
15 years 8 months ago
2004
Springer
Recent work shows that the memory requirements of bestfirst heuristic search can be reduced substantially by using a divide-and-conquer method of solution reconstruction. We show...
166
Voted
EMMCVPR
2011
Springer
14 years 2 months ago
2011
Springer
Abstract. This paper proposes an algorithm for image segmentation using GraphCuts which can be used to efficiently solve labeling problems on high resolution images or resource-lim...
109
Voted
EUROGP
2003
Springer
15 years 7 months ago
2003
Springer
Test programs are fragment of code, but, unlike ordinary application programs, they are not intended to solve a problem, nor to calculate a function. Instead, they are supposed to ...
116
Voted
WCRE
1998
IEEE
15 years 6 months ago
1998
IEEE
Types are a good starting point for various software reengineering tasks. Unfortunately, programs requiring reengineering most desperately are written in languages without an adeq...
126
click to vote
CMOT
2006
15 years 2 months ago
2006
A procedure is described for finding sets of key players in a social network. A key assumption is that the optimal selection of key players depends on what they are needed for. Acc...