5230 search results - page 3 / 1046 » Dynamic Optimality -- Almost |
JGO
2008
13 years 5 months ago
2008
Abstract. We deal with duality for almost convex finite dimensional optimization problems by means of the classical perturbation approach. To this aim some standard results from th...
COLT
2004
Springer
13 years 10 months ago
2004
Springer
We give the first polynomial time prediction strategy for any PAC-learnable class C that probabilistically predicts the target with mistake probability poly(log(t)) t = ˜O 1 t w...
STACS
2005
Springer
13 years 10 months ago
2005
Springer
We revisit the construction of high noise, almost optimal rate list decodable code of Guruswami [1]. Guruswami showed that if one can explicitly construct optimal extractors then o...
ICMAS
1998
13 years 6 months ago
1998
This work presents a lookahead-based exploration strategy for a model-based learning agent that enables exploration of the opponent's behavior during interaction in a multi-a...
COCO
2009
Springer
13 years 11 months ago
2009
Springer
—We show that the rank of a depth-3 circuit (over any field) that is simple, minimal and zero is at most O(k3 log d). The previous best rank bound known was 2O(k2 ) (log d)k−2...