Mikhail Posypkin

发表

Constrained Multi-objective Robot’s Design Optimization

Artem Maminov, Mikhail Posypkin, M. Posypkin, 2020, 2020 IEEE Conference of Russian Young Researchers in Electrical and Electronic Engineering (EIConRus).

Efficient Implementation of Branch-and-Bound Method on Desktop Grids

Mikhail Posypkin, Bo Tian, 2014, Comput. Sci..

Optimization and Performance Analysis of Parallel Dynamic Programming Algorithm for Knapsack Problem

Mikhail Posypkin, Lazarev Alexander Alexeevich, 2010 .

Parallel algorithms for SAT in application to inversion problems of some discrete functions pdf

Mikhail Posypkin, Dmitry Bespalov, Alexander A. Semenov, 2011, ArXiv.

A language and programming environment for high-performance parallel computing on heterogeneous networks

Mikhail Posypkin, Alexey L. Lastovetsky, Alexey Kalinov, 2007, Programming and Computer Software.

Survey of Compiler Testing Methods

Mikhail Posypkin, Alexander S. Kossatchev, 2005, Programming and Computer Software.

Compilation of Vector Statements of C[] Language for Architectures with Multilevel Memory Hierarchy

Mikhail Posypkin, Alexey L. Lastovetsky, Alexey Kalinov, 2001, Programming and Computer Software.

The Scalability Analysis of a Parallel Tree Search Algorithm

Mikhail Posypkin, Roman Kolpakov, 2018 .

Comparative analysis of the efficiency of various dynamic programming algorithms for the knapsack problem

Mikhail Posypkin, Si Thu Thant Sin, 2016, 2016 IEEE NW Russia Young Researchers in Electrical and Electronic Engineering Conference (EIConRusNW).

BOINC-Based Branch-and-Bound

Mikhail Posypkin, Andrei Ignatov, 2018, RuSCDays.

Using necessary optimality conditions for acceleration of the nonuniform covering optimization method

Mikhail Posypkin, Yury Evtushenko, Yury G. Evtushenko, 2016 .

The non-uniform covering approach to manipulator workspace assessment

Mikhail Posypkin, Larisa Rybak, Andrei Turkin, 2017, 2017 IEEE Conference of Russian Young Researchers in Electrical and Electronic Engineering (EIConRus).

Approaches to the Determination of the Working Area of Parallel Robots and the Analysis of Their Geometric Characteristics

Mikhail Posypkin, Larisa Rybak, Dmitry Malyshev, 2019 .

Complexity of solving the Subset Sum problem with the branch-and-bound method with domination and cardinality filtering

Mikhail Posypkin, Roman Kolpakov, Si Tu Tant Sin, 2017, Autom. Remote. Control..

On the parallelization of dynamic programming method for knapsack problem

Mikhail Posypkin, Si Thu Thant Sin, 2017 .

Space-filling curves for numerical approximation and visualization of solutions to systems of nonlinear inequalities with applications in robotics

Mikhail Posypkin, Yaroslav D. Sergeyev, Daniela Lera, 2021, Appl. Math. Comput..

Searching of Gapped Repeats and Subrepetitions in a Word

Mikhail Posypkin, Roman Kolpakov, Mikhail Podolskiy, 2014, CPM.

The scalability analysis of a parallel tree search algorithm

Mikhail Posypkin, Roman Kolpakov, 2020, Optim. Lett..

Searching of gapped repeats and subrepetitions in a word

Mikhail Posypkin, Roman Kolpakov, Mikhail Podolskiy, 2017, J. Discrete Algorithms.

Automated Robot’s Workspace Approximation

Mikhail Posypkin, 2019 .

A High-Level Toolkit for Development of Distributed Scientific Applications

Mikhail Posypkin, Oleg Sukhoroslov, Alexander Afanasiev, 2007, PaCT.

Preface

Mikhail Posypkin, Artem V. Pyatkin, Alexander S. Strekalovsky, 2020, J. Glob. Optim..

The mpC Programming Environment for Distributed Memory Machines

Mikhail Posypkin, Ilya Ledovskih, Victor Ivannikov, 1997 .

A Volunteer Computing Project for Solving Geoacoustic Inversion Problems

Mikhail Posypkin, Pavel Petrov, Oleg Zaikin, 2017 .

A Comparative Study of Different Optimization Algorithms for Molecular Docking

