Results 271 to 280 of about 161,341 (310)

Complex Network Analysis of Evolutionary Algorithms Applied to Combinatorial Optimisation Problem

2014
This research analyses the development of a complex network in an evolutionary algorithm (EA). The main aim is to evaluate if a complex network is generated in an EA, and how the population can be evaluated when the objective is to optimise an NP-hard combinatorial optimisation problem.
Donald Davendra, Ivan Zelinka, Roman Senkerik, Michal Pluhacek   +3 more
openaire   +3 more sources

A modified PRP-type conjugate gradient algorithm with complexity analysis and its application to image restoration problems

Journal of Computational and Applied Mathematics, 2023
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Yu Chen, Kai Kuang, Xueling Yan
openaire   +1 more source

Students misconceptions in analysis of algorithmic and computational complexity of problems

Proceedings of the 18th ACM conference on Innovation and technology in computer science education, 2013
Course "Computability and Complexity" allows students to get familiar with limits of computation and degrees of algorithmic (decidable, enumerable, undecidable) and computational (P, NP, NP-complete) complexity of problems. Students learn to use reducibility techniques for analysis of language complexity.
openaire   +1 more source

Computational Complexity Analysis and Algorithm Design for Combinatorial Optimization Problems

2012 Third International Conference on Networking and Computing, 2012
The paper shows summary of the author's research subjects from 1973 through 2012. Additional explanation on these subjects and related references are omitted because of space limitation. They will be given at presentation.
openaire   +2 more sources

Complexity analysis and algorithms for the Inter Cell Interference Coordination with fixed transmit powers problem

2015 7th International Conference on Communication Systems and Networks (COMSNETS), 2015
We study the Inter Cell Interference Coordination problem in a multi-cell OFDMA based cellular network employing universal frequency reuse. In each cell, only a subset of the available subchannels are allocated to mobile stations (MS) in a given time slot so as to limit the interference to neighboring cells; also, each base station (BS) uses a fixed ...
Ashwathi Nambiar, Gaurav S. Kasbekar
openaire   +2 more sources

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   +2 more sources

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