613 search results - page 24 / 123 » The Memory Fragmentation Problem: Solved |
168
click to vote
ISCA
1993
IEEE
15 years 6 months ago
1993
IEEE
Advances in circuit and integration technology are continuously boosting the speed of microprocessors. One of the main challenges presented by such developments is the effective u...
112
click to vote
SPAA
2010
ACM
15 years 7 months ago
2010
ACM
The aim of rendezvous in a graph is meeting of two mobile agents at some node of an unknown anonymous connected graph. The two identical agents start from arbitrary nodes in the g...
147
Voted
AAAI
2004
15 years 3 months ago
2004
A memory-based heuristic is a heuristic function that is stored in a lookup table. Very accurate heuristics have been created by building very large lookup tables, sometimes calle...
105
click to vote
CASES
2006
ACM
15 years 8 months ago
2006
ACM
Memory size reduction and memory accesses optimization are crucial issues for embedded systems. In the context of affine programs, these two challenges are classically tackled by ...
117
click to vote
LPAR
2005
Springer
15 years 8 months ago
2005
Springer
We propose to build an automated reasoning system for first-order logic (FOL) by translating reasoning problems to a fragment of FOL called coherent logic (CL) and then solving t...