Sciweavers

1199 search results - page 97 / 240
» Graph Theory
Sort
View
MOBIWAC
2006
ACM
15 years 10 months ago
Quick convergecast in ZigBee/IEEE 802.15.4 tree-based wireless sensor networks
Convergecast is a fundamental operation in wireless sensor networks. Existing convergecast solutions have focused on reducing latency and energy consumption. However, a good desig...
Yu-Chee Tseng, Meng-Shiuan Pan
MST
2010
187views more  MST 2010»
14 years 10 months ago
Distributed Approximation of Capacitated Dominating Sets
We study local, distributed algorithms for the capacitated minimum dominating set (CapMDS) problem, which arises in various distributed network applications. Given a network graph...
Fabian Kuhn, Thomas Moscibroda
APN
2007
Springer
15 years 10 months ago
A Compositional Method for the Synthesis of Asynchronous Communication Mechanisms
Asynchronous data communication mechanisms (ACMs) have been extensively studied as data connectors between independently timed concurrent processes. In previous work, an automatic ...
Kyller Costa Gorgônio, Jordi Cortadella, Fei...
SCP
2002
112views more  SCP 2002»
15 years 3 months ago
Formal agent-oriented modeling with UML and graph transformation
The agent paradigm can be seen as an extension of the notion of (active) objects by concepts like autonomy and cooperation. Mainstream object-oriented modeling techniques do not a...
Ralph Depke, Reiko Heckel, Jochen Malte Küste...
SODA
2010
ACM
261views Algorithms» more  SODA 2010»
16 years 1 months ago
Bidimensionality and Kernels
Bidimensionality theory appears to be a powerful framework in the development of meta-algorithmic techniques. It was introduced by Demaine et al. [J. ACM 2005 ] as a tool to obtai...
Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, ...