Iskalni niz:
išči po
išči po
išči po
išči po
Vrsta gradiva:
Jezik:
Št. zadetkov: 2
Improved Regret Bounds for Undiscounted Continuous Reinforcement Learning
Ronald Ortner
Video in druga učna gradiva
Oznake: computer science;machine learning
We consider the problem of undiscounted reinforcement learning in continuous state space. Regret bounds in this setting usually hold under various assumptions on the structure of the reward and transition function. Under the assumption that the rewards and transition probabilities are Lipschitz, for ...
Leto: 2015 Vir: videolectures.net
On cubic vertex-transitive graphs of given girth
Edward Tauscher Dobson, Ademir Hujdurović, Wilfried Imrich, Ronald Ortner
Izvirni znanstveni članek
Oznake: distinguishing number;distinguishing cost;vertex-transitive cubic graphs;automorphisms;
A set of vertices of a graph is distinguishing if the only automorphism that preserves it is the identity. The minimal size of such sets, if they exist, is the distinguishing cost. The distinguishing costs of vertex transitive cubic graphs are well known if they are 1-arc-transitive, or if they have ...
Leto: 2025 Vir: Fakulteta za matematiko, naravoslovje in informacijske tehnologije Koper (UP FAMNIT)
Št. zadetkov: 2
Ključne besede:
Leto izdaje:
Avtorji:
Repozitorij:
Tipologija:
Jezik: