Sciweavers

2370 search results - page 117 / 474
» The Characterization of Data-Accumulating Algorithms
Sort
View
ADHOC
2005
125views more  ADHOC 2005»
14 years 9 months ago
Adaptive interpiconet scheduling for multipurpose scatternet scenarios
Bluetooth specification still has open issues, including the intra and interpiconet scheduling topics. This article proposes an interpiconet scheduling algorithm, referred to as A...
Werner Priess, José Ferreira de Rezende, Lu...
ATAL
2005
Springer
15 years 3 months ago
Towards a theory of "local to global" in distributed multi-agent systems (I)
There is a growing need for a theory of “local to global” in distributed multi-agent systems, one which is able systematically to describe and analyze a variety of problems. T...
Daniel Yamins
OOPSLA
1999
Springer
15 years 2 months ago
Compositional Pointer and Escape Analysis for Java Programs
This paper presents a combined pointer and escape analysis algorithm for Java programs. The algorithm is based on the abstraction of points-to escape graphs, which characterize ho...
John Whaley, Martin C. Rinard
WDAG
1997
Springer
78views Algorithms» more  WDAG 1997»
15 years 2 months ago
Genuine Atomic Multicast
This paper addresses the problem of atomic multicasting messages in asynchronous distributed systems. Firstly, we give a characterization of the notion of genuine atomic multicast...
Rachid Guerraoui, André Schiper
TALG
2008
67views more  TALG 2008»
14 years 9 months ago
Structure and linear-time recognition of 4-leaf powers
A graph G is the k-leaf power of a tree T if its vertices are leaves of T such that two vertices are adjacent in G if and only if their distance in T is at most k. Then T is a k-le...
Andreas Brandstädt, Van Bang Le, R. Sritharan