Sciweavers

438 search results - page 27 / 88
» Pervasive Theory of Memory
Sort
View
FLAIRS
2003
14 years 11 months ago
Hybrid Deletion Policies for Case Base Maintenance
Case memory maintenance in a Case-Based Reasoning system is important for two main reasons: (1) to control the case memory size; (2) to reduce irrelevant and redundant instances t...
Maria Salamó, Elisabet Golobardes
POPL
2009
ACM
15 years 10 months ago
Relaxed memory models: an operational approach
Memory models define an interface between programs written in some language and their implementation, determining which behaviour the memory (and thus a program) is allowed to hav...
Gérard Boudol, Gustavo Petri
STOC
2004
ACM
129views Algorithms» more  STOC 2004»
15 years 10 months ago
Sorting and searching in the presence of memory faults (without redundancy)
We investigate the design of algorithms resilient to memory faults, i.e., algorithms that, despite the corruption of some memory values during their execution, are able to produce...
Irene Finocchi, Giuseppe F. Italiano
ISAAC
2009
Springer
114views Algorithms» more  ISAAC 2009»
15 years 4 months ago
Good Programming in Transactional Memory
Abstract. In a multicore transactional memory (TM) system, concurrent execution threads interact and interfere with each other through shared memory. The less interference a progra...
Raphael Eidenbenz, Roger Wattenhofer
COLT
2006
Springer
15 years 1 months ago
Memory-Limited U-Shaped Learning
U-shaped learning is a learning behaviour in which the learner first learns a given target behaviour, then unlearns it and finally relearns it. Such a behaviour, observed by psych...
Lorenzo Carlucci, John Case, Sanjay Jain, Frank St...