Sciweavers

2186 search results - page 64 / 438
» Considering an Organization's Memory
Sort
View
ICANN
1997
Springer
14 years 1 months ago
Recurrent Associative Memory Network of Nonlinear Coupled Oscillators
Abstract. The recurrent associative memory networks with complexvalued Hebbian matrices of connections are designed from interacting limitcycle oscillators. These oscillatory netwo...
Margarita Kuzmina, Eduard A. Manykin, Irina Surina
OPODIS
2008
13 years 10 months ago
With Finite Memory Consensus Is Easier Than Reliable Broadcast
We consider asynchronous distributed systems with message losses and process crashes. We study the impact of finite process memory on the solution to consensus, repeated consensus ...
Carole Delporte-Gallet, Stéphane Devismes, ...
OPODIS
2003
13 years 10 months ago
Decoupled Interconnection of Distributed Memory Models
In this paper we present a framework to formally describe and study the interconnection of distributed shared memory systems. In our models we minimize the dependencies between the...
Ernesto Jiménez, Antonio Fernández, ...
CORR
2004
Springer
121views Education» more  CORR 2004»
13 years 8 months ago
Worst-Case Optimal Tree Layout in a Memory Hierarchy
Consider laying out a fixed-topology tree of N nodes into external memory with block size B so as to minimize the worst-case number of block memory transfers required to traverse ...
Erik D. Demaine, John Iacono, Stefan Langerman
ICALP
2007
Springer
14 years 3 months ago
Deterministic History-Independent Strategies for Storing Information on Write-Once Memories
Motivated by the challenging task of designing “secure” vote storage mechanisms, we study information storage mechanisms that operate in extremely hostile environments. In suc...
Tal Moran, Moni Naor, Gil Segev