Chair of Information Technology (150)

Organisational unit: Chair

41 - 50 out of 219Page size: 10

Sort by: 1st author

Research output

Published
Mechanizing Induction
Ortner, R. & Leitgeb, H., 2011, Handbook of the History of Logic, Volume 10: Inductive Logic. p. 719-772
Research output: Chapter in Book/Report/Conference proceeding › Chapter › Research
Published
Embeddability of arrangements of pseudocircles into the sphere
Ortner, R., 2008, In: European journal of combinatorics. 29, p. 457-469
Research output: Contribution to journal › Article › Research › peer-review
Published
Online Regret Bounds for Undiscounted Continuous Reinforcement Learning
Ortner, R. & Ryabko, D., 2012.
Research output: Contribution to conference › Poster › Research › peer-review
Published
Optimism in the Face of Uncertainty Should be Refutable
Ortner, R., 2008, In: Minds and Machines. 18, p. 521-526
Research output: Contribution to journal › Article › Research › peer-review
Published
Adaptive Aggregation for Reinforcement Learning in Average Reward Markov Decision Processes
Ortner, R., 2013, In: Annals of operations research. 208, p. 321-336
Research output: Contribution to journal › Article › Research › peer-review
Published
Anordnungen von Pseudokreisen
Ortner, R., 2009.
Research output: Contribution to conference › Poster › Research › peer-review
Published
Combinations and Mixtures of Optimal Policies in Unichain MDPs are Optimal: arXiv.org e-Print archive
Ortner, R., 2005
Research output: Non-textual form › Web publication/site › Research
Published
Improved Upper Bounds on the Number of Vertices of Weight <=k
Ortner, R., 2008, 24th European Workshop on Computational Geometry. p. 35-38
Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
Published
Selecting Near-Optimal Approximate State Representations in Reinforcement Learning
Ortner, R., Maillard, O.-A. & Ryabko, D., 2014, Algorithmic Learning Theory - 25th International Conference, ALT 2014, Bled, October 8-10, 2014. p. 140-154
Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
Published
Forcing Subarrangements in Complete Arrangements of Pseudocircles
Ortner, R., 2015, In: Journal of Computational Geometry. 6, 1, p. 235-248
Research output: Contribution to journal › Article › Research › peer-review

Previous 1 2 3 4 5 6 7 8 ...22 Next

Research Portal

Chair of Information Technology (150)

Research output

Mechanizing Induction

Embeddability of arrangements of pseudocircles into the sphere

Online Regret Bounds for Undiscounted Continuous Reinforcement Learning

Optimism in the Face of Uncertainty Should be Refutable

Adaptive Aggregation for Reinforcement Learning in Average Reward Markov Decision Processes

Anordnungen von Pseudokreisen

Combinations and Mixtures of Optimal Policies in Unichain MDPs are Optimal: arXiv.org e-Print archive

Improved Upper Bounds on the Number of Vertices of Weight <=k

Selecting Near-Optimal Approximate State Representations in Reinforcement Learning

Forcing Subarrangements in Complete Arrangements of Pseudocircles

Contact information