Sciweavers

2519 search results - page 146 / 504
» Martingales and Locality in Distributed Computing
Sort
View
ICCS
2005
Springer
14 years 3 months ago
The Dynamics of Computing Agent Systems
The paper presents the Multi Agent System (MAS) designed for the large scale parallel computations. The special kind of diffusionbased scheduling enables to decompose and allocate...
Maciej Smolka, Piotr Uhruski, Robert Schaefer, Mar...
IPPS
2003
IEEE
14 years 3 months ago
Transparent Distributed Threads for Java
Remote method invocation in Java RMI allows the flow of control to pass across local Java threads and thereby span multiple virtual machines. However, the resulting distributed t...
Bernhard Haumacher, Thomas Moschny, Jürgen Re...
SENSYS
2006
ACM
14 years 4 months ago
StarDust: a flexible architecture for passive localization in wireless sensor networks
The problem of localization in wireless sensor networks where nodes do not use ranging hardware, remains a challenging problem, when considering the required location accuracy, en...
Radu Stoleru, Pascal Vicaire, Tian He, John A. Sta...
APPROX
2010
Springer
168views Algorithms» more  APPROX 2010»
13 years 11 months ago
Lower Bounds for Local Monotonicity Reconstruction from Transitive-Closure Spanners
Abstract. Given a directed graph G = (V, E) and an integer k 1, a ktransitive-closure-spanner (k-TC-spanner) of G is a directed graph H = (V, EH ) that has (1) the same transitive...
Arnab Bhattacharyya, Elena Grigorescu, Madhav Jha,...
CLUSTER
2008
IEEE
14 years 4 months ago
Empirical-based probabilistic upper bounds for urgent computing applications
—Scientific simulation and modeling often aid in making critical decisions in such diverse fields as city planning, severe weather prediction and influenza modeling. In some o...
Nick Trebon, Peter H. Beckman