FAQ

Selection algorithm

Known as: Hoare's algorithm, Select algorithm, Selection problem 
In computer science, a selection algorithm is an algorithm for finding the kth smallest number in a list or array; such a number is called the kth… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1957-2018
0500100019572017

Related topics

Related topics

42 relations
AlgorithmAmortized analysisArray data structureC++
(More)

Related mentions per year

Related mentions per year

1936-2018
19401960198020002020
Selection algorithm
Algorithm
Computer science
Search algorithm
C++
Random access

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2005
Highly Cited
2005
Feature selection based on mutual information criteria of max-dependency, max-relevance, and min-redundancy
Feature selection is an important problem for pattern classification systems. We study how to select good features according to… (More)
  • table 1
  • figure 2
  • figure 3
  • figure 4
  • table 2
Is this relevant?
Highly Cited
2002
Highly Cited
2002
Unsupervised Feature Selection Using Feature Similarity
ÐIn this article, we describe an unsupervised feature selection algorithm suitable for data sets, large in both dimension and… (More)
Is this relevant?
Highly Cited
2002
Highly Cited
2002
Low energy adaptive clustering hierarchy with deterministic cluster-head selection
This paper focuses on reducing the power consumption of wireless microsensor networks. Therefore, a communication protocol named… (More)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
2001
Highly Cited
2001
Antenna selection for spatial multiplexing systems with linear receivers
Future cellular systems will employ spatial multiplexing with multiple antennas at both the transmitter and receiver to take… (More)
  • figure 3
  • figure 1
  • figure 2
Is this relevant?
Highly Cited
2001
Highly Cited
2001
Capacity of MIMO systems with antenna selection
We consider the capacity of multiple-input multiple-output systems with reduced complexity. One link-end uses all available… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2000
Highly Cited
2000
The Pareto Envelope-Based Selection Algorithm for Multi-objective Optimisation
We introduce a new multiobjective evolutionary algorithm called PESA (the Pareto Envelope-based Selection Algorithm), in which… (More)
  • figure 1
Is this relevant?
Highly Cited
2000
Highly Cited
2000
Algorithm Selection using Reinforcement Learning
Many computational problems can be solved by multiple algorithms, with different algorithms fastest for different problem sizes… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1997
Highly Cited
1997
Wrappers for Feature Subset Selection
In the feature subset selection problem a learning algorithm is faced with the problem of selecting a relevant subset of features… (More)
  • figure I
  • table 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
1977
Highly Cited
1977
A Branch and Bound Algorithm for Feature Subset Selection
A feature subset selection algorithm based on branch and bound techniques is developed to select the best subset of m features… (More)
  • figure 1
  • figure 2
  • figure 3
  • table I
  • table II
Is this relevant?
Highly Cited
1973
Highly Cited
1973
Time Bounds for Selection
In this paper we present a new selection algorithm, PICK, and derive by an analysis of its efficiency the (surprising) result… (More)
  • figure 1
  • figure 3
Is this relevant?