| Нет данных |
| Труды института математики и механики УрО РАН |
— |
ПРИБЛИЖЕННЫЕ СХЕМЫ ДЛЯ ОБОБЩЕННОЙ ЗАДАЧИ КОММИВОЯЖЕРА / Хачай М.Ю.,Незнахина Е.Д. // Труды института математики и механики УрО РАН. - 2016. - V. 22, l. 3. - P. 283-292. |
2016 |
0 |
| Proceedings of the Steklov Institute of Mathematics |
— |
A POLYNOMIAL-TIME APPROXIMATION SCHEME FOR THE EUCLIDEAN PROBLEM ON A CYCLE COVER OF A GRAPH / Khachai M.Y.,Neznakhina E.D. // Proceedings of the Steklov Institute of Mathematics. - 2015. - V. 289, l. 1. - P. 111-125. |
2015 |
5 |
| Communications in Computer and Information Science |
— |
ANALYSIS OF IMAGES, SOCIAL NETWORKS AND TEXTS: 4TH INTERNATIONAL CONFERENCE, AIST 2015 YEKATERINBURG, RUSSIA, APRIL 9-11, 2015 REVISED SELECTED PAPERS / Khachay M.Y.,Konstantinova N.,Panchenko A.,Ignatov D.I.,Labunets V.G. // Communications in Computer and Information Science. - 2015. - V. 542, l. . |
2015 |
0 |
| Machine Learning |
— |
COMMITTEE POLYHEDRAL SEPARABILITY: COMPLEXITY AND POLYNOMIAL APPROXIMATION / Khachay M. // Machine Learning. - 2015. - V. 101, l. 1-3. - P. 231-251. |
2015 |
1 |
| Proceedings of the Steklov Institute of Mathematics |
— |
EFFICIENT ALGORITHMS WITH PERFORMANCE GUARANTEES FOR SOME PROBLEMS OF FINDING SEVERAL CLIQUES IN A COMPLETE UNDIRECTED WEIGHTED GRAPH / Gimadi E.K.,Kel’manov A.V.,Pyatkin A.V.,Khachai M.Y. // Proceedings of the Steklov Institute of Mathematics. - 2015. - V. 289, l. 1. - P. 88-101. |
2015 |
1 |
| International Journal of Artificial Intelligence |
— |
INTEGER PARTITION PROBLEM: THEORETICAL APPROACH TO IMPROVING ACCURACY OF CLASSIFIER ENSEMBLES / Khachay M.,Pobery M.,Khachay D. // International Journal of Artificial Intelligence. - 2015. - V. 13, l. 1. - P. 135-146. |
2015 |
0 |
| Lecture Notes in Computer Science |
— |
POLYNOMIAL TIME APPROXIMATION SCHEME FOR SINGLE-DEPOT EUCLIDEAN CAPACITATED VEHICLE ROUTING PROBLEM / Khachay M.,Zaytseva H. // Lecture Notes in Computer Science. - 2015. - V. 9486, l. . - P. 178-190. |
2015 |
0 |
| Communications in Computer and Information Science |
— |
THEORETICAL APPROACH TO DEVELOPING EFFICIENT ALGORITHMS OF FINGERPRINT ENHANCEMENT / Khachay M.Y.,Pasynkov M. // Communications in Computer and Information Science. - 2015. - V. 542, l. . - P. 83-95. |
2015 |
0 |
| Доклады Академии наук |
— |
АППРОКСИМИРУЕМОСТЬ ЗАДАЧИ О МИНИМАЛЬНОМ ПО ВЕСУ ЦИКЛОВОМ ПОКРЫТИИ ГРАФА / Хачай М.Ю.,Незнахина Е.Д. // Доклады Академии наук. - 2015. - V. 461, l. 6. - P. 644. |
2015 |
12 |
| — |
— |
ОБ ЭФФЕКТИВНОЙ АППРОКСИМИРУЕМОСТИ ЗАДАЧ О КУСОЧНО-ЛИНЕЙНОЙ ОТДЕЛИМОСТИ / Хачай М.Ю. // . - 2015. - V. , l. . - P. 82-83. |
2015 |
0 |