Results 201 to 210 of about 151,418 (244)
2025 4th International Conference on Electronics Representation and Algorithm (ICERA)Muh Akbar +2 more
openalex +2 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
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.
Maksim Anatolievich Stepanov +1 more
openaire +2 more sources
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.
Maksim Anatolievich Stepanov +1 more
openaire +2 more sources
Complex Network Analysis of Evolutionary Algorithms Applied to Combinatorial Optimisation Problem
2014This 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.
Michal Pluhacek +3 more
openaire +2 more sources
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), 2016The 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.
Bernd Krause +2 more
openaire +2 more sources
Analysis of Convergence for Free Search Algorithm in Solving Complex Function Optimization Problems
2011Free 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
Xing Yu Wang, Zihou Zhang, Lu Li
openaire +2 more sources
Mapping Analysis in Ontology-based Data Access: Algorithms and Complexity (Extended Abstract)
Description Logics, 2015D. Lembo +4 more
semanticscholar +1 more source
Smoothed Analysis of Algorithms and Heuristics
International Computing and Combinatorics Conference, 2005S. Teng
semanticscholar +1 more source
Navigating financial toxicity in patients with cancer: A multidisciplinary management approach
Ca-A Cancer Journal for Clinicians, 2022Grace Li Smith +2 more
exaly
Analysis of Evolutionary Algorithms for the Longest Common Subsequence Problem
Annual Conference on Genetic and Evolutionary Computation, 2007T. Jansen, D. Weyland
semanticscholar +1 more source
A review of cancer immunotherapy toxicity
Ca-A Cancer Journal for Clinicians, 2020Lucy Boyce Kennedy
exaly