Results 21 to 30 of about 1,285,719 (263)
Hybrid Fuzzy C-Means Clustering Algorithm Oriented to Big Data Realms
Axioms, 2022 A hybrid variant of the Fuzzy C-Means and K-Means algorithms is proposed to solve large datasets such as those presented in Big Data. The Fuzzy C-Means algorithm is sensitive to the initial values of the membership matrix.
Joaquín Pérez-Ortega +6 more
doaj +1 more source
On Parameterized Exponential Time Complexity
Theoretical Computer Science, 2009 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jianer Chen, Iyad A. Kanj, Ge Xia
openaire +1 more source
A Comprehensive Evaluation of Graph Kernels for Unattributed Graphs
Entropy, 2018 Graph kernels are of vital importance in the field of graph comparison and classification. However, how to compare and evaluate graph kernels and how to choose an optimal kernel for a practical classification problem remain open problems.
Yi Zhang, Lulu Wang, Liandong Wang
doaj +1 more source
On a New Formula for Fibonacci’s Family m-step Numbers and Some Applications
Mathematics, 2019 In this work, we obtain a new formula for Fibonacci’s family m-step sequences. We use our formula to find the nth term with less time complexity than the matrix multiplication method.
Monther Rashed Alfuraidan +1 more
doaj +1 more source
Fast Algorithms for Basic Supply Chain Scheduling Problems
Mathematics, 2020 A basic supply chain scheduling problem in which the orders released over time are to be delivered into the batches with unlimited capacity is considered.
Nodari Vakhania, Badri Mamporia
doaj +1 more source
Edge decompositions of multigraphs into multi-2-paths [PDF]
Opuscula Mathematica, 2004 We establish the computational time complexity of the existence problem of a decomposition of an instance multigraph into isomorphic 3-vertex paths with multiple edges.
Jan Kratochvil +3 more
doaj
CAAI Transactions on Intelligence Technology, 2019 Differential evolution (DE) is a robust, efficient and simple evolutionary algorithm for various optimisation and engineering problems. It has several outstanding features such as low time complexity, ease to use and robust steadiness.
Xinchao Zhao +3 more
doaj +1 more source
Shape matching and object recognition using common base triangle area
IET Computer Vision, 2015 Shape matching has always been a key issue in the field of computer vision. To obtain high recognition accuracy with low time complexity and to reduce the influence of contour deformation due to noise in shape matching, a novel shape matching method ...
Dameng Hu +4 more
doaj +1 more source
Time complexity of iterative-deepening-A∗
Artificial Intelligence, 2001 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Richard E. Korf +2 more
openaire +2 more sources
Online algorithms for scheduling transactions on python software transactional memory [PDF]
Serbian Journal of Electrical Engineering, 2019 Designing online transaction scheduling algorithms is challenging because one needs to reconcile three opposing requirements: (i) they should be fast, (ii) they should minimize make span and maximize throughput, and (iii) they should produce ...
Popović Marko +3 more
doaj +1 more source