메뉴 건너뛰기




Volumn 7832 LNCS, Issue , 2013, Pages 169-178

Generalizing hyper-heuristics via apprenticeship learning

Author keywords

apprenticeship learning; generalization; Hyper heuristics; learning by demonstration

Indexed keywords

APPRENTICESHIP LEARNING; COMBINATORIAL PROBLEM; GENERALIZATION; HEURISTIC POLICIES; HYPER-HEURISTICS; LEARNING BY DEMONSTRATION; NEAR-OPTIMAL POLICIES; ONLINE BIN PACKING;

EID: 84875104803     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-37198-1_15     Document Type: Conference Paper
Times cited : (17)

References (17)
  • 5
    • 78149236417 scopus 로고    scopus 로고
    • The scalability of evolved on line bin packing heuristics
    • Srinivasan, D., Wang, L. (eds.) IEEE Computational Intelligence Society, IEEE Press, Singapore
    • Burke, E.K., Hyde, M.R., Kendall, G., Woodward, J.R.: The scalability of evolved on line bin packing heuristics. In: Srinivasan, D., Wang, L. (eds.) 2007 IEEE Congress on Evolutionary Computation, pp. 2530-2537. IEEE Computational Intelligence Society, IEEE Press, Singapore (2007)
    • (2007) 2007 IEEE Congress on Evolutionary Computation , pp. 2530-2537
    • Burke, E.K.1    Hyde, M.R.2    Kendall, G.3    Woodward, J.R.4
  • 8
    • 84889585310 scopus 로고    scopus 로고
    • A Hyperheuristic Approach to Scheduling a Sales Summit
    • Practice and Theory of Automated Timetabling III
    • Cowling, P., Kendall, G., Soubeiga, E.: A Hyperheuristic Approach to Scheduling a Sales Summit. In: Burke, E., Erben, W. (eds.) PATAT 2000. LNCS, vol. 2079, pp. 176-190. Springer, Heidelberg (2001) (Pubitemid 33314601)
    • (2001) LECTURE NOTES in COMPUTER SCIENCE , Issue.2079 , pp. 176-190
    • Cowling, P.1    Kendall, G.2    Soubeiga, E.3
  • 9
    • 0039770199 scopus 로고
    • Probabilistic and parametric learning combinations of local job shop scheduling rules
    • GSIA, Carnegie Mellon University, Pittsburgh
    • Crowston, W.B., Glover, F., Thompson, G.L., Trawick, J.D.: Probabilistic and parametric learning combinations of local job shop scheduling rules. ONR Research memorandum No. 117, GSIA, Carnegie Mellon University, Pittsburgh (1963)
    • (1963) ONR Research Memorandum No. 117
    • Crowston, W.B.1    Glover, F.2    Thompson, G.L.3    Trawick, J.D.4
  • 10
    • 0001947856 scopus 로고
    • Probabilistic learning combinations of local job-shop scheduling rules
    • Prentice-Hall
    • Fisher, H., Thompson, G.L.: Probabilistic learning combinations of local job-shop scheduling rules. In: Industrial Scheduling, pp. 225-251. Prentice-Hall (1963)
    • (1963) Industrial Scheduling , pp. 225-251
    • Fisher, H.1    Thompson, G.L.2
  • 13
    • 51849107520 scopus 로고    scopus 로고
    • A comprehensive analysis of hyper-heuristics
    • Özcan, E., Bilgin, B., Korkmaz, E.: A comprehensive analysis of hyper-heuristics. Intell. Data Anal. 12, 3-23 (2008)
    • (2008) Intell. Data Anal. , vol.12 , pp. 3-23
    • Özcan, E.1    Bilgin, B.2    Korkmaz, E.3
  • 15
    • 84859127392 scopus 로고    scopus 로고
    • Matrix Analysis of Genetic Programming Mutation
    • Moraglio, A., Silva, S., Krawiec, K., Machado, P., Cotta, C. (eds.) EuroGP 2012. Springer, Heidelberg
    • Parkes, A.J., Özcan, E., Hyde, M.R.: Matrix Analysis of Genetic Programming Mutation. In: Moraglio, A., Silva, S., Krawiec, K., Machado, P., Cotta, C. (eds.) EuroGP 2012. LNCS, vol. 7244, pp. 158-169. Springer, Heidelberg (2012)
    • (2012) LNCS , vol.7244 , pp. 158-169
    • Parkes, A.J.1    Özcan, E.2    Hyde, M.R.3
  • 17
    • 35248823635 scopus 로고    scopus 로고
    • Learning a Procedure That Can Solve Hard Bin-Packing Problems: A New GA-Based Approach to Hyper-heuristics
    • Cantú-Paz, E., Foster, J.A., Deb, K., Davis, L., Roy, R., O'Reilly, U.-M., Beyer, H.-G., Standish, R., Kendall, G., Wilson, S., Harman, M., Wegener, J., Dasgupta, D., Potter, M.A., Schultz, A.C., Dowsland, K.A., Jonoska, N., Miller, J. (eds.) GECCO 2003. Springer, Heidelberg
    • Ross, P., Marín-Blázquez, J.G., Schulenburg, S., Hart, E.: Learning a Procedure That Can Solve Hard Bin-Packing Problems: A New GA-Based Approach to Hyper-heuristics. In: Cantú-Paz, E., Foster, J.A., Deb, K., Davis, L., Roy, R., O'Reilly, U.-M., Beyer, H.-G., Standish, R., Kendall, G., Wilson, S., Harman, M., Wegener, J., Dasgupta, D., Potter, M.A., Schultz, A.C., Dowsland, K.A., Jonoska, N., Miller, J. (eds.) GECCO 2003. LNCS, vol. 2724, pp. 1295-1306. Springer, Heidelberg (2003)
    • (2003) LNCS , vol.2724 , pp. 1295-1306
    • Ross, P.1    Marín-Blázquez, J.G.2    Schulenburg, S.3    Hart, E.4


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.