Sciweavers

654 search results - page 31 / 131
» An efficient approximation algorithm for the survivable netw...
Sort
View
INFOCOM
2005
IEEE
14 years 2 months ago
Interference-aware routing in multihop wireless networks using directional antennas
— Recent research has shown that interference can make a significant impact on the performance of multihop wireless networks. Researchers have studied interference-aware topolog...
Jian Tang, Guoliang Xue, Christopher Chandler, Wei...
APPROX
2006
Springer
124views Algorithms» more  APPROX 2006»
14 years 16 days ago
Combinatorial Algorithms for Data Migration to Minimize Average Completion Time
The data migration problem is to compute an efficient plan for moving data stored on devices in a network from one configuration to another. It is modeled by a transfer graph, wher...
Rajiv Gandhi, Julián Mestre
IJON
2007
98views more  IJON 2007»
13 years 8 months ago
Convergent design of piecewise linear neural networks
Piecewise linear networks (PLNs) are attractive because they can be trained quickly and provide good performance in many nonlinear approximation problems. Most existing design alg...
Hema Chandrasekaran, Jiang Li, W. H. Delashmit, Pr...
ESA
2004
Springer
126views Algorithms» more  ESA 2004»
14 years 2 months ago
Path Decomposition Under a New Cost Measure with Applications to Optical Network Design
We introduce a problem directly inspired by its application to DWDM (dense wavelength division multiplexing) network design. We are given a set of demands to be carried over a netw...
Elliot Anshelevich, Lisa Zhang
INFOCOM
2010
IEEE
13 years 6 months ago
Maintaining Approximate Minimum Steiner Tree and k-center for Mobile Agents in a Sensor Network
Abstract--We study the problem of maintaining group communication between m mobile agents, tracked and helped by n static networked sensors. We develop algorithms to maintain a O(l...
Dengpan Zhou, Jie Gao