Search alternatives:
processing algorithm » processing algorithms (Expand Search)
element processing » melt processing (Expand Search)
data algorithm » jaya algorithm (Expand Search), deer algorithm (Expand Search)
processing algorithm » processing algorithms (Expand Search)
element processing » melt processing (Expand Search)
data algorithm » jaya algorithm (Expand Search), deer algorithm (Expand Search)
-
41
-
42
An enhanced quorum selection algorithm
Published 2009Get full text
Get full text
Get full text
article -
43
An Improved Quorum Selection Algorithm
Published 2008Get full text
Get full text
Get full text
Get full text
conferenceObject -
44
Robust Control Of Sampled Data Systems
Published 2020“…The authors present robust stability bounds for sampled data systems. …”
Get full text
article -
45
Robust control of sampled data systems
Published 1998“…The authors present robust stability bounds for sampled data systems. …”
Get full text
Get full text
article -
46
Robust Control Of Sampled Data Systems
Published 2020“…The authors present robust stability bounds for sampled data systems. …”
Get full text
article -
47
Robust Control Of Sampled Data Systems
Published 2020“…The authors present robust stability bounds for sampled data systems. …”
Get full text
article -
48
Artificial Intelligence for the Prediction and Early Diagnosis of Pancreatic Cancer: Scoping Review
Published 2023“…PubMed, Google Scholar, Science Direct, BioRXiv, and MedRxiv were explored to identify relevant articles. Study selection and data extraction were independently conducted by 2 reviewers. …”
-
49
Oversampling techniques for imbalanced data in regression
Published 2024“…For such high-dimension data our approach outperforms the Synthetic Minority Oversampling Technique for Regression (SMOTER) algorithm for the IMDB-WIKI and AgeDB image datasets. …”
-
50
-
51
Data Redundancy Management in Connected Environments
Published 2020“…., building) equipped with sensors that produce and exchange raw data. Although the sensed data is considered to contain useful and valuable information, yet it might include various inconsistencies such as data redundancies, anomalies, and missing values. …”
Get full text
Get full text
Get full text
Get full text
conferenceObject -
52
Unsupervised outlier detection in multidimensional data
Published 2022“…<p>Detection and removal of outliers in a dataset is a fundamental preprocessing task without which the analysis of the data can be misleading. Furthermore, the existence of anomalies in the data can heavily degrade the performance of machine learning algorithms. …”
-
53
Graph Contraction for Mapping Data on Parallel Computers
Published 1994“…The mapping solution for the original problem is obtained by a straightforward interpolation. We then present experimental results on using contracted graphs as inputs to two physical optimization methods; namely, genetic algorithm and simulated annealing. …”
Get full text
Get full text
Get full text
article -
54
An improved kernelization algorithm for r-Set Packing
Published 2010Get full text
Get full text
Get full text
article -
55
Mapping realistic data sets on parallel computers
Published 1993“…The authors propose reducing the problem size by a mapping-oriented graph contraction technique. They present a graph contraction (GC) heuristic algorithm that yields a smaller representation of the problem, to which mapping is then applied. …”
Get full text
Get full text
Get full text
Get full text
conferenceObject -
56
Scatter Search algorithm for Protein Structure Prediction
Published 2016“…In this paper, we present a Scatter Search (SS) algorithm for predicting 3D structures of proteins based on torsion angles representation. …”
Get full text
Get full text
Get full text
article -
57
Parallel genetic algorithm for disease-gene association
Published 2011“…In this work, we combine few successful strategies from the literature and present a parallel genetic algorithm for the Tag SNP Selection problem. …”
Get full text
Get full text
Get full text
Get full text
conferenceObject -
58
A kernelization algorithm for d-Hitting Set
Published 2010“…For a given parameterized problem, π, a kernelization algorithm is a polynomial-time pre-processing procedure that transforms an arbitrary instance of π into an equivalent one whose size depends only on the input parameter(s). …”
Get full text
Get full text
Get full text
article -
59
A SIMULATED ANNEALING ALGORITHM FOR THE CLUSTERING PROBLEM
Published 2020“…In this paper we discuss the solution of the clustering problem usually solved by the K-means algorithm. The problem is known to have local minimum solutions which are usually what the K-means algorithm obtains. …”
Get full text
article -
60
Particle swarm optimization algorithm: review and applications
Published 2024“…The main procedure of the PSO algorithm is presented. Future researchers can use the collected data in this survey as baseline information on the PSO and PSO's applications.…”
Get full text