Search
Search Results
-
Canonical Optimization Algorithms
This chapter introduces canonical optimization algorithms, including numerical optimization methods for continuous optimization problems and state...
-
Metaheuristic algorithms and their applications in wireless sensor networks: review, open issues, and challenges
Metaheuristic algorithms have wide applicability, particularly in wireless sensor networks (WSNs), due to their superior skill in solving and...
-
New Algorithms for Steiner Tree Reoptimization
Reoptimization is a setting in which we are given a good approximate solution of an optimization problem instance and a local modification that...
-
Evolution of blockchain consensus algorithms: a review on the latest milestones of blockchain consensus algorithms
Blockchain technology has gained widespread adoption in recent years due to its ability to enable secure and transparent record-kee** and data...
-
Exploring the Solution Space of Cancer Evolution Inference Frameworks for Single-Cell Sequencing Data
In recent years, many algorithmic strategies have been developed to exploit single-cell mutational profiles generated via sequencing experiments of...
-
Designing equitable algorithms
Predictive algorithms are now commonly used to distribute society’s resources and sanctions. But these algorithms can entrench and exacerbate...
-
A survey on binary metaheuristic algorithms and their engineering applications
This article presents a comprehensively state-of-the-art investigation of the engineering applications utilized by binary metaheuristic algorithms....
-
Creating FCM Models from Quantitative Data with Evolutionary Algorithms
The weights of an FCM can be adjusted or entirely learned from data, which addresses limitations when experts are either unsure or unavailable. In...
-
Debiasing Education Algorithms
This systematic literature review investigates the fairness of machine learning algorithms in educational settings, focusing on recent studies and...
-
Machine Learning Applications of Evolutionary and Metaheuristic Algorithms
Evolutionary algorithms and other meta-heuristic approaches enjoy widespread popularity when dealing with challenging engineering design problems...
-
Automated discovery of algorithms from data
To automate the discovery of new scientific and engineering principles, artificial intelligence must distill explicit rules from experimental data....
-
MPF-FS: A multi-population framework based on multi-objective optimization algorithms for feature selection
Feature selection algorithms based on evolutionary computation have continued to emerge, and most of them have achieved outstanding results. However,...
-
Graph Algorithms
We have seen two major classes of algorithms that approach the top-k retrieval problem in their own unique ways. One recursively partitions a vector...
-
Runtime analysis of some hybrid algorithms
A hybrid algorithm combines two or more individual algorithms in order to integrate the advantages of these individual algorithms. In recent years, a...
-
GPU-accelerated relaxed graph pattern matching algorithms
Graph pattern matching is widely used in real-world applications, such as social network analysis. Since the traditional subgraph isomorphism is...
-
Algorithms of Isomorphism of Elementary Conjunctions Checking
AbstractWhen solving artificial intelligence problems related to the study of complex structured objects, a convenient tool for describing such...
-
Standardized validation of vehicle routing algorithms
Designing routing schedules is a pivotal aspect of smart delivery systems. Therefore, the field has been blooming for decades, and numerous...
-
Scientometric analysis of quantum-inspired metaheuristic algorithms
Quantum algorithms, based on the principles of quantum mechanics, offer significant parallel processing capabilities with a wide range of...
-
Pattern matching algorithms in blockchain for network fees reduction
Blockchain received a vast amount of attention in recent years and is still growing. The second generation of blockchain, such as Ethereum, allows...
-
Cutting-plane algorithms for preemptive uniprocessor scheduling problems
Fixed-point iteration algorithms like response time analysis (RTA) and quick processor-demand analysis (QPA) are arguably the most popular ways of...
