Sciweavers

1663 search results - page 141 / 333
» Compositional Service Trees
Sort
View
142
Voted
WDAG
2001
Springer
107views Algorithms» more  WDAG 2001»
15 years 8 months ago
Self-Stabilizing Minimum Spanning Tree Construction on Message-Passing Networks
Self-stabilizing algorithms for constructing a spanning tree of an arbitrary network have been studied for many models of distributed networks including those that communicate via ...
Lisa Higham, Zhiying Liang
123
Voted
AINTEC
2007
Springer
15 years 9 months ago
Quality-of-Service Multicast Overlay Spanning Tree Algorithms for Wireless Ad Hoc Networks
In this article, we explore modified versions of Multicast Overlay Spanning Tree algorithms (MOST) to support quality of service for wireless ad hoc networks. These algorithms (Q-...
Georgios Rodolakis, Cedric Adjih, Anis Laouiti, Sa...
119
Voted
ECMDAFA
2005
Springer
181views Hardware» more  ECMDAFA 2005»
15 years 9 months ago
Transformations Between UML and OWL-S
As the number of available Web services increases there is a growing demand to realize complex business processes by combining and reusing available Web services. The reuse and com...
Roy Grønmo, Michael C. Jaeger, Hjørd...
121
Voted
ICDCS
1999
IEEE
15 years 8 months ago
On Providing Quality-of-Service Control for Core-Based Multicast Routing
In this paper, we develop e cient admission control tests for member join leave and its associated state refresh and update procedures for receiver-initiated core-based multicast ...
Hung-Ying Tyan, Chao-Ju Hou, Bin Wang 0002
134
Voted
SAC
2008
ACM
15 years 3 months ago
Towards self-configuration and management of e-service provisioning in dynamic value constellations
Networked value constellations are collections of enterprises that jointly satify complex consumer needs. Increasingly, such needs are satisfied by e-services, i.e. commercial ser...
Jaap Gordijn, Hans Weigand, Manfred Reichert, Roel...