Theilmann, W. and Rothermel, K. "Efficient Dissemination of Mobile Agents". In Proceedings of the 19th International Conference on Distributed Systems Workshop, Austin, TX, USA, May 31 - June 5, 1999 Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Dynamic Distance Maps of the Internet - Theilmann, Rothermel (2000) (33 citations) Self-citation (Theilmann Rothermel) (Correct)
....in O(n 2 log n) with n = jMj) with an algorithm that is similar to the standard algorithm for computing minimum cost spanning trees. The main difference is that the algorithm already stops when a forest of k minimum spanning sub trees is achieved. Details on this algorithm can be found in [14]. A Max k Cut maximizes the average distance between any two clusters, i.e. maximizes the expression X i;j2[1: k] i j X x2C i y2C j (x; y) It is NP complete to optimize and the best known approximation ratio [15] is 1= 1 1=k 2 ln k=k 2 ) which is rather bad if we consider that a ....
W. Theilmann, K. Rothermel, "Efficient Dissemination of Mobile Agents," Proc. 19th IEEE Int. Conf. on Distributed Computing Systems Workshop (ICDCSW'99), IEEE Computer Society, May 1999, pp. 9--14
Evaluation of Migration Strategies for Mobile Agents in - Network Routing Sergio (Correct)
No context found.
Theilmann, W. and Rothermel, K. "Efficient Dissemination of Mobile Agents". In Proceedings of the 19th International Conference on Distributed Systems Workshop, Austin, TX, USA, May 31 - June 5, 1999
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC