613 search results - page 18 / 123 » The Memory Fragmentation Problem: Solved |
122
click to vote
HEURISTICS
2002
15 years 2 months ago
2002
Neighborhood search heuristics like local search and its variants are some of the most popular approaches to solve discrete optimization problems of moderate to large size. Apart ...
130
click to vote
COGSCI
2010
15 years 2 months ago
2010
With only two to five slots of visual working memory (VWM), humans are able to quickly solve complex visual problems to near optimal solutions. To explain the paradox between tigh...
140
Voted
ISCA
1996
IEEE
15 years 6 months ago
1996
IEEE
Memory latency is an important bottleneck in system performance that cannot be adequately solved by hardware alone. Several promising software techniques have been shown to addres...
121
click to vote
AIML
2006
15 years 3 months ago
2006
Dynamic topological logics are combinations of topological and temporal modal logics that are used for reasoning about dynamical systems consisting of a topological space and a con...
135
Voted
LICS
2010
IEEE
15 years 28 days ago
2010
IEEE
We define tree automata with global constraints (TAGC), generalizing the well-known class of tree automata with global equality and disequality constraints [14] (TAGED). TAGC can...