Time bounds for selection | RDL Research Database

Keywords

Selection (genetic algorithm)Upper and lower boundsMathematicsFunction (biology)CombinatoricsStatisticsComputer scienceDiscrete mathematicsAlgorithmArtificial intelligenceBiologyGenetics

Affiliated Institutions

Stanford University US

Related Publications

A statistical method for global optimization

Dennis D. Cox , St. John

An algorithm for finding global optima using statistical prediction is presented. Assuming a random function model, lower confidence bounds on predicted values are used for sequ...

2003 298 citations

An Analysis of Several Heuristics for the Traveling Salesman Problem

Daniel J. Rosenkrantz , Richard E. Stearns , Philip Lewis

Several polynomial time algorithms finding “good,” but not necessarily optimal, tours for the traveling salesman problem are considered. We measure the closeness of a tour by th...

1977 SIAM Journal on Computing 781 citations

An algorithm for constructing the aspect graph

William Harry Plantinga , Charles R. Dyer

In this paper we present tight bounds on the maximum size of aspect graphs and give worstcase optimal algorithms for their construction, first in the convex case and then in the...

1986 61 citations

How fast is the k-means method?

Sariel Har-Peled , Bardia Sadri

We present polynomial upper and lower bounds on the number of iterations performed by the k-means method (a.k.a. Lloyd's method) for k-means clustering. Our upper bounds are pol...

2005 Symposium on Discrete Algorithms 46 citations

Fortified-Descent Simplicial Search Method: A General Approach

Paul Tseng

We propose a new simplex-based direct search method for unconstrained minimization of a real-valued function f of n variables. As in other methods of this kind, the intent is to...

1999 SIAM Journal on Optimization 81 citations

Publication Info

Year: 1973
Type: article
Volume: 7
Issue: 4
Pages: 448-461
Citations: 1231
Access: Closed

External Links

View on DOI.org

Social Impact

Altmetric

Time bounds for selection

PlumX Metrics

Social media, news, blog, policy document mentions

Citation Metrics

1231

OpenAlex

Cite This

APA Style

                            
                                
                                    Manuel Blum, 
                                
                                    Robert W. Floyd, 
                                
                                    Vaughan Pratt
                                
                                et al.
                            
                            (1973). 
                            Time bounds for selection. 
                            Journal of Computer and System Sciences
                            , 7
                            (4)
                            , 448-461.
                            https://doi.org/10.1016/s0022-0000(73)80033-9
                        

Identifiers

DOI: 10.1016/s0022-0000(73)80033-9