Results 281 to 290 of about 148,724 (314)

Complexity Analysis of the Parallel Memetic Algorithm for the Pickup and Delivery Problem with Time Windows

2017
Estimating the theoretical complexity of a parallel algorithm can give an impression on how it will perform in practice. However, this complexity analysis is very often omitted in the works from the parallel computation field. In this paper, we theoretically analyze the time complexity of our parallel algorithm for the pickup and delivery problem with ...
Miroslaw Blocho, Jakub Nalepa
openaire   +1 more source

Parameterized complexity analysis and more effective construction methods for ACO algorithms and the euclidean traveling salesperson problem

2013 IEEE Congress on Evolutionary Computation, 2013
We propose a new construction procedure for ant colony optimization (ACO) algorithms working on the Euclidean traveling salesperson problem (TSP) that preserves the ordering on the convex hull of the points in the instance. The procedure is inspired by theoretical analyses for simple evolutionary algorithms that are provably more efficient on instances
Samadhi Nallaperuma, Andrew M. Sutton, Frank Neumann 0001   +2 more
openaire   +1 more source

Approach to the Analysis of the Multidimensional Time Series Based on the UMAP Algorithm in the Problems of the Complex Systems Proactive Maintenance

2020 International Conference on Information Technologies (InfoTech), 2020
The approach to the preliminary analysis of the multidimensional time series, applied to develop the intellectual classifiers in the problems of proactive maintenance of the complex systems, has been studied. It is proposed to execute the data analysis with application of the UMAP algorithm, which implements non-linear dimension reduction of data.
Liliya Anatolievna Demidova, Maksim Anatolievich Stepanov   +1 more
openaire   +1 more source

Problems of tiny changes analysis in complex time series using dynamic time warping algorithm

2016 XIX IEEE International Conference on Soft Computing and Measurements (SCM), 2016
The dynamic time warping algorithm (DTW) as a tool for waveform changes analysis in complex non-stationary signals are described in the article. Focus of the research is in determining and studying of tiny waveform changes in signals. Problems of tiny changes definition and difference between significant tiny change and noise are considered.
Ivan S. Luzyanin, Anton B. Petrochenkov, Bernd Krause   +2 more
openaire   +1 more source

Analysis of Convergence for Free Search Algorithm in Solving Complex Function Optimization Problems

2011
Free Search (FS) algorithm is efficient in solving complex function optimization problems. Convergence of FS is analyzed in two different cases: continuous and discrete space. For continuous space, convergence of FS did not exist for all functions, such as functions containing singular points. However, taking advantage of measure theory, convergence of
Lu Li, Zihou Zhang, Xingyu Wang
openaire   +1 more source

Complexity Analysis, Potential Game Characterization and Algorithms for the Inter-Cell Interference Coordination With Fixed Transmit Power Problem

IEEE Transactions on Vehicular Technology, 2018
We study the inter-cell interference coordination (ICIC) problem in a multicell orthogonal frequency division multiple access based cellular network employing universal frequency reuse. In each cell, only a subset of the available subchannels are allocated to mobile stations (MSs) in a given time slot so as to limit the interference to neighboring ...
Vaibhav Kumar Gupta, Ashwathi Nambiar, Gaurav S. Kasbekar   +2 more
openaire   +2 more sources

Complexity analysis and numerical implementation of a short-step primal-dual algorithm for linear complementarity problems

Applied Mathematics and Computation, 2010
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +1 more source

A New Complexity Analysis for Full-Newton Step Infeasible Interior-Point Algorithm for Horizontal Linear Complementarity Problems

Journal of Optimization Theory and Applications, 2013
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +2 more sources

Complexity analysis and approximation algorithms for the single-machine scheduling problem with workload-dependent maintenance activities

Journal of Scheduling
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Liu, Peihai, Gu, Manzhan, Lu, Xiwen
openaire   +2 more sources

Computational Complexity Analysis of Ant Colony Clustering Algorithms: Application to Student’s Grouping Problem

2022 IEEE International Conference on Systems, Man, and Cybernetics (SMC), 2022
Malak Chniter, Abir Abid, Ilhem Kallel, Slim Kanoun   +3 more
openaire   +1 more source