Blar i Department of Information and Communication Technology på emneord "Absorbing CPA"
Viser treff 1-1 av 1
-
A formal proof of the ε-optimality of absorbing continuous pursuit algorithms using the theory of regular functions
(Journal article; Peer reviewed, 2014)The most difficult part in the design and analysis of Learning Automata (LA) consists of the formal proofs of their convergence accuracies. The mathematical techniques used for the different families (Fixed Structure, ...