3202 search results - page 470 / 641 » Memory access scheduling |
SODA
2008
ACM
13 years 9 months ago
2008
ACM
Sleator and Tarjan [39] conjectured that splay trees are dynamically optimal binary search trees (BST). In this context, we study the skip list data structure introduced by Pugh [...
FAST
2004
13 years 9 months ago
2004
MEMS-based storage devices (MEMStores) are significantly different from both disk drives and semiconductor memories. The differences motivate the queswhether they need new abstrac...
DAGSTUHL
2003
13 years 9 months ago
2003
We embodied networks of cultured biological neurons in simulation and in robotics. This is a new research paradigm to study learning, memory, and information processing in real tim...
SIROCCO
2001
13 years 9 months ago
2001
The condition-based approach for consensus solvability (that we have introduced in a previous paper, ACM STOC'01) consists in identifying sets of input vectors for which it i...
PDPTA
2003
13 years 9 months ago
2003
This paper investigates the protocol overhead pipelining between the host and network interface card (NIC). Existing researches into the protocol overhead pipelining assume that p...