File Download
  Links for fulltext
     (May Require Subscription)
Supplementary

Conference Paper: Generalization of the no-free-lunch theorem

TitleGeneralization of the no-free-lunch theorem
Authors
KeywordsNature of Search Algorithms
No Free Lunch
Optimization
Issue Date2009
PublisherIEEE. The Journal's web site is located at http://ieeexplore.ieee.org/xpl/conhome.jsp?punumber=1000738
Citation
The 2009 IEEE International Conference on Systems, Man, and Cybernetics (SMC 2009), San Antonio, TX., 11-14 October 2009. In Conference Proceedings od SMC, 2009, p. 4322-4328 How to Cite?
AbstractThe No-Free-Lunch (NFL) Theorem provides a fundamental limit governing all optimization/search algorithms and has successfully drawn attention to theoretical foundation of optimization and search. However, we find several limitations in the original NFL paper. In this work, using results from the nature of search algorithms, we enhance several aspects of the original NFL Theorem. We have identified the properties of deterministic and probabilistic algorithms. We also provide an enumeration proof of the theorem. In addition, we show that the NFL Theorem is still valid for more general performance measures. This work serves as an application of the nature of search algorithms. ©2009 IEEE.
Persistent Identifierhttp://hdl.handle.net/10722/126077
ISBN
ISSN
ISI Accession Number ID
References

 

DC FieldValueLanguage
dc.contributor.authorLam, AYSen_HK
dc.contributor.authorLi, VOKen_HK
dc.date.accessioned2010-10-31T12:08:33Z-
dc.date.available2010-10-31T12:08:33Z-
dc.date.issued2009en_HK
dc.identifier.citationThe 2009 IEEE International Conference on Systems, Man, and Cybernetics (SMC 2009), San Antonio, TX., 11-14 October 2009. In Conference Proceedings od SMC, 2009, p. 4322-4328en_HK
dc.identifier.isbn978-1-4244-2794-9-
dc.identifier.issn1062-922Xen_HK
dc.identifier.urihttp://hdl.handle.net/10722/126077-
dc.description.abstractThe No-Free-Lunch (NFL) Theorem provides a fundamental limit governing all optimization/search algorithms and has successfully drawn attention to theoretical foundation of optimization and search. However, we find several limitations in the original NFL paper. In this work, using results from the nature of search algorithms, we enhance several aspects of the original NFL Theorem. We have identified the properties of deterministic and probabilistic algorithms. We also provide an enumeration proof of the theorem. In addition, we show that the NFL Theorem is still valid for more general performance measures. This work serves as an application of the nature of search algorithms. ©2009 IEEE.en_HK
dc.languageengen_HK
dc.publisherIEEE. The Journal's web site is located at http://ieeexplore.ieee.org/xpl/conhome.jsp?punumber=1000738-
dc.relation.ispartofProceedings of the IEEE International Conference on Systems, Man, and Cybernetics, SMC 2009en_HK
dc.rightsCreative Commons: Attribution 3.0 Hong Kong License-
dc.rightsProceedings of the IEEE International Conference on Systems, Man, and Cybernetics. Copyright © IEEE.-
dc.rights©2009 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.-
dc.subjectNature of Search Algorithmsen_HK
dc.subjectNo Free Lunchen_HK
dc.subjectOptimizationen_HK
dc.titleGeneralization of the no-free-lunch theoremen_HK
dc.typeConference_Paperen_HK
dc.identifier.emailLi, VOK:vli@eee.hku.hken_HK
dc.identifier.authorityLi, VOK=rp00150en_HK
dc.description.naturepublished_or_final_version-
dc.identifier.doi10.1109/ICSMC.2009.5346796en_HK
dc.identifier.scopuseid_2-s2.0-74849104973en_HK
dc.identifier.hkuros181461en_HK
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-74849104973&selection=ref&src=s&origin=recordpageen_HK
dc.identifier.spage4322en_HK
dc.identifier.epage4328en_HK
dc.identifier.isiWOS:000279574602139-
dc.publisher.placeUnited Statesen_HK
dc.description.otherThe 2009 IEEE International Conference on Systems, Man, and Cybernetics (SMC 2009), San Antonio, TX., 11-14 October 2009. In Conference Proceedings od SMC, 2009, p. 4322-4328-
dc.identifier.scopusauthoridLam, AYS=35322184700en_HK
dc.identifier.scopusauthoridLi, VOK=7202621685en_HK

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats