Vadim V. Romanuke

Orcid: 0000-0003-3543-3087

Affiliations:
  • Polish Naval Academy, Gdynia, Poland
  • Khmelnitskiy National University, Ukraine (former)


According to our database1, Vadim V. Romanuke authored at least 20 papers between 2013 and 2024.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
DBSCAN Speedup for Time-Serpentine Datasets.
Appl. Comput. Syst., 2024

Pure strategy solutions of the progressive discrete silent duel with generalized identical quadratic accuracy functions.
Discret. Appl. Math., 2024

Deep clustering of the traveling salesman problem to parallelize its solution.
Comput. Oper. Res., 2024

2023
Speedup of the <i>k</i>-Means Algorithm for Partitioning Large Datasets of Flat Points by a Preliminary Partition and Selecting Initial Centroids.
Appl. Comput. Syst., June, 2023

Parallelization of the Traveling Salesman Problem by Clustering its Nodes and Finding the Best Route Passing through the Centroids.
Appl. Comput. Syst., 2023

2022
Nine-Point Iterated Rectangle Dichotomy for Finding All Local Minima of Unknown Bounded Surface.
Appl. Comput. Syst., December, 2022

A Hyper-Heuristic for the Preemptive Single Machine Scheduling Problem to Minimize the Total Weighted Tardiness.
Appl. Comput. Syst., 2022

Finite uniform approximation of two-person games defined on a product of staircase-function infinite spaces.
Int. J. Approx. Reason., 2022

2021
Time Series Smoothing Improving Forecasting.
Appl. Comput. Syst., 2021

Experimental analysis of tardiness in preemptive single machine scheduling.
Expert Syst. Appl., 2021

Online heuristic for the preemptive single machine scheduling problem to minimize the total weighted tardiness.
Comput. Ind. Eng., 2021

2020
A Prototype Model for Semantic Segmentation of Curvilinear Meandering Regions by Deconvolutional Neural Networks.
Appl. Comput. Syst., 2020

2019
Minimal Total Weighted Tardiness in Tight-Tardy Single Machine Preemptive Idling-Free Scheduling.
Appl. Comput. Syst., 2019

An Improvement of the VDSR Network for Single Image Super-Resolution by Truncation and Adjustment of the Learning Rate Parameters.
Appl. Comput. Syst., 2019

2018
An Efficient Technique for Size Reduction of Convolutional Neural Networks after Transfer Learning for Scene Recognition Tasks.
Appl. Comput. Syst., 2018

Smooth Non-increasing Square Spatial Extents of Filters in Convolutional Layers of CNNs for Image Classification Problems.
Appl. Comput. Syst., 2018

2017
Appropriateness of Dropout Layers and Allocation of Their 0.5 Rates across Convolutional Neural Networks for CIFAR-10, EEACL26, and NORB Datasets.
Appl. Comput. Syst., 2017

2016
Approximation of Isomorphic Infinite Two-Person Non-Cooperative Games by Variously Sampling the Players' Payoff Functions and Reshaping Payoff Matrices into Bimatrix Game.
Appl. Comput. Syst., 2016

Optimal Pixel-to-Shift Standard Deviation Ratio for Training 2-Layer Perceptron on Shifted 60 × 80 Images with Pixel Distortion in Classifying Shifting-Distorted Objects.
Appl. Comput. Syst., 2016

2013
Setting the Hidden Layer Neuron Number in Feedforward Neural Network for an Image Recognition Problem under Gaussian Noise of Distortion.
Comput. Inf. Sci., 2013


  Loading...