The No Free Lunch Theorem and the Human-Machine Interface

IEEE Control Systems

Volumn 19, Issue 3, 1999, Pages 8-10

  Ho, Yu Chi ^a  

^a HARVARD UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0001806101     PISSN: 1066033X     EISSN: None     Source Type: Journal    
DOI: 10.1109/37.768535     Document Type: Article

References (7)

1. W.G. Macready and D.H. Wolpert, “The No Free Lunch theorems,” IEEE Trans. Evolutionary Computing, vol. 1, no. 1, pp. 67-82, Apr. 1997.
2. H. Witsenhausen, “Separation of estimation and control for discrete time systems,” Proc. IEEE, vol. 59, pp. 1557-1566, 1971.
3. M.L. Ginsberg, “Do computers need common sense?” Proc. Knowledge Research & Reasoning Conference, 1996.
4. Y.C. Ho, “An explanation of ordinal optimization-soft optimization for hard problems,” Inf. Sci., vol. 113, pp. 169-192, Jan. 1999.
5. D. McAllester, “Some PAC-Bayesian theorems,” Proc. Computational Learning Theory (COLT'98), pp. 230-234.
6. T.W.E. Lau and Y.C. Ho, “Super-heuristics and its application to combinatorial optimization problems,” submitted to the Asian Journal on Control, 1999.
7. T.A. Feo, M.G.C. Resende, and S.H. Smith, “A greedy randomized adaptive search procedure for maximum independence set,” Oper. Res., vol. 42, no. 5, pp. 860-878, 1994.