277 search results - page 42 / 56 » The saga of minimum spanning trees |
LCN
2006
IEEE
15 years 4 months ago
2006
IEEE
— In this paper, we present a distributed computing framework designed to support higher quality of service and fault tolerance for processing deadline-driven tasks in a P2P envi...
DCC
2001
IEEE
15 years 9 months ago
2001
IEEE
We consider the problem of compressing graphs of the link structure of the World Wide Web. We provide efficient algorithms for such compression that are motivated by recently prop...
EH
2005
IEEE
15 years 3 months ago
2005
IEEE
In this paper we describe novel metrics measuring complexity in self-organising networks. The metrics are investigated within the context of decentralised inspections, developed a...
ICRA
2005
IEEE
15 years 3 months ago
2005
IEEE
Abstract - This paper presents an improvement over a previous contour closure algorithm. Assuming that edge points are given as input, the proposed approach consists of two steps. ...
SIGECOM
2003
ACM
15 years 3 months ago
2003
ACM
We study mechanisms that can be modelled as coalitional games with transferable utilities, and apply ideas from mechanism design and game theory to problems arising in a network d...