Sciweavers

231 search results - page 45 / 47
» A Case Study on Moves and Mergers
Sort
View
SIROCCO
2008
13 years 9 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...
PDPTA
2004
13 years 9 months ago
Efficient Disk Replacement and Data Migration Algorithms for Large Disk Subsystems
Random data placement has recently emerged as an alternative to traditional data striping. From a performance perspective, it has been demonstrated to be an efficient and scalable...
Roger Zimmermann, Beomjoo Seo
PARCO
1997
13 years 9 months ago
Scheduling Block-Cyclic Array Redistribution
This article is devoted to the run-time redistribution of arrays that are distributed in a blockcyclic fashion over a multidimensional processor grid. While previous studies have ...
Frederic Desprez, Jack Dongarra, Antoine Petitet, ...
CGF
2010
144views more  CGF 2010»
13 years 8 months ago
Dynamic Multi-View Exploration of Shape Spaces
Statistical shape modeling is a widely used technique for the representation and analysis of the shapes and shape variations present in a population. A statistical shape model mod...
Stef Busking, Charl P. Botha, Frits H. Post
CCR
2004
90views more  CCR 2004»
13 years 7 months ago
A constraint satisfaction approach to testbed embedding services
Today's networking community is becoming increasingly skeptical of the significance of research results founded wholly upon experimental results conducted in simulation. Now, ...
Jeffrey Considine, John W. Byers, Ketan Meyer-Pate...