We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
コヒーレントイジングマシン(CIM)を古典コンピュータでシミュレートするアルゴリズムのNoisy Mean-Field Algorithm (NMFA)を開発、実装し、GeForce 1080 Tiで動作させたところ、NTTのCIMの20倍、スタンフォードのCIMの130倍高速に動作した。
https://arxiv.org/abs/1806.08422
Andrew D. King, William Bernoudy, James King, Andrew J. Berkley, Trevor Lanting D-Wave Systems Inc.
2018/06/25
The text was updated successfully, but these errors were encountered:
No branches or pull requests
一言でいうと
コヒーレントイジングマシン(CIM)を古典コンピュータでシミュレートするアルゴリズムのNoisy Mean-Field Algorithm (NMFA)を開発、実装し、GeForce 1080 Tiで動作させたところ、NTTのCIMの20倍、スタンフォードのCIMの130倍高速に動作した。
論文リンク
https://arxiv.org/abs/1806.08422
著者/所属機関
Andrew D. King, William Bernoudy, James King, Andrew J. Berkley, Trevor Lanting
D-Wave Systems Inc.
投稿日付(yyyy/MM/dd)
2018/06/25
概要
新規性・差分
手法
結果
コメント
The text was updated successfully, but these errors were encountered: