Sciweavers

459 search results - page 56 / 92
» Approximation Algorithms for Buy-at-Bulk Geometric Network D...
Sort
View
IWSOS
2011
Springer
12 years 11 months ago
Evolving Self-organizing Cellular Automata Based on Neural Network Genotypes
Abstract This paper depicts and evaluates an evolutionary design process for generating a complex self-organizing multicellular system based on Cellular Automata (CA). We extend th...
Wilfried Elmenreich, István Fehérv&a...
INFOCOM
2010
IEEE
13 years 7 months ago
MIMO-Aware Routing in Wireless Mesh Networks
Abstract—Multiple-input and multiple-output (MIMO) technique is considered as one of the most promising emerging wireless technologies that can significantly improve transmissio...
Shan Chu, Xin Wang
STOC
2003
ACM
133views Algorithms» more  STOC 2003»
14 years 9 months ago
A fast algorithm for computing steiner edge connectivity
Given an undirected graph or an Eulerian directed graph G and a subset S of its vertices, we show how to determine the edge connectivity C of the vertices in S in time O(C3 n log ...
Richard Cole, Ramesh Hariharan
MOBICOM
2006
ACM
14 years 2 months ago
On the complexity of scheduling in wireless networks
We consider the problem of throughput-optimal scheduling in wireless networks subject to interference constraints. We model the interference using a family of K-hop interference m...
Gaurav Sharma, Ravi R. Mazumdar, Ness B. Shroff
CORR
2008
Springer
141views Education» more  CORR 2008»
13 years 8 months ago
Truthful Unsplittable Flow for Large Capacity Networks
The unsplittable flow problem is one of the most extensively studied optimization problems in the field of networking. An instance of it consists of an edge capacitated graph and ...
Yossi Azar, Iftah Gamzu, Shai Gutner