12950 search results - page 251 / 2590 » On Optimal Timed Strategies |
189
click to vote
COLT
1997
Springer
15 years 10 months ago
1997
Springer
Abstract. We propose a convex optimization approach to solving the nonparametric regression estimation problem when the underlying regression function is Lipschitz continuous. This...
198
Voted
FCT
2007
Springer
15 years 10 months ago
2007
Springer
We investigate issues regarding two hard problems related to voting, the optimal weighted lobbying problem and the winner problem for Dodgson elections. Regarding the former, Chris...
169
click to vote
PKC
2000
Springer
15 years 10 months ago
2000
Springer
Abstract. Efficient secure time-stamping schemes employ a 2-level approach in which the time-stamping service operates in rounds. We say that a time-stamping service is accountable...
200
click to vote
IJCAI
2001
15 years 8 months ago
2001
R-max is a very simple model-based reinforcement learning algorithm which can attain near-optimal average reward in polynomial time. In R-max, the agent always maintains a complet...
169
click to vote
CORR
2006
Springer
15 years 6 months ago
2006
Springer
Abstract-- In this paper, a downlink scenario in which a singleantenna base station communicates with K single antenna users, over a time-correlated fading channel, is considered. ...