526 search results - page 32 / 106 » Efficient Algorithms for Online Decision Problems |
CORR
2004
Springer
13 years 10 months ago
2004
Springer
We study a general online convex optimization problem. We have a convex set S and an unknown sequence of cost functions c1, c2, . . . , and in each period, we choose a feasible po...
NIPS
2001
13 years 11 months ago
2001
Abstract--Kernel-based algorithms such as support vector machines have achieved considerable success in various problems in batch setting, where all of the training data is availab...
COMPGEOM
2001
ACM
14 years 1 months ago
2001
ACM
: Many geometric problems like generalized Voronoi diagrams, medial axis computations and boundary evaluation involve computation and manipulation of non-linear algebraic primitive...
AOR
2010
13 years 7 months ago
2010
We show how a technique from signal processing known as zero-delay convolution can be used to develop more efficient dynamic programming algorithms for a broad class of stochastic...
IJCAI
2003
13 years 11 months ago
2003
The problem of deriving joint policies for a group of agents that maximize some joint reward function can be modeled as a decentralized partially observable Markov decision proces...