| Publication | Date of Publication | Type |
|---|
Predicting packaging sizes using machine learning
SN Operations Research Forum | 2022-08-25 | Paper |
Decision making under uncertainty and reinforcement learning. Theory and algorithms
Intelligent Systems Reference Library | 2022-07-13 | Paper |
A new heuristic and an exact approach for a production planning problem
CEJOR. Central European Journal of Operations Research | 2021-11-24 | Paper |
Regret bounds for reinforcement learning via Markov chain concentration
Journal of Artificial Intelligence Research | 2020-02-05 | Paper |
| Forcing subarrangements in complete arrangements of pseudocircles | 2017-03-30 | Paper |
Selecting near-optimal approximate state representations in reinforcement learning
Lecture Notes in Computer Science | 2015-01-14 | Paper |
Regret bounds for restless Markov bandits
Theoretical Computer Science | 2014-10-31 | Paper |
Adaptive aggregation for reinforcement learning in average reward Markov decision processes
Annals of Operations Research | 2013-11-12 | Paper |
Regret Bounds for Restless Markov Bandits
Lecture Notes in Computer Science | 2012-10-16 | Paper |
Near-optimal regret bounds for reinforcement learning
Journal of Machine Learning Research (JMLR) | 2012-07-13 | Paper |
| Mechanizing induction | 2012-03-02 | Paper |
UCB revisited: improved regret bounds for the stochastic multi-armed bandit problem
Periodica Mathematica Hungarica | 2011-12-19 | Paper |
Online regret bounds for Markov decision processes with deterministic transitions
Theoretical Computer Science | 2010-07-07 | Paper |
| A note on convex realizability of arrangements of pseudocircles | 2009-02-12 | Paper |
Online Regret Bounds for Markov Decision Processes with Deterministic Transitions
Lecture Notes in Computer Science | 2008-10-14 | Paper |
Pseudometrics for State Aggregation in Average Reward Markov Decision Processes
Lecture Notes in Computer Science | 2008-08-19 | Paper |
Machine Learning: ECML 2004
Lecture Notes in Computer Science | 2008-03-14 | Paper |
Embeddability of arrangements of pseudocircles into the sphere
European Journal of Combinatorics | 2008-02-25 | Paper |
Linear dependence of stationary distributions in ergodic Markov decision processes
Operations Research Letters | 2008-01-11 | Paper |
Improved Rates for the Stochastic Continuum-Armed Bandit Problem
Learning Theory | 2008-01-03 | Paper |
A new PAC bound for intersection-closed concept classes
Machine Learning | 2007-09-20 | Paper |
Non-Backtracking Random Walks and Cogrowth of Graphs
Canadian Journal of Mathematics | 2007-09-03 | Paper |
| Upper Bounds on the Number of Vertices of Weight <=k in Particular Arrangements of Pseudocircles | 2007-06-06 | Paper |
| A Short Note on Stationary Distributions of Unichain Markov Decision Processes | 2006-04-20 | Paper |
An arrangement of pseudocircles not realizable with circles
Beiträge zur Algebra und Geometrie | 2005-10-20 | Paper |
An arrangement of pseudocircles not realizable with circles
Beiträge zur Algebra und Geometrie | 2005-10-20 | Paper |
Learning Theory
Lecture Notes in Computer Science | 2005-06-13 | Paper |
On the combinatorial structure of arrangements of oriented pseudocircles
The Electronic Journal of Combinatorics | 2004-10-13 | Paper |
On the combinatorial structure of arrangements of oriented pseudocircles
The Electronic Journal of Combinatorics | 2004-10-13 | Paper |
