( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
A polynomial algorithm for minimizing discrete convic functions in fixed dimension.

, , , и . Discret. Appl. Math., (2020)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

Yu-Ting Yu

Yu-Yu Su

Nikolai Stuloff

Nikolai Piepgras

Nikolai Achwerdoff

 

Другие публикации лиц с тем же именем

Tuning hyperparameters of a SVM-based water demand forecasting system through parallel global optimization., , , , , , , и . Comput. Oper. Res., (2019)On the complexity of quasiconvex integer minimization problem., , , , , и . J. Glob. Optim., 73 (4): 761-788 (2019)On Boolean threshold functions with minimum specification number., , , и . Inf. Comput., 289 (Part): 104926 (2022)Linear and Fisher Separability of Random Points in the d-dimensional Spherical Layer., и . IJCNN, стр. 1-6. IEEE, (2020)Specifying a positive threshold function via extremal points., , , , и . ALT, том 76 из Proceedings of Machine Learning Research, стр. 208-222. PMLR, (2017)Faster Integer Points Counting in Parametric Polyhedra., , , и . CoRR, (2023)Evolutionary algorithms for constructing an ensemble of decision trees., и . CoRR, (2020)Two variations of graph test in double description method., и . Comput. Appl. Math., (2019)Evolutionary Algorithms for Constructing an Ensemble of Decision Trees., и . AIST (Supplement), том 1086 из Communications in Computer and Information Science, стр. 9-15. Springer, (2019)Lower Bounds for the Complexity of Learning Half-Spaces with Membership Queries., и . ALT, том 1501 из Lecture Notes in Computer Science, стр. 61-71. Springer, (1998)