default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMikhail V. Saramud
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i10]Alexander Razumovsky, Mikhail V. Saramud, Stepan Tkachev, N. V. Shtabel:
Algorithms for synthesis of three-dimensional warehouse systems configurations optimal in terms of minimum cost and maximum speed. CoRR abs/2401.03351 (2024)- 2023
- [i9]Alexander Razumovsky, Yakov Pikalov, Mikhail V. Saramud:
Determination of cutting positions of honeycomb blocks using computer vision. CoRR abs/2304.00001 (2023) - [i8]Nikolay Shtabel
, Mikhail V. Saramud, Stepan Tkachev, Iakov Pikalov:
Automated machine vision control system for technological nodes assembly process. CoRR abs/2310.00005 (2023) - 2022
- [i7]Kirill Aleksandrovich Bashmur, Vadim Sergeevich Tynchenko, Vladimir Viktorovich Bukhtoyarov, Mikhail V. Saramud:
Choice of technology and evaluation of the production capabilities of a 3d printer robot for creating elements of experimental equipment for the production of biofuel components. CoRR abs/2202.00889 (2022) - [i6]Mikhail V. Saramud, Evgeniy Spirin, Evgeniy Petrovich Talay, Iakov Pikalov:
Formulation of problems of combinatorial optimization for solving problems of management and planning of cloud production. CoRR abs/2212.02016 (2022) - 2021
- [j2]Maksim V. Kubrikov, Mikhail V. Saramud, Margarita Karaseva:
Method for the Optimal Positioning of the Cutter at the Honeycomb Block Cutting Applying Computer Vision. IEEE Access 9: 15548-15560 (2021) - [i5]Maksim V. Kubrikov, Mikhail V. Saramud, Angelina Petetskaya, Evgeniy Talay:
Creation and Verification of Digital Twins in Cloud Production. CoRR abs/2109.05856 (2021) - [i4]Maksim Viktorovich Kubrikov, Mikhail Vladimirovich Saramud, Ivan Alekseevich Paulin, Evgeniy Petrovich Talay:
Algorithm for recognizing the contour of a honeycomb block. CoRR abs/2112.13846 (2021) - 2020
- [j1]Igor V. Kovalev, Mikhail V. Saramud, Vasiliy V. Losev:
Simulation environment for the choice of the decision making algorithm in multi-version real-time system. Inf. Softw. Technol. 120: 106245 (2020) - [c3]Maksim V. Kubrikov, Mikhail V. Saramud, M. V. Karaseva:
Problem of Robotic Precision Cutting of the Geometrically Complex Shape from an Irregular Honeycomb Grid. ICIRA 2020: 112-120 - [i3]Maksim V. Kubrikov, Mikhail V. Saramud, M. V. Karaseva:
Problem of robotic precision cutting of the geometrically complex shape from an irregular honeycomb grid. CoRR abs/2008.08265 (2020) - [i2]Maksim V. Kubrikov, I. A. Paulin, Mikhail V. Saramud, A. S. Kubrikova:
Application of sequential processing of computer vision methods for solving the problem of detecting the edges of a honeycomb block. CoRR abs/2010.13837 (2020) - [i1]Maksim V. Kubrikov, I. I. Pikalov, Mikhail V. Saramud:
Rigid chain in parallel kinematic positioning system. CoRR abs/2012.08250 (2020)
2010 – 2019
- 2019
- [c2]Mikhail V. Saramud, Igor V. Kovalev, Vasiliy V. Losev, Anna A. Voroshilova:
Multiple Start Modifications of Ant Colony Algorithm for Multiversion Software Design. ICSI (1) 2019: 191-201 - 2018
- [c1]Mikhail V. Saramud, Igor V. Kovalev, Vasiliy V. Losev, M. V. Karaseva, Dmitry I. Kovalev:
On the Application of a Modified Ant Algorithm to Optimize the Structure of a Multiversion Software Package. ICSI (1) 2018: 91-100
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-09 13:03 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
