Sciweavers

1259 search results - page 11 / 252
» On Survivable Access Network Design: Complexity and Algorith...
Sort
View
113
Voted
BMCBI
2010
232views more  BMCBI 2010»
14 years 11 months ago
LucidDraw: Efficiently visualizing complex biochemical networks within MATLAB
Background: Biochemical networks play an essential role in systems biology. Rapidly growing network data and e research activities call for convenient visualization tools to aid i...
Sheng He, Juan Mei, Guiyang Shi, Zhengxiang Wang, ...
106
Voted
WICON
2008
15 years 1 months ago
A graph based routing algorithm for multi-hop cognitive radio networks
Cognitive radio networks that allow dynamic spectrum access are considered spectrally more efficient than networks using fixed spectral allocation. These networks are characterize...
Yogesh Reddy Kondareddy, Prathima Agrawal
TON
2010
157views more  TON 2010»
14 years 6 months ago
Random Access Game and Medium Access Control Design
We study the contention/interaction among wireless nodes and med -ium access control design in game theory framework. We define a general class of games, called random access game...
Lijun Chen, Steven H. Low, John C. Doyle
81
Voted
JAL
2002
71views more  JAL 2002»
14 years 11 months ago
A primal-dual schema based approximation algorithm for the element connectivity problem
The element connectivity problem falls in the category of survivable network design problems { it is intermediate to the versions that ask for edge-disjoint and vertex-disjoint pa...
Kamal Jain, Ion I. Mandoiu, Vijay V. Vazirani, Dav...
CATS
2007
15 years 1 months ago
Some Structural and Geometric Properties of Two-Connected Steiner Networks
We consider the problem of constructing a shortest Euclidean 2-connected Steiner network (SMN) for a set of terminals. This problem has natural applications in the design of survi...
K. Hvam, L. Reinhardt, Pawel Winter, Martin Zachar...