Mikhail Posypkin

Orcid: 0000-0002-4143-4353

According to our database1, Mikhail Posypkin authored at least 35 papers between 2000 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
A two-phase heuristic algorithm for power-aware offline scheduling in IaaS clouds.
J. Parallel Distributed Comput., August, 2023

Bicentered Interval Newton Operator for Robot's Workspace Approximation.
Proceedings of the Optimization and Applications - 14th International Conference, 2023

2022
Robot Workspace Approximation with Modified Bicenetred Krawczyk Method.
Proceedings of the Optimization and Applications - 13th International Conference, 2022

Using Artificial Neural Network for Solving Inverse Kinematic Task of 2R Planar Robot-Manipulator.
Proceedings of the 7th International Conference on Digital Technologies in Education, 2022

2021
Preface.
Optim. Methods Softw., 2021

Optimality and Complexity Analysis of a Branch-and-Bound Method in Solving Some Instances of the Subset Sum Problem.
Open Comput. Sci., 2021

Space-filling curves for numerical approximation and visualization of solutions to systems of nonlinear inequalities with applications in robotics.
Appl. Math. Comput., 2021

Techniques for Speeding up H-Core Protein Fitting.
Proceedings of the Optimization and Applications - 12th International Conference, 2021

2020
Piecewise linear bounding functions in univariate global optimization.
Soft Comput., 2020

The scalability analysis of a parallel tree search algorithm.
Optim. Lett., 2020

Preface.
J. Glob. Optim., 2020

2018
Approximating a solution set of nonlinear inequalities.
J. Glob. Optim., 2018

BOINC-Based Branch-and-Bound.
Proceedings of the Supercomputing, 2018

2017
Searching of gapped repeats and subrepetitions in a word.
J. Discrete Algorithms, 2017

Complexity of solving the Subset Sum problem with the branch-and-bound method with domination and cardinality filtering.
Autom. Remote. Control., 2017

2015
Upper bound on the number of steps for solving the subset sum problem by the Branch-and-Bound method.
CoRR, 2015

2014
A deterministic algorithm for global multi-objective optimization.
Optim. Methods Softw., 2014

Efficient Implementation of Branch-and-Bound Method on Desktop Grids.
Comput. Sci., 2014

Method of non-uniform coverages to solve the multicriteria optimization problems with guaranteed accuracy.
Autom. Remote. Control., 2014

2013
A deterministic approach to global box-constrained optimization.
Optim. Lett., 2013

2012
Using BOINC Desktop Grid to Solve Large Scale SAT Problems.
Comput. Sci., 2012

2011
Parallel algorithms for SAT in application to inversion problems of some discrete functions
CoRR, 2011

Parallel Logical Cryptanalysis of the Generator A5/1 in BNB-Grid System.
Proceedings of the Parallel Computing Technologies - 11th International Conference, 2011

A Comparative Study of Different Optimization Algorithms for Molecular Docking.
Proceedings of the 3rd International Workshop on Science Gateways for Life Sciences, 2011

2009
A framework for parallel large-scale global optimization.
Comput. Sci. Res. Dev., 2009

2007
A High-Level Toolkit for Development of Distributed Scientific Applications.
Proceedings of the Parallel Computing Technologies, 2007

2005
Survey of compiler testing methods.
Program. Comput. Softw., 2005

A Fortran Evolution of mpC Parallel Programming Language.
Proceedings of the Parallel Processing and Applied Mathematics, 2005

An Implementation of the Matrix Multiplication Algorithm SUMMA in mpF.
Proceedings of the Parallel Computing Technologies, 2005

2004
Automated Generation of Strictly Conforming Tests Based on Formal Specification of Dynamic Semantics of the Programming Language.
Program. Comput. Softw., 2004

2003
Coverage-driven Automated Compiler Test Suite Generation.
Proceedings of the Workshop on Language Descriptions, Tools and Applications, 2003

Using ASM Specifications for Compiler Testing.
Proceedings of the Abstract State Machines, 2003

2002
Refined Description of the C[] Language.
Program. Comput. Softw., 2002

2001
Compilation of Vector Statements of C[] Language for Architectures with Multilevel Memory Hierarchy.
Program. Comput. Softw., 2001

2000
A language and programming environment for high-performance parallel computing on heterogeneous networks.
Program. Comput. Softw., 2000


  Loading...