Mikhail Posypkin, Anton Rubtsov, Alexander Afanasiev, 2011, IWSG-Life.

A tool for simulating parallel branch-and-bound methods

Yury Orlov, Mikhail Posypkin, Yana Golubeva, 2016 .

Automated Generation of Strictly Conforming Tests Based on Formal Specification of Dynamic Semantics of the Programming Language

Mikhail Posypkin, Alexander S. Kossatchev, P. Kutter, 2004, Programming and Computer Software.

A Fortran Evolution of mpC Parallel Programming Language

Mikhail Posypkin, Alexey Kalinov, Ilya Ledovskih, 2005, PPAM.

A deterministic algorithm for global multi-objective optimization

Mikhail Posypkin, Yuri Evtushenko, Y. Evtushenko, 2014, Optim. Methods Softw..

Using virtualization to protect the proprietary material science applications in volunteer computing

Mikhail Posypkin, Artem R. Oganov, Nikolay P. Khrapov, 2018 .

Concept of a multitask grid system with a flexible allocation of idle computational resources of supercomputers

Mikhail Posypkin, Alexander A. Semenov, Igor Bychkov, 2017 .

Parallel Logical Cryptanalysis of the Generator A5/1 in BNB-Grid System

Mikhail Posypkin, Dmitry Bespalov, Alexander A. Semenov, 2011, PaCT.

Refined Description of the C[] Language

Mikhail Posypkin, Alexey L. Lastovetsky, Alexey Kalinov, 2002, Programming and Computer Software.

Coverage-driven Automated Compiler Test Suite Generation

Alexander K. Petrenko, Mikhail Posypkin, Alexey Kalinov, 2003, Electron. Notes Theor. Comput. Sci..

A Deterministic Algorithm for Global Optimization

Mikhail Posypkin, Yury Evtushenko, Yury G. Evtushenko, 2012 .

Branch and bound method on desktop grid systems

Mikhail Posypkin, Nikolay Khrapov, 2017, 2017 IEEE Conference of Russian Young Researchers in Electrical and Electronic Engineering (EIConRus).

Upper bound on the number of steps for solving the subset sum problem by the Branch-and-Bound method pdf

Mikhail Posypkin, Roman Kolpakov, 2015, ArXiv.

Approximating a solution set of nonlinear inequalities

Mikhail Posypkin, Larisa Rybak, Andrei Turkin, 2018, J. Glob. Optim..

Using ASM Specifications for Compiler Testing

Alexander K. Petrenko, Mikhail Posypkin, Alexey Kalinov, 2003, Abstract State Machines.

Using Simulation for Performance Analysis and Visualization of Parallel Branch-and-Bound Methods

Yury Orlov, Mikhail Posypkin, Yury Evtushenko, 2016 .

An Implementation of the Matrix Multiplication Algorithm SUMMA in mpF

Mikhail Posypkin, Alexey Kalinov, Ilya Ledovskih, 2005, PaCT.

A deterministic approach to global box-constrained optimization

Mikhail Posypkin, Yuri Evtushenko, Y. Evtushenko, 2012, Optimization Letters.

Comparative Performance Study of Shared and Distributed Memory Dynamic Programming Algorithms

Mikhail Posypkin, Si Thu Thant Sin, M. Posypkin, 2020, 2020 IEEE Conference of Russian Young Researchers in Electrical and Electronic Engineering (EIConRus).

A framework for parallel large-scale global optimization

Mikhail Posypkin, Yuri Evtushenko, Israel Sigal, 2009, Computer Science - Research and Development.

Effective Solving Scientific Problems on Heterogeneous Networks with mpC

Mikhail Posypkin, Alexey Lastovetsky, Alexey Kalinov, 2002 .

Implementation and verification of global optimization benchmark problems

Mikhail Posypkin, Alexander Usov, M. Posypkin, 2017 .

Using BOINC Desktop Grid to Solve Large Scale SAT Problems

Mikhail Posypkin, Alexander A. Semenov, Oleg Zaikin, 2012, Comput. Sci..

Method of non-uniform coverages to solve the multicriteria optimization problems with guaranteed accuracy

Mikhail Posypkin, Yuri G. Evtushenko, 2014, Autom. Remote. Control..

A Criterion of Optimality of Some Parallelization Scheme for Backtrack Search Problem in Binary Trees

Mikhail Posypkin, Roman Kolpakov, 2019 .