Live briefing
Everything about Hybrid algorithm
Algorithm made by combining other algorithms which solve the same problem
In mathematics and computer science, a hybrid algorithm is an algorithm that combines two or more other algorithms that solve the same problem, either choosing one based on some characteristic of the data, or switching between them over the course of the algorithm. This is generally done to combine desired features of each, so that the overall algorithm is better than the individual components. Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: Hybrid algorithmA 5-minute orientation
- Skim a recent paper: AOAAO: The Hybrid Algorithm of Arithmetic Optimization Algorithm With Aquila OptimizerInfluential work since 2022
- Pick up a classic book: Hybrid Artificial Intelligent SystemsThe most-reprinted book on the subject
- Read the landmark paper: Interactive search algorithm: A new hybrid metaheuristic optimization algorithmCited 90 times
- Go sideways: IntroselectA closely related topic
- Go sideways: IntrosortA closely related topic
📖 Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
Interactive search algorithm: A new hybrid metaheuristic optimization algorithm
A hybrid intelligent genetic algorithm
Hybrid parallel chaos optimization algorithm with harmony search algorithm
Hybrid Differential Artificial Bee Colony Algorithm
Algorithm 509: A Hybrid Profile Reduction Algorithm [F1]
Low Latency Hybrid CORDIC Algorithm
Hybrid Bellman–Ford–Dijkstra algorithm
Hybrid learning clonal selection algorithm
🆕 Influential since 2022
AOAAO: The Hybrid Algorithm of Arithmetic Optimization Algorithm With Aquila Optimizer
A hybrid genetic algorithm for distributed hybrid blocking flowshop scheduling problem
Hybrid Global Optimization Algorithm for Feature Selection
A novel hybrid optimization algorithm: Dynamic hybrid optimization algorithm
Multi-Strategy Hybrid Whale Optimization Algorithm Improvement
📚 Books worth reading
Hybrid Artificial Intelligent SystemsEmilio Corchado · 2012
Hybrid Artificial Intelligent SystemsJeng-Shyang Pan, Marios M. Polycarpou · 2013- 📕A constructive approach to hybrid architectures for machine learningJustin Barrows Swore Fletcher · 1994
- 📕Advances in Computational Intelligence and Bioinformatics (Studies in Computational Intelligence)John A. Rose, Mircea Gh. Negoita · 2008
Hybrid Artificial Intelligent SystemsEmilio Corchado · 2011
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- Introselect In computer science, introselect (short for "introspective selection") is a selection algorithm that is a hybrid of quickselect and median of medians which…
- Introsort Introsort or introspective sort is a hybrid sorting algorithm that provides both fast average performance and (asymptotically) optimal worst-case performance…
- Divide-and-conquer algorithm In computer science, divide and conquer, originally a political maxim, designates an algorithm design paradigm. A divide-and-conquer algorithm recursively…
- Sorting algorithm In computer science, a sorting algorithm is an algorithm that puts elements of a list into an order. The most frequently used orders are numerical order…
- Quickselect In computer science, quickselect is a selection algorithm to find the kth smallest element in an unordered list, also known as the kth order statistic…
- Quicksort Quicksort is an efficient, general-purpose sorting algorithm. Quicksort was developed by British computer scientist Tony Hoare in 1959 and published in…
- Recursion (computer science) In computer science, recursion is a method of solving a computational problem where the solution depends on solutions to smaller instances of the same…
- Spreadsort Spreadsort is a sorting algorithm invented by Steven J. Ross in 2002. It combines concepts from distribution-based sorts, such as radix sort and bucket…