1301 search results - page 5 / 261 » Bounded Version Vectors |
145
Voted
COLT
2004
Springer
15 years 10 months ago
2004
Springer
We give an algorithm for the bandit version of a very general online optimization problem considered by Kalai and Vempala [1], for the case of an adaptive adversary. In this proble...
141
click to vote
NIPS
2003
15 years 6 months ago
2003
The decision functions constructed by support vector machines (SVM’s) usually depend only on a subset of the training set—the so-called support vectors. We derive asymptotical...
134
click to vote
WDAG
1992
Springer
15 years 9 months ago
1992
Springer
Abstract. The Choice Coordination Problem with k alternatives (kCCP) was introduced by Rabin in 1982 [Rab82]. The goal is to design a wait-free protocol for n asynchronous processe...
127
click to vote
STACS
1999
Springer
15 years 9 months ago
1999
Springer
Abstract. In this we paper we consider the version of the classical Towers of Hanoi games where the game-board contains more than three pegs. For k pegs we give a 2Ckn1/(k−2) low...
151
click to vote
APPROX
2005
Springer
15 years 11 months ago
2005
Springer
A large class of stochastic optimization problems can be modeled as minimizing an objective function f that depends on a choice of a vector x ∈ X, as well as on a random external...