4781 search results - page 146 / 957 » Online algorithms for network design |
188
click to vote
IPPS
2009
IEEE
16 years 1 months ago
2009
IEEE
Graph-theoretic abstractions are extensively used to analyze massive data sets. Temporal data streams from socioeconomic interactions, social networking web sites, communication t...
167
click to vote
SENSYS
2005
ACM
16 years 3 days ago
2005
ACM
We consider configuration of wireless sensor networks, where certain functions must be automatically assigned to sensor nodes, such that the properties of a sensor node (e.g., rem...
197
click to vote
CISS
2008
IEEE
16 years 1 months ago
2008
IEEE
Abstract— We consider a joint randomized scheduling, congestion control mechanism for general wireless networks. We allow for a set of imperfections in the operation of the rando...
163
click to vote
CSE
2008
IEEE
15 years 8 months ago
2008
IEEE
In this work we present algorithms for Minimum Energy Consumption Broadcast Subgraph (MECBS) problem. First, we focus on designing distributed algorithms for MECBS. To our knowled...
169
click to vote
SODA
2010
ACM
16 years 3 months ago
2010
ACM
The group Steiner problem is a classical network design problem where we are given a graph and a collection of groups of vertices, and want to build a min-cost subgraph that conne...