Российские распределенные вычисления на платформе BOINC
Berkeley Open Infrastructure for Network Computing

Welcome Guest
Create Account
Logon

Project News


26 февраля 2018 г. evatutin#80

We have two new articles that are recently published in Open Engineering journal.

Vatutin E.I. Comparison of Decisions Quality of Heuristic Methods with Limited Depth-First Search Techniques in the Graph Shortest Path Problem // Open Engineering. Vol. 7. Iss. 1. 2017. pp. 428–434. DOI: 10.1515/eng-2017-0041. https://www.degruyter.com/view/j/eng.2017.7.issue-1/eng-2017-0041/eng-2017-0041.xml?format=INT

Vatutin E.I., Zaikin O.S., Kochemazov S.E., Valyaev S.Y. Using Volunteer Computing to Study Some Features of Diagonal Latin Squares // Open Engineering. Vol. 7. Iss. 1. 2017. pp. 453–460. DOI: 10.1515/eng-2017-0052. https://www.degruyter.com/view/j/eng.2017.7.issue-1/eng-2017-0052/eng-2017-0052.xml?format=INT

They are includes some results of computing experiments aimed to investigate quality of heuristic decisions in the graph shortest path problem (first) and to find diagonal Latin squares with extremal number of transversals (second).