5153 search results - page 366 / 1031 » Introduction to Randomized Algorithms |
283
click to vote
OL
2011
14 years 11 months ago
2011
We consider sequential quadratic programming (SQP) methods for solving constrained nonlinear programming problems. It is generally believed that SQP methods are sensitive to the a...
113
click to vote
CSE
2009
IEEE
15 years 11 months ago
2009
IEEE
—We propose a parallel algorithm for finding Nash equilibria in n-player noncooperative games. The algorithm is based on enumerating the supports of mixed strategies in parallel...
138
click to vote
STOC
2006
ACM
15 years 10 months ago
2006
ACM
We show that for any constant ε > 0, there is no Ω(log1−ε M)approximation algorithm for the directed congestion minimization problem on networks of size M unless NP ⊆ Z...
124
click to vote
ICANNGA
2007
Springer
15 years 8 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...
134
click to vote
ALGORITHMICA
2008
15 years 4 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...