Mikhail Posypkin

Publication Activity (10 Years)

Years Active: 2000-2024
Publications (10 Years): 17

Top Topics

Optimization Problems

Tree Search Algorithm

Top Venues

J. Glob. Optim.

Autom. Remote. Control.

Optim. Methods Softw.

Publications

Daniela Lera, Maria Chiara Nasso, Mikhail Posypkin, Yaroslav D. Sergeyev
Determining solution set of nonlinear inequalities using space-filling curves for finding working spaces of planar robots. J. Glob. Optim. 89 (2) (2024)
Roman Kolpakov, Mikhail Posypkin
Lower time bounds for parallel solving of the subset sum problem by a dynamic programming algorithm. Concurr. Comput. Pract. Exp. 36 (18) (2024)
Artem Maminov, Mikhail Posypkin
Bicentered Interval Newton Operator for Robot's Workspace Approximation. OPTIMA (2023)
Andrei Ignatov, Irina Maslova, Mikhail Posypkin, W. Yang, J. Wu
A two-phase heuristic algorithm for power-aware offline scheduling in IaaS clouds. J. Parallel Distributed Comput. 178 (2023)
Kamila Tanyrbergenova, Tolkyn Mirgalikyzy, Balgaisha Mukanova, Mikhail Posypkin
Using Artificial Neural Network for Solving Inverse Kinematic Task of 2R Planar Robot-Manipulator. DTESI (2022)
Artem Maminov, Mikhail Posypkin
Robot Workspace Approximation with Modified Bicenetred Krawczyk Method. OPTIMA (2022)
Milojica Jacimovic, Mikhail Yu. Khachay, Yury Kochetov, Mikhail Posypkin
Preface. Optim. Methods Softw. 36 (4) (2021)
Andrei Ignatov, Mikhail Posypkin
Techniques for Speeding up H-Core Protein Fitting. OPTIMA (2021)
Roman Kolpakov, Mikhail Posypkin
Optimality and Complexity Analysis of a Branch-and-Bound Method in Solving Some Instances of the Subset Sum Problem. Open Comput. Sci. 11 (1) (2021)
Daniela Lera, Mikhail Posypkin, Yaroslav D. Sergeyev
Space-filling curves for numerical approximation and visualization of solutions to systems of nonlinear inequalities with applications in robotics. Appl. Math. Comput. 390 (2021)
Alexander V. Kononov, Alexander S. Strekalovsky, Mikhail Posypkin, Artem V. Pyatkin
Preface. J. Glob. Optim. 76 (3) (2020)
Roman Kolpakov, Mikhail Posypkin
The scalability analysis of a parallel tree search algorithm. Optim. Lett. 14 (8) (2020)
Mikhail Posypkin, Alexander Usov, Oleg V. Khamisov
Piecewise linear bounding functions in univariate global optimization. Soft Comput. 24 (23) (2020)
Andrei Ignatov, Mikhail Posypkin
BOINC-Based Branch-and-Bound. RuSCDays (2018)
Yuri Evtushenko, Mikhail Posypkin, Larisa Rybak, Andrei Turkin
Approximating a solution set of nonlinear inequalities. J. Glob. Optim. 71 (1) (2018)
Roman M. Kolpakov, Mikhail Posypkin, Si Tu Tant Sin
Complexity of solving the Subset Sum problem with the branch-and-bound method with domination and cardinality filtering. Autom. Remote. Control. 78 (3) (2017)
Roman Kolpakov, Mikhail Podolskiy, Mikhail Posypkin, Nickolay Khrapov
Searching of gapped repeats and subrepetitions in a word. J. Discrete Algorithms (2017)
Roman Kolpakov, Mikhail Posypkin
Upper bound on the number of steps for solving the subset sum problem by the Branch-and-Bound method. CoRR (2015)
Bo Tian, Mikhail Posypkin
Efficient Implementation of Branch-and-Bound Method on Desktop Grids. Comput. Sci. 15 (3) (2014)
Yuri G. Evtushenko, Mikhail Posypkin
Method of non-uniform coverages to solve the multicriteria optimization problems with guaranteed accuracy. Autom. Remote. Control. 75 (6) (2014)
Yu. G. Evtushenko, Mikhail Posypkin
A deterministic algorithm for global multi-objective optimization. Optim. Methods Softw. 29 (5) (2014)
Roman Kolpakov, Mikhail Podolskiy, Mikhail Posypkin, Nickolay Khrapov
Searching of Gapped Repeats and Subrepetitions in a Word. CPM (2014)
Roman Kolpakov, Mikhail Podolskiy, Mikhail Posypkin, Nickolay Khrapov
Searching of gapped repeats and subrepetitions in a word. CoRR (2013)
Yuri Evtushenko, Mikhail Posypkin
A deterministic approach to global box-constrained optimization. Optim. Lett. 7 (4) (2013)
Mikhail Posypkin, Alexander A. Semenov, Oleg Zaikin
Using BOINC Desktop Grid to Solve Large Scale SAT Problems. Comput. Sci. 13 (1) (2012)
Alexander P. Afanasiev, Igor Oferkin, Mikhail Posypkin, Anton Rubtsov, Alexey V. Sulimov, Vladimir B. Sulimov
A Comparative Study of Different Optimization Algorithms for Molecular Docking. IWSG-Life (2011)
Alexander A. Semenov, Oleg Zaikin, Dmitry Bespalov, Mikhail Posypkin
Parallel Logical Cryptanalysis of the Generator A5/1 in BNB-Grid System. PaCT (2011)
Alexander A. Semenov, Oleg Zaikin, Dmitry Bespalov, Mikhail Posypkin
Parallel algorithms for SAT in application to inversion problems of some discrete functions CoRR (2011)
Yuri Evtushenko, Mikhail Posypkin, Israel Sigal
A framework for parallel large-scale global optimization. Comput. Sci. Res. Dev. 23 (3-4) (2009)
Alexander P. Afanasiev, Oleg V. Sukhoroslov, Mikhail Posypkin
A High-Level Toolkit for Development of Distributed Scientific Applications. PaCT (2007)
Alexander S. Kossatchev, Mikhail Posypkin
Survey of compiler testing methods. Program. Comput. Softw. 31 (1) (2005)
Alexey Ya. Kalinov, Ilya Ledovskih, Mikhail Posypkin, Zakhar Levchenko, Vladimir Chizhov
An Implementation of the Matrix Multiplication Algorithm SUMMA in mpF. PaCT (2005)
Alexey Ya. Kalinov, Ilya Ledovskih, Mikhail Posypkin, Zakhar Levchenko, Vladimir Chizhov
A Fortran Evolution of mpC Parallel Programming Language. PPAM (2005)
Alexander S. Kossatchev, P. Kutter, Mikhail Posypkin
Automated Generation of Strictly Conforming Tests Based on Formal Specification of Dynamic Semantics of the Programming Language. Program. Comput. Softw. 30 (4) (2004)
Alexey Ya. Kalinov, Alexander S. Kossatchev, Alexander K. Petrenko, Mikhail Posypkin, Vladimir Shishkov
Coverage-driven Automated Compiler Test Suite Generation. Electron. Notes Theor. Comput. Sci. 82 (3) (2003)
Alexey Ya. Kalinov, Alexander S. Kossatchev, Alexander K. Petrenko, Mikhail Posypkin, Vladimir Shishkov
Using ASM Specifications for Compiler Testing. Abstract State Machines (2003)
Alexey Ya. Kalinov, Alexey L. Lastovetsky, Ilya Ledovskih, Mikhail Posypkin
Refined Description of the C[] Language. Program. Comput. Softw. 28 (6) (2002)
Alexey Ya. Kalinov, Alexey L. Lastovetsky, Ilya Ledovskih, Mikhail Posypkin
Compilation of Vector Statements of C[] Language for Architectures with Multilevel Memory Hierarchy. Program. Comput. Softw. 27 (3) (2001)
Alexey L. Lastovetsky, Alexey Ya. Kalinov, I. N. Ledovskikh, Dmitry Arapov, Mikhail Posypkin
A language and programming environment for high-performance parallel computing on heterogeneous networks. Program. Comput. Softw. 26 (4) (2000)