1432 search results - page 83 / 287 » Hardness of robust network design |
150
click to vote
ICDCN
2009
Springer
15 years 3 months ago
2009
Springer
Abstract. We define geometric self-structuring in a large-scale networked system as the ability of the participating nodes to collaboratively impose a geometric structure to the ne...
179
click to vote
PAM
2012
Springer
14 years 1 months ago
2012
Springer
Network administrators are faced with the increasingly challenging task of monitoring their network’s health in real time, drawing upon diverse and voluminous measurement data fe...
176
click to vote
IPPS
2010
IEEE
15 years 4 months ago
2010
IEEE
Local search (LS) algorithms are among the most powerful techniques for solving computationally hard problems in combinatorial optimization. These algorithms could be viewed as &q...
179
click to vote
PPL
2010
15 years 24 days ago
2010
Local search (LS) algorithms are among the most powerful techniques for solving computationally hard problems in combinatorial optimization. These algorithms could be viewed as &q...
184
click to vote
WCNC
2010
IEEE
15 years 10 months ago
2010
IEEE
—In this paper, we propose a new interference alignment (IA) scheme designing jointly the linear transmitter and receiver for the MIMO interference channel system, using minimum ...