77 search results - page 5 / 16 » Optimum Follow the Leader Algorithm |
ECCC
2006
13 years 7 months ago
2006
We introduce a new algorithm and a new analysis technique that is applicable to a variety of online optimization scenarios, including regret minimization for Lipschitz regret func...
EC
2008
13 years 7 months ago
2008
The dynamic optimization problem concerns finding an optimum in a changing environment. In the field of evolutionary algorithms, this implies dealing with a timechanging fitness l...
ALENEX
2008
13 years 9 months ago
2008
The multi-period newsvendor problem describes the dilemma of a newspaper salesman--how many paper should he purchase each day to resell, when he doesn't know the demand? We d...
NIPS
2008
13 years 8 months ago
2008
We describe a primal-dual framework for the design and analysis of online strongly convex optimization algorithms. Our framework yields the tightest known logarithmic regret bound...
IAT
2009
IEEE
13 years 5 months ago
2009
IEEE
Patrolling environments by means of autonomous mobile robots has received an increasing attention in the last few years. The interest of the agent community is mainly in the develo...