Sciweavers

403 search results - page 18 / 81
» Sampling Bounds for Stochastic Optimization
Sort
View
COLT
2010
Springer
13 years 7 months ago
An Asymptotically Optimal Bandit Algorithm for Bounded Support Models
Multiarmed bandit problem is a typical example of a dilemma between exploration and exploitation in reinforcement learning. This problem is expressed as a model of a gambler playi...
Junya Honda, Akimichi Takemura
WINE
2005
Springer
131views Economy» more  WINE 2005»
14 years 3 months ago
On the Competitive Ratio of the Random Sampling Auction
We give a simple analysis of the competitive ratio of the random sampling auction from [10]. The random sampling auction was first shown to be worst-case competitive in [9] (with ...
Uriel Feige, Abraham Flaxman, Jason D. Hartline, R...
TSP
2011
170views more  TSP 2011»
13 years 4 months ago
Joint TDOA and FDOA Estimation: A Conditional Bound and Its Use for Optimally Weighted Localization
—Modern passive emitter-location systems are often based on joint estimation of the time-difference of arrival (TDOA) and frequency-difference of arrival (FDOA) of an unknown sig...
Arie Yeredor, Eyal Angel
ICPR
2008
IEEE
14 years 11 months ago
On using error bounds to optimize cost-sensitive multimodal biometric authentication
While using more biometric traits in multimodal biometric fusion can effectively increase the system robustness, often, the cost associated to adding additional systems is not con...
Norman Poh, Josef Kittler
CDC
2010
IEEE
167views Control Systems» more  CDC 2010»
13 years 4 months ago
Numerical methods for the optimization of nonlinear stochastic delay systems, and an application to internet regulation
The Markov chain approximation method is an effective and widely used approach for computing optimal values and controls for stochastic systems. It was extended to nonlinear (and p...
Harold J. Kushner