Sciweavers

16082 search results - page 16 / 3217
» Fireworks Algorithm for Optimization
Sort
View
COLT
2008
Springer
13 years 9 months ago
Competing in the Dark: An Efficient Algorithm for Bandit Linear Optimization
We introduce an efficient algorithm for the problem of online linear optimization in the bandit setting which achieves the optimal O ( T) regret. The setting is a natural general...
Jacob Abernethy, Elad Hazan, Alexander Rakhlin
ICTAI
1994
IEEE
13 years 11 months ago
Iterative Strengthening: An Algorithm for Generating Anytime Optimal Plans
In order to perform adequately in real-world situations, a planning system must be able to nd the \best" solution while still supporting anytime behavior. We have developed ...
Randall J. Calistri-Yeh
AISB
1995
Springer
13 years 11 months ago
An Evolutionary Algorithm for Parametric Array Signal Processing
This paper presents an evolutionary algorithm for solving parameter optimization problems in parametric array signal processing. The method utilises the niche concept to maintain a...
Dekun Yang, Stuart J. Flockton
WSC
2007
13 years 9 months ago
Extension of the direct optimization algorithm for noisy functions
DIRECT (DIviding RECTangles) is a deterministic global optimization algorithm for bound-constrained problems. The algorithm, based on a space-partitioning scheme, performs both gl...
Geng Deng, Michael C. Ferris
RANDOM
1999
Springer
13 years 11 months ago
A Randomized Time-Work Optimal Parallel Algorithm for Finding a Minimum Spanning Forest
We present a randomized algorithm to nd a minimum spanning forest (MSF) in an undirected graph. With high probability, the algorithm runs in logarithmic time and linear work on an...
Seth Pettie, Vijaya Ramachandran