85 search results - page 5 / 17 » Scaling limit of random k-trees |
176
click to vote
INFOCOM
2007
IEEE
16 years 22 days ago
2007
IEEE
— n source and destination pairs randomly located in a fixed area want to communicate with each other. It is well known that classical multihop architectures that decode and for...
176
click to vote
CEC
2010
IEEE
15 years 6 months ago
2010
IEEE
— Many evolutionary algorithms have been proposed for large scale optimization. Parameter interaction in nonseparable problems is a major source of performance loss specially on ...
191
click to vote
WIOPT
2006
IEEE
16 years 12 days ago
2006
IEEE
— In this paper we investigate the limiting properties, in terms of capacity and delay, of an ad hoc network employing a topology-transparent scheduling scheme. In particular, we...
176
click to vote
WOWMOM
2009
ACM
16 years 28 days ago
2009
ACM
Random Walks (RWs) have been considered for information dissemination in large scale, dynamic and unstructured environments, as they are scalable, robust to topology changes and d...
215
click to vote
JSAC
2008
15 years 6 months ago
2008
We consider the downlink of a wireless system with an M-antenna base station and K single-antenna users. A limited feedback-based scheduling and precoding scenario is considered th...