Skip to search formSkip to main contentSkip to account menu

Comparison sort

Known as: Comparison 
A comparison sort is a type of sorting algorithm that only reads the list elements through a single abstract comparison operation (often a "less than… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2012
2012
This paper presents a comparative study of compositional and annotative modeling approaches for software process lines. In our… 
2010
2010
Le mecanisme de Becker-DeGroot-Marschak (BDM) est compare a un mecanisme de choix discret pour determiner les dispositions a… 
2007
2007
Network management requires a lot of manual work. Due to ongoing growth of the Internet, more self-management is needed in order… 
Review
2001
Review
2001
The latest microprocessor roadmaps show not only ever-increasing performance and speed, but also the demand for higher currents… 
1995
1995
A description of a use of Pareto optimality in genetic programming is given and an analogy with Genetic Algorithm fitness niches… 
1985
1985
A solution to the problem of measuring a standard inductor in terms of the unit of capacitance using a stable ac two-phase… 
1983
1983
A steady-state, one-phase, Stefan problem corresponding to the solidification process of an ingot of pure metal by continuous… 
1983
1983
Seven Yamato and six Allan Hills polymict eucrite specimens were compared by modal analysis. The analyses reveal differences of… 
1966
1966
Abstract : Techniques for use in man-machine effectiveness analysis are limited by the current lack of empirical data on human…