Sciweavers

3394 search results - page 235 / 679
» A Modal Model of Memory
Sort
View
SIROCCO
2008
15 years 6 months ago
Remembering without Memory: Tree Exploration by Asynchronous Oblivious Robots
In the effort to understand the algorithmic limitations of computing by a swarm of robots, the research has focused on the minimal capabilities that allow a problem to be solved. ...
Paola Flocchini, David Ilcinkas, Andrzej Pelc, Nic...
ICIP
2004
IEEE
16 years 7 months ago
Rate-constrained adaptive fec for video over erasure channels with memory
Current adaptive FEC schemes used for video streaming applications alter the redundancy in a block of message packets to adapt to varying channel conditions. However, for many pop...
Shirish S. Karande, Hayder Radha
STOC
2005
ACM
164views Algorithms» more  STOC 2005»
16 years 5 months ago
Cooperative asynchronous update of shared memory
The Write-All problem for an asynchronous shared-memory system has the objective for the processes to update the contents of a set of shared registers, while minimizing the mber o...
Bogdan S. Chlebus, Dariusz R. Kowalski
ALGORITHMICA
2006
86views more  ALGORITHMICA 2006»
15 years 5 months ago
Slabpose Columnsort: A New Oblivious Algorithm for Out-of-Core Sorting on Distributed-Memory Clusters
Our goal is to develop a robust out-of-core sorting program for a distributed-memory cluster. The literature contains two dominant paradigms for out-of-core sorting algorithms: me...
Geeta Chaudhry, Thomas H. Cormen
IJCNN
2007
IEEE
15 years 11 months ago
Incorporating Forgetting in a Category Learning Model
— We present a computational model of human category learning that learns the essential structures of the categories by forgetting information that is not useful for the given ta...
Yasuaki Sakamoto, Toshihiko Matsuka