5138 search results - page 377 / 1028 » Randomized Algorithms for 3-SAT |
152
click to vote
ICANNGA
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. In this paper, five previous Particle Swarm Optimization (PSO) algorithms for multimodal function optimization are reviewed. A new and a successful PSO based algorithm, n...
175
click to vote
ALGORITHMICA
2008
15 years 6 months ago
2008
We consider the problem of approximately integrating a Lipschitz function f (with a known Lipschitz constant) over an interval. The goal is to achieve an error of at most using as...
187
click to vote
FOCS
2008
IEEE
16 years 1 months ago
2008
IEEE
We show a tight lower bound of Ω(N log log N) on the number of transmissions required to compute several functions (including the parity function and the majority function) in a...
172
click to vote
ICC
2007
IEEE
16 years 1 months ago
2007
IEEE
—Opportunistic scheduling in random beamforming maximizes the sum-rate by allocating resources to the users with the best channel condition, thus leveraging on multiuser diversit...
155
Voted
CDC
2009
IEEE
15 years 11 months ago
2009
IEEE
Abstract— This paper is concerned with the distributed averaging problem over a given undirected graph. To enable every vertex to compute the average of the initial numbers sitti...