Sciweavers

11242 search results - page 133 / 2249
» Designing a Super-Peer Network
Sort
View
IPCO
1993
138views Optimization» more  IPCO 1993»
15 years 5 months ago
An efficient approximation algorithm for the survivable network design problem
The survivable network design problem (SNDP) is to construct a minimum-cost subgraph satisfying certain given edge-connectivity requirements. The first polynomial-time approximati...
Harold N. Gabow, Michel X. Goemans, David P. Willi...
FOCS
2008
IEEE
15 years 11 months ago
Degree Bounded Network Design with Metric Costs
Given a complete undirected graph, a cost function on edges and a degree bound B, the degree bounded network design problem is to find a minimum cost simple subgraph with maximum...
Yuk Hei Chan, Wai Shing Fung, Lap Chi Lau, Chun Ko...
IPSN
2005
Springer
15 years 10 months ago
Design of a wireless sensor network platform for detecting rare, random, and ephemeral events
— We present the design of the eXtreme Scale Mote, a new sensor network platform for reliably detecting and classifying, and quickly reporting, rare, random, and ephemeral events...
Prabal Dutta, Mike Grimmer, Anish Arora, Steven B....
WOWMOM
2005
ACM
173views Multimedia» more  WOWMOM 2005»
15 years 10 months ago
Design and Evaluation of iMesh: An Infrastructure-Mode Wireless Mesh Network
Abstract— Wireless mesh networks are multihop networks of wireless routers typically used for wireless coverage over a large community. Applications include community-scale peer-...
Vishnu Navda, Anand Kashyap, Samir R. Das
APPROX
2009
Springer
145views Algorithms» more  APPROX 2009»
15 years 11 months ago
Approximating Some Network Design Problems with Node Costs
We study several multi-criteria undirected network design problems with node costs and lengths. All these problems are related to the Multicommodity Buy at Bulk (MBB) problem in w...
Guy Kortsarz, Zeev Nutov