Sciweavers

2555 search results - page 43 / 511
» Quantifiers and Working Memory
Sort
View
OPODIS
2003
14 years 11 months ago
Emulating Shared-Memory Do-All Algorithms in Asynchronous Message-Passing Systems
A fundamental problem in distributed computing is performing a set despite failures and delays. Stated abstractly, the problem is to perform N tasks using P failure-prone processor...
Dariusz R. Kowalski, Mariam Momenzadeh, Alexander ...
CGO
2007
IEEE
15 years 4 months ago
Isla Vista Heap Sizing: Using Feedback to Avoid Paging
Managed runtime environments (MREs) employ garbage collection (GC) for automatic memory management. However, GC induces pressure on the virtual memory (VM) manager, since it may t...
Chris Grzegorczyk, Sunil Soman, Chandra Krintz, Ri...
IPPS
2006
IEEE
15 years 4 months ago
A distributed paging RAM grid system for wide-area memory sharing
Memory-intensive applications often suffer from the poor performance of disk swapping when memory is inadequate. Remote memory sharing schemes, which provide a remote memory that ...
Rui Chu, Nong Xiao, Yongzhen Zhuang, Yunhao Liu, X...
GECCO
2005
Springer
150views Optimization» more  GECCO 2005»
15 years 3 months ago
Population-based incremental learning with memory scheme for changing environments
In recent years there has been a growing interest in studying evolutionary algorithms for dynamic optimization problems due to its importance in real world applications. Several a...
Shengxiang Yang
WMASH
2004
ACM
15 years 3 months ago
Proximity services supporting network virtual memory in mobile devices
Wireless networked embedded terminals like personal digital assistants, cell-phones or sensor nodes are typically memory constrained devices. This limitation prevents the developm...
Emanuele Lattanzi, Andrea Acquaviva, Alessandro Bo...