Sciweavers

1434 search results - page 150 / 287
» Stochastic computation
Sort
View
133
Voted
CDC
2009
IEEE
143views Control Systems» more  CDC 2009»
15 years 7 months ago
Parameter approximate dynamic optimization for PSO systems
— This paper presents a novel swarm approximate dynamic programming method (swarm-ADP) for parameter optimization of PSO systems, from the perspective of optimal control. Based o...
Qi Kang, Lei Wang, Derong Liu, Qidi Wu
144
Voted
FOCS
2005
IEEE
15 years 9 months ago
How to Pay, Come What May: Approximation Algorithms for Demand-Robust Covering Problems
Robust optimization has traditionally focused on uncertainty in data and costs in optimization problems to formulate models whose solutions will be optimal in the worstcase among ...
Kedar Dhamdhere, Vineet Goyal, R. Ravi, Mohit Sing...
108
Voted
ECCV
2004
Springer
16 years 5 months ago
Dynamic Visual Search Using Inner-Scene Similarity: Algorithms and Inherent Limitations
Abstract. A dynamic visual search framework based mainly on innerscene similarity is proposed. Algorithms as well as measures quantifying the difficulty of search tasks are suggest...
Tamar Avraham, Michael Lindenbaum
STOC
2007
ACM
132views Algorithms» more  STOC 2007»
16 years 4 months ago
On the convergence of Newton's method for monotone systems of polynomial equations
Monotone systems of polynomial equations (MSPEs) are systems of fixed-point equations X1 = f1(X1, . . . , Xn), . . . , Xn = fn(X1, . . . , Xn) where each fi is a polynomial with p...
Stefan Kiefer, Michael Luttenberger, Javier Esparz...
ATAL
2009
Springer
15 years 10 months ago
Modeling billiards games
Two-player games of billiards, of the sort seen in recent Computer Olympiads held by the International Computer Games Association, are an emerging area with unique challenges for ...
Christopher Archibald, Yoav Shoham