Sciweavers

1118 search results - page 98 / 224
» Convex Optimization
Sort
View
COLT
2010
Springer
15 years 3 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
ICASSP
2011
IEEE
14 years 8 months ago
A constrained optimization approach for multi-zone surround sound
A recent approach to surround sound is to perform exact control of the sound field over a region of space. Here, the driving signals for an array of loudspeakers are chosen to cr...
Terence Betlehem, Paul D. Teal
IPPS
2000
IEEE
15 years 9 months ago
Parallelizability of Some P-Complete Problems
Abstract. In this paper, we consider parallelizability of some Pcomplete problems. First we propose a parameter which indicates parallelizability for a convex layers problem. We pr...
Akihiro Fujiwara, Michiko Inoue, Toshimitsu Masuza...
SCIA
2007
Springer
149views Image Analysis» more  SCIA 2007»
15 years 11 months ago
Triangulation of Points, Lines and Conics
The problem of reconstructing 3D scene features from multiple views with known camera motion and given image correspondences is considered. This is a classical and one of the most...
Klas Josephson, Fredrik Kahl
136
Voted
EOR
2008
70views more  EOR 2008»
15 years 5 months ago
Robust portfolio selection based on a multi-stage scenario tree
The aim of this paper is to apply the concept of robust optimization introduced by Bel-Tal and Nemirovski to the portfolio selection problems based on multi-stage scenario trees. ...
Ruijun Shen, Shuzhong Zhang