Sciweavers

683 search results - page 23 / 137
» Graph Annotations in Modeling Complex Network Topologies
Sort
View
ESA
2004
Springer
97views Algorithms» more  ESA 2004»
15 years 5 months ago
Radio Network Clustering from Scratch
Abstract. We propose a novel randomized algorithm for computing a dominating set based clustering in wireless ad-hoc and sensor networks. The algorithm works under a model which ca...
Fabian Kuhn, Thomas Moscibroda, Roger Wattenhofer
IWPC
2010
IEEE
14 years 10 months ago
DepDigger: A Tool for Detecting Complex Low-Level Dependencies
We present a tool that identifies complex data-flow dependencies on code-level, based on the measure dep-degree. Low-level dependencies between program operations are modeled by...
Dirk Beyer, Ashgan Fararooy
PAM
2005
Springer
15 years 5 months ago
Revisiting Internet AS-Level Topology Discovery
Abstract. The development of veracious models of the Internet topology has received a lot of attention in the last few years. Many proposed models are based on topologies derived f...
Xenofontas A. Dimitropoulos, Dmitri V. Krioukov, G...
ATAL
2005
Springer
15 years 5 months ago
Modeling complex multi-issue negotiations using utility graphs
This paper presents an agent strategy for complex bilateral negotiations over many issues with inter-dependent valuations. We use ideas inspired by graph theory and probabilistic ...
Valentin Robu, D. J. A. Somefun, Johannes A. La Po...
MOBICOM
2006
ACM
15 years 5 months ago
On the complexity of scheduling in wireless networks
We consider the problem of throughput-optimal scheduling in wireless networks subject to interference constraints. We model the interference using a family of K-hop interference m...
Gaurav Sharma, Ravi R. Mazumdar, Ness B. Shroff