电邮这篇文章 Compression of underdetermined data in a 7-piece chess table
- 作者: Zakharov V.B.1, Mal’kovskii M.G.1, Shchukin V.Y.1
-
隶属关系:
- Department of Computational Mathematics and Cybernetics
- 期: 卷 40, 编号 1 (2016)
- 页面: 47-52
- 栏目: Article
- URL: https://journals.rcsi.science/0278-6419/article/view/176119
- DOI: https://doi.org/10.3103/S0278641916010076
- ID: 176119
如何引用文章
开放存取
##reader.subscriptionAccessGranted##
订阅存取
详细
Block compression algorithms used for solving the problem of 7-piece chess endings are presented. The algorithms are based on data reordering before compression, the RE-PAIR compression algorithm, and use of the so-called underdetermined value method.
作者简介
V. Zakharov
Department of Computational Mathematics and Cybernetics
编辑信件的主要联系方式.
Email: victor@ldis.cs.msu.su
俄罗斯联邦, Moscow, 119991
M. Mal’kovskii
Department of Computational Mathematics and Cybernetics
Email: victor@ldis.cs.msu.su
俄罗斯联邦, Moscow, 119991
V. Shchukin
Department of Computational Mathematics and Cybernetics
Email: victor@ldis.cs.msu.su
俄罗斯联邦, Moscow, 119991
补充文件
