Sciweavers

5793 search results - page 236 / 1159
» Individual communication complexity
Sort
View
EUC
2006
Springer
15 years 10 months ago
Scalable Message Routing for Mobile Software Assistants
In this paper we define an algorithm for location-independent communication of mobile software Personal Assistants (PAs). The algorithm extends the Query Server with Caching algor...
Pawel T. Wojciechowski
170
Voted
JSA
2007
123views more  JSA 2007»
15 years 6 months ago
Application of deterministic and stochastic Petri-Nets for performance modeling of NoC architectures
The design of appropriate communication architectures for complex Systems-on-Chip (SoC) is a challenging task. One promising alternative to solve these problems are Networks-on-Ch...
Holger Blume, Thorsten von Sydow, Daniel Becker, T...
CORR
2000
Springer
116views Education» more  CORR 2000»
15 years 6 months ago
Algorithmic Statistics
While Kolmogorov complexity is the accepted absolute measure of information content of an individual finite object, a similarly absolute notion is needed for the relation between a...
Péter Gács, John Tromp, Paul M. B. V...
ICRA
2009
IEEE
185views Robotics» more  ICRA 2009»
16 years 1 months ago
Ad-hoc wireless network coverage with networked robots that cannot localize
— We study a fully distributed, reactive algorithm for deployment and maintenance of a mobile communication backbone that provides an area around a network gateway with wireless ...
Nikolaus Correll, Jonathan Bachrach, Daniel Vicker...
166
Voted
ESCIENCE
2005
IEEE
16 years 7 days ago
Flexible IO Services in the Kepler Grid Workflow System
Existing Grid workflow tools assume that individual components either communicate by passing files from one application to another, or are explicitly linked using interprocess com...
David Abramson, Jagan Kommineni, Ilkay Altintas