The Algorithm Selection Problem

作者: John R. Rice

DOI: 10.1016/S0065-2458(08)60520-3

关键词:

摘要: Publisher Summary The problem of selecting an effective algorithm arises in a wide variety situations. This chapter starts with discussion on abstract models: the basic model and associated problems, selection based features, variable performance criteria. One objective this is to explore applicability approximation theory problem. There intimate relationship here that forms appropriate base upon which develop methods. currently lacks much necessary machinery for need new results apply known techniques these circumstances. final pages form sort appendix, lists 15 specific open problems questions area. close between general optimization theory. not surprising since special Most realistic are moderate high dimensionality thus one should expect them be quite complex. consequence most straightforward approaches (even well-conceived ones) likely lead enormous computations best selection. single important part solution choice mapping. It theories give least guidance art solving crucial.

参考文章(11)
Carl de Boor, CADRE: AN ALGORITHM FOR NUMERICAL QUADRATURE Mathematical Software. pp. 417- 449 ,(1971) , 10.1016/B978-0-12-587250-8.50015-1
Robert Piessens, Algorithm for automatic integration Angewandte informatik. pp. 399- 401 ,(1973)
Michael O. Rabin, Theoretical Impediments to Artificial Intelligence. ifip congress. pp. 615- 619 ,(1974)
Edward Grady Coffman, Peter J Denning, None, Operating Systems Theory Prentice Hall Professional Technical Reference. ,(1973)
J. N. Lyness, J. J. Kaganove, Comments on the Nature of Automatic Quadrature Routines ACM Transactions on Mathematical Software. ,vol. 2, pp. 65- 81 ,(1976) , 10.1145/355666.355671
John R. Rice, A Metalgorithm for Adaptive Quadrature Journal of the ACM. ,vol. 22, pp. 61- 82 ,(1975) , 10.1145/321864.321870
Theodosios Pavlidis, Waveform Segmentation Through Functional Approximation IEEE Transactions on Computers. ,vol. C-22, pp. 689- 697 ,(1973) , 10.1109/TC.1973.5009136
T. N. L. Patterson, Algorithm 468: algorithm for automatic numerical integration over a finite interval [D1] Communications of the ACM. ,vol. 16, pp. 694- 699 ,(1973) , 10.1145/355611.362543
J. Casaletto, M. Pickett, J. Rice, A comparison of some numerical integration programs ACM Signum Newsletter. ,vol. 4, pp. 30- 40 ,(1969) , 10.1145/1198442.1198448
W. Morven Gentleman, Algorithm 424: Clenshaw-Curtis quadrature [D1] Communications of the ACM. ,vol. 15, pp. 353- 355 ,(1972) , 10.1145/355602.355603