Sciweavers

1663 search results - page 229 / 333
» Compositional Service Trees
Sort
View
PERCOM
2011
ACM
14 years 6 months ago
Market mechanisms for Value of Information driven resource allocation in Sensor Networks
—This paper examines the possible uses of different market mechanisms for resource allocation at different levels of Wireless Sensor Network (WSN) architecture. The goal is to ma...
Boleslaw K. Szymanski, S. Yousaf Shah, Sahin Cem G...
PDCAT
2007
Springer
15 years 8 months ago
Two Tree-Based Algorithms for Network Spare Capacity Design
Abstract. Survivable network design has become increasingly important due to the need for reliable communication service. Its main purpose is to provide cost-efficient spare capaci...
Hovhannes A. Harutyunyan, Calin D. Morosan, Yunzan...
GECCO
2009
Springer
143views Optimization» more  GECCO 2009»
15 years 9 months ago
Exploiting hierarchical clustering for finding bounded diameter minimum spanning trees on euclidean instances
The bounded diameter minimum spanning tree problem is an NP-hard combinatorial optimization problem arising, for example, in network design when quality of service is of concern. ...
Martin Gruber, Günther R. Raidl
IFIP
2004
Springer
15 years 7 months ago
Efficient Protocols for Computing the Optimal Swap Edges of a Shortest Path Tree
We consider the problem of computing the optimal swap edges of a shortest-path tree. This theoretical problem arises in practice in systems that offer point-offailure shortest-path...
Paola Flocchini, Antonio Mesa Enriques, Linda Pagl...
HICSS
2008
IEEE
119views Biometrics» more  HICSS 2008»
15 years 9 months ago
Tree Mining in Mental Health Domain
The number of mentally ill people is increasing globally each year. Despite major medical advances, the identification of genetic and environmental factors responsible for mental ...
Maja Hadzic, Fedja Hadzic, Tharam S. Dillon