메뉴 건너뛰기




Volumn , Issue , 2010, Pages 210-216

Hydra: Automatically Configuring Algorithms for Portfolio-Based Selection

Author keywords

[No Author keywords available]

Indexed keywords

ITERATIVE METHODS; STOCHASTIC SYSTEMS;

EID: 84890939187     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (27)

References (25)
  • 1
    • 70350773809 scopus 로고    scopus 로고
    • A gender-based genetic algorithm for the automatic configuration of algorithms
    • Ansótegui, C.; Sellmann, M.; and Tierney, K. 2009. A gender-based genetic algorithm for the automatic configuration of algorithms. In Proc. CP, 142-157.
    • (2009) Proc. CP , pp. 142-157
    • Ansótegui, C.1    Sellmann, M.2    Tierney, K.3
  • 2
    • 38148998723 scopus 로고    scopus 로고
    • Improvement strategies for the F-race algorithm: Sampling design and iterative refinement
    • Balaprakash, P.; Birattari, M.; and Stützle, T. 2007. Improvement strategies for the F-race algorithm: Sampling design and iterative refinement. In Hybrid Metaheuristics, 108-122.
    • (2007) Hybrid Metaheuristics , pp. 108-122
    • Balaprakash, P.1    Birattari, M.2    Stützle, T.3
  • 3
    • 33745197794 scopus 로고    scopus 로고
    • Applying machine learning to low knowledge control of optimization algorithms
    • Carchrae, T., and Beck, J. C. 2005. Applying machine learning to low knowledge control of optimization algorithms. Computational Intelligence 21(4):373-387.
    • (2005) Computational Intelligence , vol.21 , Issue.4 , pp. 373-387
    • Carchrae, T.1    Beck, J. C.2
  • 4
    • 0036923148 scopus 로고    scopus 로고
    • Automated discovery of composite sat variable-selection heuristics
    • Fukunaga, A. S. 2002. Automated discovery of composite sat variable-selection heuristics. In Proc. AAAI, 641-648.
    • (2002) Proc. AAAI , pp. 641-648
    • Fukunaga, A. S.1
  • 6
    • 38049181100 scopus 로고    scopus 로고
    • EasySyn++: A tool for automatic synthesis of stochastic local search algorithms
    • Gaspero, L. D., and Schaerf, A. 2007. EasySyn++: A tool for automatic synthesis of stochastic local search algorithms. In Proc. SLS, 177-181.
    • (2007) Proc. SLS , pp. 177-181
    • Gaspero, L. D.1    Schaerf, A.2
  • 8
    • 0026995493 scopus 로고
    • COMPOSER: A probabilistic solution to the utility problem in speed-up learning
    • Gratch, J., and Dejong, G. 1992. COMPOSER: A probabilistic solution to the utility problem in speed-up learning. In Proc. AAAI, 235-240.
    • (1992) Proc. AAAI , pp. 235-240
    • Gratch, J.1    Dejong, G.2
  • 9
    • 85017348041 scopus 로고    scopus 로고
    • Learning techniques for automatic algorithm portfolio selection
    • Guerri, A., and Milano, M. 2004. Learning techniques for automatic algorithm portfolio selection. In Proc. ECAI, 475-479.
    • (2004) Proc. ECAI , pp. 475-479
    • Guerri, A.1    Milano, M.2
  • 10
    • 0031035643 scopus 로고    scopus 로고
    • An economics approach to hard computational problems
    • Huberman, B.; Lukose, R.; and Hogg, T. 1997. An economics approach to hard computational problems. Science 265:51-54.
    • (1997) Science , vol.265 , pp. 51-54
    • Huberman, B.1    Lukose, R.2    Hogg, T.3
  • 11
    • 47349133530 scopus 로고    scopus 로고
    • Boosting verification by automatic tuning of decision procedures
    • Hutter, F.; Babić, D.; Hoos, H. H.; and Hu, A. J. 2007. Boosting verification by automatic tuning of decision procedures. In Proc. FMCAD, 27-34.
    • (2007) Proc. FMCAD , pp. 27-34
    • Hutter, F.1    Babić, D.2    Hoos, H. H.3    Hu, A. J.4
  • 12
    • 73649115991 scopus 로고    scopus 로고
    • ParamILS: An automatic algorithm configuration framework
    • Hutter, F.; Hoos, H. H.; Leyton-Brown, K.; and Stützle, T. 2009. ParamILS: An automatic algorithm configuration framework. JAIR 36:267-306.
    • (2009) JAIR , vol.36 , pp. 267-306
    • Hutter, F.1    Hoos, H. H.2    Leyton-Brown, K.3    Stützle, T.4
  • 13
    • 77955002272 scopus 로고    scopus 로고
    • SATenstein: Automatically building local search SAT solvers from components
    • KhudaBukhsh, A. R.; Xu, L.; Hoos, H. H.; and Leyton-Brown, K. 2009. SATenstein: Automatically building local search SAT solvers from components. In Proc. IJCAI, 517-524.
    • (2009) Proc. IJCAI , pp. 517-524
    • KhudaBukhsh, A. R.1    Xu, L.2    Hoos, H. H.3    Leyton-Brown, K.4
  • 16
    • 68549128640 scopus 로고    scopus 로고
    • Empirical hardness models: Methodology and a case study on combinatorial auctions
    • Leyton-Brown, K.; Nudelman, E.; and Shoham, Y. 2009. Empirical hardness models: Methodology and a case study on combinatorial auctions. Journal of the ACM 56(4):1-52.
    • (2009) Journal of the ACM , vol.56 , Issue.4 , pp. 1-52
    • Leyton-Brown, K.1    Nudelman, E.2    Shoham, Y.3
  • 17
    • 77949584736 scopus 로고    scopus 로고
    • Stochastic offline programming
    • Malitsky, Y., and Sellmann, M. 2009. Stochastic offline programming. In Proc. CP, 784-791.
    • (2009) Proc. CP , pp. 784-791
    • Malitsky, Y.1    Sellmann, M.2
  • 18
    • 0005811668 scopus 로고
    • An analytic learning system for specializing heuristics
    • Minton, S. 1993. An analytic learning system for specializing heuristics. In Proc. IJCAI, 922-929.
    • (1993) Proc. IJCAI , pp. 922-929
    • Minton, S.1
  • 20
    • 33847303915 scopus 로고    scopus 로고
    • Understanding random SAT: Beyond the clauses-to-variables ratio
    • Nudelman, E.; Leyton-Brown, K.; Devkar, A.; Shoham, Y.; and Hoos, H. 2004. Understanding random SAT: Beyond the clauses-to-variables ratio. In Proc. CP, 438-452.
    • (2004) Proc. CP , pp. 438-452
    • Nudelman, E.1    Leyton-Brown, K.2    Devkar, A.3    Shoham, Y.4    Hoos, H.5
  • 22
    • 0003056605 scopus 로고
    • The algorithm selection problem
    • Rice, J. R. 1976. The algorithm selection problem. Advances in Computers 15:65-118.
    • (1976) Advances in Computers , vol.15 , pp. 65-118
    • Rice, J. R.1
  • 23
    • 36349002829 scopus 로고    scopus 로고
    • Combining multiple heuristics online
    • Streeter, M.; Golovin, D.; and Smith, S. F. 2007. Combining multiple heuristics online. In Proc. AAAI, 1197-1203.
    • (2007) Proc. AAAI , pp. 1197-1203
    • Streeter, M.1    Golovin, D.2    Smith, S. F.3
  • 24
    • 52249100995 scopus 로고    scopus 로고
    • SATzilla: portfolio-based algorithm selection for SAT
    • Xu, L.; Hutter, F.; Hoos, H. H.; and Leyton-Brown, K. 2008. SATzilla: portfolio-based algorithm selection for SAT. JAIR 32:565-606.
    • (2008) JAIR , vol.32 , pp. 565-606
    • Xu, L.1    Hutter, F.2    Hoos, H. H.3    Leyton-Brown, K.4


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