J. T. Postmus
- 1 Blum, M. Floyd. R.W. Pratt, V., Rivest, R.L., and Tarjan, R.E. Time bounds for selection. 1. Computer and System Sciences 7, (1973) 448- 461.Google Scholar
Digital Library
- 2 Boender, C.G.E. Rinnooy Kan, A.H.G., Stougie L., and Timmer. G.T. A stochastic method for global optimization. Mathematical Programming 22, 2 (1982) 125-140.Google ScholarDigital Library
- 3 Feller, W. An introduction to probability theory and its applications. Vol. 1, Wiley, New York (1968).Google Scholar
- 4 Floyd, R.W. and Rivest. R.L. Expected time bounds for selection. Comm. ACM 18, 3 (1975) 165-173. Google ScholarDigital Library
- 5 Gumbel, E.J. Statistics of extremes. Columbia University Press, New York (1958).Google Scholar
- 6 van Eeden, C. and Runnenburg, l.Th. Conditional limit-distributions for the entries in a 2 ~ 2 table. Statistica Neerlandica 14, 2 (1960) 111-126.Google Scholar
Index Terms
- An efficient dynamic selection method
Recommendations
A Probabilistic and Multi-Objective Analysis of Lexicase Selection and ε-Lexicase Selection
Lexicase selection is a parent selection method that considers training cases individually, rather than in aggregate, when performing parent selection. Whereas previous work has demonstrated the ability of lexicase selection to solve difficult problems in ...
Generalized selection via interactive query relaxation
CHI '08: Proceedings of the SIGCHI Conference on Human Factors in Computing SystemsSelection is a fundamental task in interactive applications, typically performed by clicking or lassoing items of interest. However, users may require more nuanced forms of selection. Selecting regions or attributes may be more important than selecting ...
A comparison of selection schemes used in evolutionary algorithms
Evolutionary algorithms are a common probabilistic optimization method based on the model of natural evolution. One important operator in these algorithms is the selection scheme, for which in this paper a new description model, based on fitness ...
Comments