613 search results - page 4 / 123 » The Memory Fragmentation Problem: Solved |
ASPLOS
2000
ACM
14 years 3 months ago
2000
ACM
Parallel, multithreaded C and C++ programs such as web servers, database managers, news servers, and scientific applications are becoming increasingly prevalent. For these applic...
AAAI
1998
14 years 6 days ago
1998
Probabilistic planning algorithms seek e ective plans for large, stochastic domains. maxplan is a recently developed algorithm that converts a planning problem into an E-Majsat pr...
IJCAI
1993
14 years 5 days ago
1993
Whilst much emphasis in AI has been placed on the use of goals in problem solving, less emphasis has been placed on the role of perception and experience. In this paper we show th...
CONCUR
2011
Springer
12 years 10 months ago
2011
Springer
Abstract. In 2004, Berdine, Calcagno and O’Hearn introduced a fragment of separation logic that allows for reasoning about programs with pointers and linked lists. They showed th...
CORR
2010
Springer
13 years 10 months ago
2010
Springer
Abstract. The paper investigates a novel approach, based on Constraint Logic Programming (CLP), to predict the 3D conformation of a protein via fragments assembly. The fragments ar...