NDLI: No more lunch: analysis of sequential search

Content Provider	IEEE Xplore Digital Library
Author	English, T.
Copyright Year	2004
Description	Author affiliation: IEEE, Lubbock, TX, USA (English, T.)
Abstract	Sequential search algorithms of the type predicated in conservation theorems are studied in their own right. With representation of functions as strings, the sets of test functions and search results are identical. This allows sequential search algorithms to be treated as operators on distributions on functions. Certain distributions, referred to as block uniform, are fixed points for all algorithms. Sequential search preserves the identity of the nearest fixed point and the Kullback-Leibler distance to that point. In practice, distributions of test functions are not block uniform and conservation properties hold to a degree that depends upon distance to the nearest fixed point. Randomized sequential search is also analyzed. Here the search operator generally moves the distribution closer to the nearest fixed point, reducing the potential for poor quality by some measure.
Sponsorship	IEEE Neural Network Soc. Evolutionary Programming Soc. IEE
Starting Page	227
Ending Page	234
File Size	535476
Page Count	8
File Format	PDF
ISBN	0780385152
DOI	10.1109/CEC.2004.1330861
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2004-06-19
Publisher Place	USA
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Testing Time measurement Evolutionary computation Velocity measurement Algorithm design and analysis Terminology Decision trees Extraterrestrial measurements
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Hyper-heuristic decision tree induction

(C+M) Evolution Algorithm Analysis Based on Optimization Measurement Principle

Convergence of evolutionary algorithms in general search spaces

Learning-assisted evolutionary search for scalable function optimization: LEM(ID3)

Analysing the significance of no free lunch theorems on the set of real-world binary problems

A GRATIS theorem for relational optimization

Product Geometric Crossover for the Sudoku Puzzle

A quantitative measurement for different testing methodologies

Experimental validation of a velocity estimation algorithm for speed control of electrical drives

No more lunch: analysis of sequential search

Similar Documents

Hyper-heuristic decision tree induction

(C+M) Evolution Algorithm Analysis Based on Optimization Measurement Principle

Convergence of evolutionary algorithms in general search spaces

Learning-assisted evolutionary search for scalable function optimization: LEM(ID3)

Analysing the significance of no free lunch theorems on the set of real-world binary problems

A GRATIS theorem for relational optimization

Product Geometric Crossover for the Sudoku Puzzle

A quantitative measurement for different testing methodologies

Experimental validation of a velocity estimation algorithm for speed control of electrical drives

No more lunch: analysis of sequential search