This HTML5 document contains 3 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

PrefixNamespace IRI
dbpedia-owlhttp://dbpedia.org/ontology/
foafhttp://xmlns.com/foaf/0.1/
n7http://en.wikipedia.org/wiki/Special:FilePath/Las_Vegas_slot_machines.jpg?width=
rdfshttp://www.w3.org/2000/01/rdf-schema#
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
xsdhhttp://www.w3.org/2001/XMLSchema#
n5http://en.wikipedia.org/wiki/Special:FilePath/Las_Vegas_slot_machines.
dbpediahttp://dbpedia.org/resource/
Subject Item
dbpedia:Multi-armed_bandit
rdfs:comment
In probability theory, the multi-armed bandit problem (sometimes called the K- or N-armed bandit problem) is a problem in which a gambler at a row of slot machines (sometimes known as "one-armed bandits") has to decide which machines to play, how many times to play each machine and in which order to play them. When played, each machine provides a random reward from a distribution specific to that machine.
foaf:depiction
n5:jpg
dbpedia-owl:thumbnail
n7:300