Sciweavers

1941 search results - page 54 / 389
» On Generalizations of Network Design Problems with Degree Bo...
Sort
View
JGAA
2006
127views more  JGAA 2006»
14 years 9 months ago
A New Algorithm for Finding Minimal Cycle-Breaking Sets of Turns in a Graph
We consider the problem of constructing a minimal cycle-breaking set of turns for a given undirected graph. This problem is important for deadlock-free wormhole routing in compute...
Lev B. Levitin, Mark G. Karpovsky, Mehmet Mustafa,...
COR
2007
108views more  COR 2007»
14 years 9 months ago
A hub location problem with fully interconnected backbone and access networks
This paper considers the design of two-layered fully interconnected networks.A two-layered network consists of clusters of nodes, each defining an access network and a backbone n...
Tommy Thomadsen, Jesper Larsen
WCNC
2010
IEEE
14 years 8 months ago
Robust Relay Precoder Design for MIMO-Relay Networks
Abstract—In this paper, we consider a robust design of MIMOrelay precoder and receive filter for the destination nodes in a non-regenerative multiple-input multiple-output (MIMO...
P. Ubaidulla, Ananthanarayanan Chockalingam
ISCAS
2005
IEEE
138views Hardware» more  ISCAS 2005»
15 years 3 months ago
Transition time bounded low-power clock tree construction
— Recently power becomes a significant issue in clock network design for high-performance ICs because the clock network consumes a large portion of the total power in the whole s...
Min Pan, Chris C. N. Chu, J. Morris Chang
INFOCOM
2009
IEEE
15 years 4 months ago
Trap Coverage: Allowing Coverage Holes of Bounded Diameter in Wireless Sensor Networks
—Tracking of movements such as that of people, animals, vehicles, or of phenomena such as fire, can be achieved by deploying a wireless sensor network. So far only prototype sys...
Paul Balister, Zizhan Zheng, Santosh Kumar, Prasun...