Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia (opens in a new tab)

Related topics

Related topics

42 relations
AlgorithmAmortized analysisArray data structureC++

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2010
2010
Multiaccess Radio Network Enviroments
Nowadays there is a plethora of independent radio access technologies (RATs), each supporting distinct coverage, mobility, data… 
2008
2008
Fast computation of the median by successive binning
This paper describes a new median algorithm and a median approximation algorithm. The former has O(n) average running time and… 
Review
2008
Review
2008
An optimisation approach to materials handling in surface mines
In the surface mining industry the equipment selection problem involves choosing a fleet of trucks and loaders that have the… 
2007
2007
Solving the Satisfiability Problem Using Finite Learning Automata
A large number of problems that occur in knowledge -representation, learning, VLSI-design, and other areas of artificial… 
Highly Cited
2006
Highly Cited
2006
Accepted for publication in ApJ Preprint typeset using L ATEX style emulateapj v. 6/22/04 QUASARS IN THE COSMOS FIELD
  • 2006
  • Corpus ID: 15071537
Highly Cited
2003
Highly Cited
2003
MIRAI: a solution to seamless access in heterogeneous wireless networks
A key word describing next-generation wireless communications, so called 4G, is "seamless". As part of the e-Japan plan promoted… 
Highly Cited
2003
Highly Cited
2003
A homogeneous sample of sub-damped Lyman α systems- I. Construction of the sample and chemical abundance measurements
In this first paper of a series, we report on the use of quasar spectra obtained with the high-resolution Ultraviolet-Visual… 
1993
1993
On the check base selection problem for fast adders
  • U. Sparmann
  • Digest of Papers Eleventh Annual IEEE VLSI Test…
  • 1993
  • Corpus ID: 28810084
Considers the problem of selecting a suitable check base for on-line error detection by residue codes in fast adders. The… 
1982
1982
Salience: The Key to the Selection Problem in Natural Language Generation
We argue that in domains where a strong notion of salience can be defined, it can be used to provide: (1) an elegant solution to… 
1982
1982
A Selection Model for Systems Development Tools
Selecting from the many currently available systems development methodologies (SDMs) and development techniques is a difficult… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)