Sciweavers

467 search results - page 80 / 94
» Event-triggered distributed optimization in sensor networks
Sort
View
CEC
2005
IEEE
15 years 5 months ago
Modeling and analysis of indirect communication in particle swarm optimization
Abstract- Particle Swarm Optimization (PSO) has successfully been applied to many optimization problems. One particularly interesting aspect of these algorithms is to study the com...
S. Helwig, Christian Haubelt, Jürgen Teich
MOBICOM
2004
ACM
15 years 5 months ago
Revisiting the TTL-based controlled flooding search: optimality and randomization
In this paper we consider the problem of searching for a node or an object (i.e., piece of data, file, etc.) in a large network. Applications of this problem include searching fo...
Nicholas B. Chang, Mingyan Liu
DC
2010
14 years 12 months ago
An optimal maximal independent set algorithm for bounded-independence graphs
We present a novel distributed algorithm for the maximal independent set (MIS) problem.1 On bounded-independence graphs (BIG) our deterministic algorithm finishes in O(log n) time,...
Johannes Schneider, Roger Wattenhofer
DIALM
2007
ACM
178views Algorithms» more  DIALM 2007»
15 years 3 months ago
Near-Optimal Compression of Probabilistic Counting Sketches for Networking Applications
Sketches--data structures for probabilistic, duplicate insensitive counting--are central building blocks of a number of recently proposed network protocols, for example in the con...
Björn Scheuermann, Martin Mauve
DMTCS
2010
146views Mathematics» more  DMTCS 2010»
14 years 9 months ago
Tight Bounds for Delay-Sensitive Aggregation
This paper studies the fundamental trade-off between communication cost and delay cost arising in various contexts such as control message aggregation or organization theory. An o...
Yvonne Anne Pignolet, Stefan Schmid, Roger Wattenh...