Sciweavers

613 search results - page 3 / 123
» The Memory Fragmentation Problem: Solved
Sort
View
WOTUG
2008
13 years 11 months ago
Solving the Santa Claus Problem: a Comparison of Various Concurrent Programming Techniques
Abstract. The Santa Claus problem provides an excellent exercise in concurrent programming and can be used to show the simplicity or complexity of solving problems using a particul...
Jason Hurt, Jan Bækgaard Pedersen
LOPSTR
2004
Springer
14 years 3 months ago
Graph-Based Proof Counting and Enumeration with Applications for Program Fragment Synthesis
For use in earlier approaches to automated module interface adaptation, we seek a restricted form of program synthesis. Given some typing assumptions and a desired result type, we ...
J. B. Wells, Boris Yakobowski
IAT
2006
IEEE
14 years 3 months ago
Toward Inductive Logic Programming for Collaborative Problem Solving
In this paper, we tackle learning in distributed systems and the fact that learning does not necessarily involve the participation of agents directly in the inductive process itse...
Jian Huang, Adrian R. Pearce
SODA
2012
ACM
174views Algorithms» more  SODA 2012»
12 years 6 days ago
Using hashing to solve the dictionary problem
We consider the dictionary problem in external memory and improve the update time of the wellknown buffer tree by roughly a logarithmic factor. For any λ ≥ max{lg lg n, logM/B(...
John Iacono, Mihai Patrascu
EVOW
2010
Springer
14 years 2 months ago
Memory Design for Constrained Dynamic Optimization Problems
A proposal for a memory design is given that is suitable for solving constrained dynamic optimization problems by an evolutionary m. Based on ideas from abstract memory, two scheme...
Hendrik Richter