Sciweavers

358 search results - page 44 / 72
» On the Distributed Complexity of Computing Maximal Matchings
Sort
View
PODC
2005
ACM
15 years 7 months ago
On the locality of bounded growth
Many large-scale networks such as ad hoc and sensor networks, peer-to-peer networks, or the Internet have the property that the number of independent nodes does not grow arbitrari...
Fabian Kuhn, Thomas Moscibroda, Roger Wattenhofer
MOBIHOC
2007
ACM
16 years 1 months ago
Approximation algorithms for longest-lived directional multicast communications in WANETs
Several centralized and distributed algorithms have been recently proposed to maximize the multicast lifetime for directional communications in wireless ad-hoc networks. Their per...
Song Guo, Oliver W. W. Yang, Victor C. M. Leung
MIDDLEWARE
2009
Springer
15 years 8 months ago
Rhizoma: A Runtime for Self-deploying, Self-managing Overlays
Abstract. The trend towards cloud and utility computing infrastructures raises challenges not only for application development, but also for management: diverse resources, changing...
Qin Yin, Adrian Schüpbach, Justin Cappos, And...
ICS
2003
Tsinghua U.
15 years 7 months ago
Roccom: an object-oriented, data-centric software integration framework for multiphysics simulations
We describe an object-oriented software integration frameccom, abstracted from our five years of experience in developing a complex, integrated code for rocket simulation. Roccom...
Xiangmin Jiao, Michael T. Campbell, Michael T. Hea...
IPPS
1998
IEEE
15 years 6 months ago
Hyper Butterfly Network: A Scalable Optimally Fault Tolerant Architecture
Boundeddegreenetworks like deBruijn graphsor wrapped butterfly networks are very important from VLSI implementation point of view as well as for applications where the computing n...
Wei Shi, Pradip K. Srimani