About

Log in?

DTU users get better search results including licensed content and discounts on order fees.

Anyone can log in and get personalized features such as favorites, tags and feeds.

Log in as DTU user Log in as non-DTU user No thanks

DTU Findit
Boolean: (bicycle AND helmet) OR (head AND protection) (always group AND in parenthesis)
Title: title:(climate change)
Author: author:("bohr niels" OR "bohr n") (avoid only full first name)
Phrase: "water pump control" (does not work with wildcards)
Wildcards: wom?n pharm*

More help on how to search

Flexible matching

About search syntax

Search syntax Advanced
Close advanced
{{problem}}
By field Using AND/OR By author
This tool can help you build boolean queries suitable for doing a broad search for different synonyms or spellings of each word. Start via the drop-down below or just start typing in the search field.
{{ row.typeTitle }}: ( )

Since our index often lack the full first name of people it can be difficult to correctly search by author.

Fill in the fields and let us help you build a good query:

If you need to find everything possible, consider only searching by last name.

Use "Starting year" to ignore publications out of year range.

More...

Conference paper

Finite-time Upper Bounds for the Multi-armed Bandit Problem with Bounded Rewards

In Proc. 15th International Conference on Machine Learning (icml98) — 1998, pp. 100-108

By Fischer, Paul1,2; Cesa-Bianchi, N.

From

Computer Science and Engineering, Department of Informatics and Mathematical Modeling, Technical University of Denmark1

Department of Informatics and Mathematical Modeling, Technical University of Denmark2

Language: English
Year: 1998
Pages: 100-108
Proceedings: 15th International Conference on Machine Learning
Types: Conference paper
ORCIDs: Fischer, Paul

DTU users get better search results including licensed content and discounts on order fees.

Log in as DTU user

Access

Analysis