In computer science, a selection algorithm is an algorithm for finding the k {\displaystyle k} th smallest value in a collection of ordered values, such...

genetic algorithm (GA) is a metaheuristic inspired by the process of natural selection that belongs to the larger class of evolutionary algorithms (EA)....

In artificial intelligence, a behavior selection algorithm, or action selection algorithm, is an algorithm that selects appropriate behaviors or actions...

Selection is a genetic operator in an evolutionary algorithm (EA). An EA is a metaheuristic inspired by biological evolution and aims to solve challenging...

In computer science, selection sort is an in-place comparison sorting algorithm. It has a O(n2) time complexity, which makes it inefficient on large lists...

Algorithm selection (sometimes also called per-instance algorithm selection or offline algorithm selection) is a meta-algorithmic technique to choose...

features and comparatively few samples (data points). A feature selection algorithm can be seen as the combination of a search technique for proposing...

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...

proportionate selection, also known as roulette wheel selection or spinning wheel selection, is a selection technique used in evolutionary algorithms for selecting...

artificial immune systems, clonal selection algorithms are a class of algorithms inspired by the clonal selection theory of acquired immunity that explains...

In computer science, an in-place algorithm is an algorithm that operates directly on the input data structure without requiring extra space proportional...

computer science, introselect (short for "introspective selection") is a selection algorithm that is a hybrid of quickselect and median of medians which...

An algorithm is fundamentally a set of rules or defined procedures that is typically designed and used to solve a specific problem or a broad set of problems...

medians is an approximate median selection algorithm, frequently used to supply a good pivot for an exact selection algorithm, most commonly quickselect, that...

learning process. Algorithms of instance selection can also be applied for removing noisy instances, before applying learning algorithms. This step can improve...

Evolutionary algorithms (EA) reproduce essential elements of biological evolution in a computer algorithm in order to solve "difficult" problems, at least...

the best-suited algorithms are greedy. It is important, however, to note that the greedy algorithm can be used as a selection algorithm to prioritize options...

algorithms are developed is called online optimization. As an example, consider the sorting algorithms selection sort and insertion sort: selection sort...

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...

Truncation selection is a selection method in selective breeding and in evolutionary algorithms from computer science, which selects a certain share of...

In mathematics and computer science, an algorithm (/ˈælɡərɪðəm/ ) is a finite sequence of mathematically rigorous instructions, typically used to solve...

In computer science, the Floyd-Rivest algorithm is a selection algorithm developed by Robert W. Floyd and Ronald L. Rivest that has an optimal expected...

sorting algorithm. Quicksort was developed by British computer scientist Tony Hoare in 1959 and published in 1961. It is still a commonly used algorithm for...

universal portfolio algorithm is a portfolio selection algorithm from the field of machine learning and information theory. The algorithm learns adaptively...

In computer science, a search algorithm is an algorithm designed to solve a search problem. Search algorithms work to retrieve information stored within...

Musser (1997), in which he also introduced introselect, a hybrid selection algorithm based on quickselect (a variant of quicksort), which falls back to...

Differential evolution (DE) is an evolutionary algorithm to optimize a problem by iteratively trying to improve a candidate solution with regard to a...

Divine selection, selection by God Papal selection, selection by clergy Selection (user interface) X Window selection Selection (evolutionary algorithm) Selection...

testing. [citation needed] Adaptive testing, depending on the item selection algorithm, may reduce exposure of some items because examinees typically receive...

computer science and operations research, a memetic algorithm (MA) is an extension of an evolutionary algorithm (EA) that aims to accelerate the evolutionary...