Sciweavers

833 search results - page 49 / 167
» Simpler and better approximation algorithms for network desi...
Sort
View
INFOCOM
2008
IEEE
14 years 2 months ago
Fast and Distributed Computation of Schedules in Wireless Networks
—In a wireless network with node exclusive spectrum sharing, two popular schedules are maximum weight matching (MWM) schedule and maximum size matching (MSM) schedule. The former...
Supratim Deb, Karan Mangla, K. V. M. Naidu
INFOCOM
2010
IEEE
13 years 6 months ago
A Systematic Approach for Evolving VLAN Designs
—Enterprise networks are large and complex, and their designs must be frequently altered to adapt to changing organizational needs. The process of redesigning and reconfiguring ...
Xin Sun, Yu-Wei Eric Sung, Sunil Krothapalli, Sanj...
EVOW
2001
Springer
14 years 8 days ago
An Evolutionary Algorithm with Stochastic Hill-Climbing for the Edge-Biconnectivity Augmentation Problem
Augmenting an existing network with additional links to achieve higher robustness and survivability plays an important role in network design. We consider the problem of augmenting...
Ivana Ljubic, Günther R. Raidl
HICSS
2003
IEEE
122views Biometrics» more  HICSS 2003»
14 years 1 months ago
On Reducing Broadcast Redundancy in Ad Hoc Wireless Networks
—Unlike in a wired network, a packet transmitted by a node in an ad hoc wireless network can reach all neighbors. Therefore, the total number of transmissions (forward nodes) is ...
Wei Lou, Jie Wu
STOC
2007
ACM
239views Algorithms» more  STOC 2007»
14 years 8 months ago
Approximating minimum bounded degree spanning trees to within one of optimal
In the MINIMUM BOUNDED DEGREE SPANNING TREE problem, we are given an undirected graph with a degree upper bound Bv on each vertex v, and the task is to find a spanning tree of min...
Mohit Singh, Lap Chi Lau