ALT
2011
Springer
12 years 4 months ago
2011
Springer
This paper studies the deviations of the regret in a stochastic multi-armed bandit problem. When the total number of plays n is known beforehand by the agent, Audibert et al. (2009...
JGT
2010
12 years 11 months ago
2010
We answer two open questions posed by Cameron and Nesetril concerning homomorphismhomogeneous graphs. In particular we show, by giving a characterization of these graphs, that ext...
JACM
2007
13 years 4 months ago
2007
We solve an open question of Milner [1984]. We define a set of so-called well-behaved finite automata that, modulo bisimulation equivalence, corresponds exactly to the set of reg...
SIAMCOMP
2008
13 years 4 months ago
2008
We show that a set is m-autoreducible if and only if it is m-mitotic. This solves a long standing open question in a surprising way. As a consequence of this unconditional result a...
MST
2006
13 years 4 months ago
2006
We consider packet networks and make use of the adversarial queuing theory" model 10 . We are interested in the question of guaranteeing that all packets are actually deliver...
SWAT
2010
Springer
13 years 9 months ago
2010
Springer
Given a permutation π of {1, . . . , n} and a positive integer k, we give an algorithm with running time 2O(k2 log k) nO(1) that decides whether π can be partitioned into at mos...
ICALP
2005
Springer
13 years 10 months ago
2005
Springer
Abstract. We present a finite ω-complete axiomatization for the process algebra BCCSP modulo failure semantics, in case of a finite alphabet. This solves an open question by Gro...
BIRTHDAY
2009
Springer
13 years 11 months ago
2009
Springer
We provide a new proof of a theorem of Saks which is an extension of Greene’s Theorem to acyclic digraphs, by reducing it to a similar, known extension of Greene and Kleitman’s...