3247 search results - page 138 / 650 » Randomized smoothing networks |
125
click to vote
GECCO
2005
Springer
15 years 9 months ago
2005
Springer
We present discrete stochastic mathematical models for the growth curves of synchronous and asynchronous evolutionary algorithms with populations structured according to a random ...
128
Voted
APPROX
2000
Springer
15 years 8 months ago
2000
Springer
Motivated by the problem of WDM routing in all–optical networks, we study the following NP–hard problem. We are given a directed binary tree T and a set R of directed paths on ...
143
Voted
SODA
2008
ACM
15 years 5 months ago
2008
ACM
We present a simple randomized algorithmic framework for connected facility location problems. The basic idea is as follows: We run a black-box approximation algorithm for the unc...
170
click to vote
JSAC
2008
15 years 4 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...
163
click to vote
INFOCOM
2012
IEEE
13 years 6 months ago
2012
IEEE
—This paper builds a generic modeling framework for analyzing the edge-creation process in dynamic random graphs in which nodes continuously alternate between active and inactive...