Sciweavers

270 search results - page 46 / 54
» Partitioning into Sets of Bounded Cardinality
Sort
View
ICDCSW
2005
IEEE
14 years 1 months ago
Cluster-Based Intelligent Searching in Unstructured Peer-to-Peer Networks
Existing cluster-based searching schemes in unstructured peer-to-peer (P2P) networks employ flooding/random forwarding on connected dominating sets (CDS) of networks. There exist...
Xiuqi Li, Jie Wu
ISPA
2004
Springer
14 years 27 days ago
An Enhanced Message Exchange Mechanism in Cluster-Based Mobile Ad Hoc Networks
Abstract. In mobile ad hoc networks (MANETs), networks can be partitioned into clusters. Clustering algorithms are localized algorithms that have the property of creating an upper ...
Wei Lou, Jie Wu
ATAL
2010
Springer
13 years 8 months ago
Coalition structure generation in multi-agent systems with mixed externalities
Coalition structure generation (CSG) for multi-agent systems is a well-studied problem. A vast majority of the previous work and the state-of-the-art approaches to CSG assume a ch...
Bikramjit Banerjee, Landon Kraemer
DMSN
2007
ACM
13 years 11 months ago
SenseSwarm: a perimeter-based data acquisition framework for mobile sensor networks
This paper assumes a set of n mobile sensors that move in the Euclidean plane as a swarm1 . Our objectives are to explore a given geographic region by detecting and aggregating sp...
Demetrios Zeinalipour-Yazti, Panayiotis Andreou, P...
STOC
2003
ACM
90views Algorithms» more  STOC 2003»
14 years 7 months ago
Work-competitive scheduling for cooperative computing with dynamic groups
The problem of cooperatively performing a set of t tasks in a decentralized setting where the computing medium is subject to failures is one of the fundamental problems in distrib...
Chryssis Georgiou, Alexander Russell, Alexander A....