Sciweavers

4171 search results - page 453 / 835
» Distributed Data Structure Design for Scientific Computation
Sort
View
SODA
2001
ACM
108views Algorithms» more  SODA 2001»
15 years 8 months ago
Entropy-preserving cuttings and space-efficient planar point location
Point location is the problem of preprocessing a planar polygonal subdivision S into a data structure in order to determine efficiently the cell of the subdivision that contains a...
Sunil Arya, Theocharis Malamatos, David M. Mount
ICRA
2010
IEEE
79views Robotics» more  ICRA 2010»
15 years 5 months ago
Robot pebbles: One centimeter modules for programmable matter through self-disassembly
— This paper describes the design, fabrication, and experimental results of a programmable matter system capable of 2D shape formation through subtraction. The system is composed...
Kyle Gilpin, Ara Knaian, Daniela Rus
GLOBAL
2003
Springer
16 years 2 days ago
The Klaim Project: Theory and Practice
Klaim (Kernel Language for Agents Interaction and Mobility) is an experimental language specifically designed to program distributed systems consisting of several mobile component...
Lorenzo Bettini, Viviana Bono, Rocco De Nicola, Gi...
AUTONOMICS
2009
ACM
16 years 1 months ago
A Generic Agent Organisation Framework for Autonomic Systems
Abstract. Autonomic computing is being advocated as a tool for managing large, complex computing systems. Specifically, self-organisation provides a suitable approach for developi...
Ramachandra Kota, Nicholas Gibbins, Nicholas R. Je...
INFOCOM
2012
IEEE
13 years 9 months ago
Fair background data transfers of minimal delay impact
—In this paper we present a methodology for the design of congestion control protocols for background data transfers that have a minimal delay impact on short TCP transfers and c...
Costas Courcoubetis, Antonis Dimakis