1449 search results - page 196 / 290 » Self-Randomized Exponentiation Algorithms |
184
click to vote
ALDT
2009
Springer
16 years 27 days ago
2009
Springer
Abstract. An optimal probabilistic-planning algorithm solves a problem, usually modeled by a Markov decision process, by finding its optimal policy. In this paper, we study the k ...
217
click to vote
COLT
2007
Springer
16 years 13 days ago
2007
Springer
Abstract. We study online regret minimization algorithms in a bicriteria setting, examining not only the standard notion of regret to the best expert, but also the regret to the av...
165
click to vote
ICCV
2005
IEEE
15 years 12 months ago
2005
IEEE
We propose an algorithm to perform causal inference of the state of a dynamical model when the measurements are corrupted by outliers. While the optimal (maximumlikelihood) soluti...
166
click to vote
CAV
2010
Springer
15 years 10 months ago
2010
Springer
Graded-CTL is an extension of CTL with graded quantifiers which allow to reason about either at least or all but any number of possible futures. In this paper we show an extension...
181
click to vote
MOBIHOC
2008
ACM
16 years 5 months ago
2008
ACM
It has been an important research topic since 1992 to maximize stability region in constrained queueing systems, which includes the study of scheduling over wireless ad hoc networ...