Zobrazeno 1 - 10
of 548
pro vyhledávání: '"Herbert, Ian"'
Autor:
McCormick, Timothy M., Klain, Zipporah, Herbert, Ian, Charles, Anthony M., Angle, R. Blair, Osborn, Bryan R., Streit, Roy L.
In this paper, we present a hybrid quantum/classical algorithm to solve an NP-hard combinatorial problem called the multiple target data association (MTDA) and tracking problem. We use diabatic quantum annealing (DQA) to enumerate the low energy, or
Externí odkaz:
http://arxiv.org/abs/2209.00615
Publikováno v:
In The International Journal of Management Education July 2020 18(2)
Publikováno v:
In The British Accounting Review March 2020 52(2)
Autor:
Herbert, Ian
The (prefix-free) Kolmogorov complexity of a finite binary string is the length of the shortest description of the string. This gives rise to some `standard' lowness notions for reals: A is K-trivial if its initial segments have the lowest possible c
Externí odkaz:
http://arxiv.org/abs/1410.3615
Autor:
Herbert, Ian
A real is called integer-valued random if no integer-valued martingale can win arbitrarily much capital betting against it. A real is low for integer-valued randomness if no integer-valued martingale recursive in A can succeed on an integer-valued ra
Externí odkaz:
http://arxiv.org/abs/1410.3211
Autor:
Herbert, Ian
We examine a definition of the mutual information of two reals proposed by Levin. The mutual information is I(X:Y)=log(sum(2^{K(s)-K^X(s)+K(t)-K^Y(t)-K(s,t)}, (s,t) pairs of finite binary strings), where K is the prefix-free Kolmogorov complexity. A
Externí odkaz:
http://arxiv.org/abs/1210.7779
Autor:
HERBERT, IAN
Publikováno v:
The Journal of Symbolic Logic, 2016 Sep 01. 81(3), 833-855.
Externí odkaz:
http://www.jstor.org/stable/44161509