메뉴 건너뛰기




Volumn , Issue , 2011, Pages 849-855

Feature filtering for instance-specific algorithm configuration

Author keywords

Algorithm configuration; CP; Feature selection; SAT

Indexed keywords

CP; EVALUATION FUNCTION; FEATURE FILTERING; NUMERICAL RESULTS; PARAMETERIZED; PERFORMANCE GAIN; RUNTIMES; SAT; TUNING ALGORITHM;

EID: 84855810130     PISSN: 10823409     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICTAI.2011.132     Document Type: Conference Paper
Times cited : (15)

References (33)
  • 1
    • 33644511374 scopus 로고    scopus 로고
    • Fine-tuning of algorithms using fractional experimental design and local search
    • B. Adenso-Diaz and M. Laguna. Fine-tuning of Algorithms using Fractional Experimental Design and Local Search. Operations Research, 54(1):99-114, 2006.
    • (2006) Operations Research , vol.54 , Issue.1 , pp. 99-114
    • Adenso-Diaz, B.1    Laguna, M.2
  • 2
    • 70350773809 scopus 로고    scopus 로고
    • A gender-based genetic algorithm for the automatic configuration of algorithms
    • C. Ansotegui-Gil, M. Sellmann, K. Tierney. A Gender-Based Genetic Algorithm for the Automatic Configuration of Algorithms. CP 2009, 142-157, 2009.
    • (2009) CP 2009 , pp. 142-157
    • Ansotegui-Gil, C.1    Sellmann, M.2    Tierney, K.3
  • 3
    • 84855793561 scopus 로고    scopus 로고
    • ArgoSAT. http://argo.matf.bg.ac.rs/software/.
  • 4
  • 5
    • 0035250831 scopus 로고    scopus 로고
    • Algorithm portfolios
    • DOI 10.1016/S0004-3702(00)00081-3
    • C.P. Gomes and B. Selman. Algorithm Portfolios. Artificial Intelligence, 126(1-2):43-62, 2001. (Pubitemid 32196231)
    • (2001) Artificial Intelligence , vol.126 , Issue.1-2 , pp. 43-62
    • Gomes, C.P.1    Selman, B.2
  • 6
    • 9144231916 scopus 로고    scopus 로고
    • Learning the K in K-means
    • G. Hamerly and C. Elkan. Learning the K in K-Means. NIPS, 2003.
    • (2003) NIPS
    • Hamerly, G.1    Elkan, C.2
  • 7
    • 84855793562 scopus 로고    scopus 로고
    • Adaptive novelty+: Novelty+ with adaptive noise
    • H.H. Hoos. Adaptive Novelty+: Novelty+ with adaptive noise. AAAI, 2002.
    • (2002) AAAI
    • Hoos, H.H.1
  • 8
    • 84855779620 scopus 로고    scopus 로고
    • RSAPS: Reactive scaling and probabilistic smoothing
    • F. Hutter, D. Tompkins, H.H. Hoos. RSAPS: Reactive Scaling And Probabilistic Smoothing. CP, 2002.
    • (2002) CP
    • Hutter, F.1    Tompkins, D.2    Hoos, H.H.3
  • 9
    • 73649115991 scopus 로고    scopus 로고
    • ParamILS: An automatic algorithm configuration framework
    • F. Hutter, H.H. Hoos, K. Leyton-Brown, T. Stuetzle. ParamILS: An Automatic Algorithm Configuration Framework. JAIR, 36:267-306, 2009.
    • (2009) JAIR , vol.36 , pp. 267-306
    • Hutter, F.1    Hoos, H.H.2    Leyton-Brown, K.3    Stuetzle, T.4
  • 11
    • 77956044105 scopus 로고    scopus 로고
    • ISAC - Instance-specific algorithm configuration
    • S. Kadioglu, Y. Malitsky, M. Sellmann, K. Tierney. ISAC - Instance-Specific Algorithm Configuration. ECAI, 751-756, 2010.
    • (2010) ECAI , pp. 751-756
    • Kadioglu, S.1    Malitsky, Y.2    Sellmann, M.3    Tierney, K.4
  • 12
    • 77955002272 scopus 로고    scopus 로고
    • SATenstein: Automatically building local search SAT solvers from components
    • A.R. KhudaBukhsh, L. Xu, H.H. Hoos, K. Leyton-Brown. SATenstein: Automatically Building Local Search SAT Solvers From Components. IJCAI, 2009.
    • (2009) IJCAI
    • KhudaBukhsh, A.R.1    Xu, L.2    Hoos, H.H.3    Leyton-Brown, K.4
  • 14
    • 26444619376 scopus 로고    scopus 로고
    • G2WSAT: Gradient-based greedy WalkSAT
    • C.M. Li and W.Q. Huang. G2WSAT: Gradient-based Greedy WalkSAT. SAT, 3569:158-172, 2005.
    • (2005) SAT , vol.3569 , pp. 158-172
    • Li, C.M.1    Huang, W.Q.2
  • 19
    • 84855782716 scopus 로고    scopus 로고
    • VW: Variable weighting scheme
    • S. Prestwich. VW: Variable Weighting Scheme. SAT, 2005.
    • (2005) SAT
    • Prestwich, S.1
  • 20
    • 0003056605 scopus 로고
    • The algorithm selection problem
    • J.R. Rice. The algorithm selection problem. Advances in Computers, 65-118, 1976.
    • (1976) Advances in Computers , pp. 65-118
    • Rice, J.R.1
  • 21
    • 84855793540 scopus 로고    scopus 로고
    • SAT Competition. http://www.satcomptition.org.
  • 23
    • 49749086726 scopus 로고    scopus 로고
    • Cross-disciplinary perspectives on meta-learning for algorithm selection
    • K.A. Smith-Miles. Cross-disciplinary perspectives on meta-learning for algorithm selection. ACM Comput. Surv., 41(1): 6:1-6:25, 2009.
    • (2009) ACM Comput. Surv. , vol.41 , Issue.1 , pp. 61-625
    • Smith-Miles, K.A.1
  • 24
    • 80053019389 scopus 로고    scopus 로고
    • Latent class models for algorithm portfolio methods
    • B. Silverthorn and R. Miikkulainen. Latent Class Models for Algorithm Portfolio Methods. AAAI, 2010.
    • (2010) AAAI
    • Silverthorn, B.1    Miikkulainen, R.2
  • 25
    • 58349106771 scopus 로고    scopus 로고
    • Additive versus multiplicative clause weighting for SAT
    • J. Thornton, D.N. Pham, S. Bain, V. Ferreira. Additive versus multiplicative clause weighting for SAT. PRICAI, 405-416, 2008.
    • (2008) PRICAI , pp. 405-416
    • Thornton, J.1    Pham, D.N.2    Bain, S.3    Ferreira, V.4
  • 27
    • 0036791948 scopus 로고    scopus 로고
    • A perspective view and survey of meta-learning
    • R. Vilata and Y. Drissi. A perspective view and survey of meta-learning. Artificial Intelligence, Rev. 18, 77-95, 2002.
    • (2002) Artificial Intelligence, Rev. , vol.18 , pp. 77-95
    • Vilata, R.1    Drissi, Y.2
  • 28
    • 84855773850 scopus 로고    scopus 로고
    • Combining adaptive noise and promising decreasing variables in local search for SAT. Solver description
    • W. Wei, C.M. Li, H. Zhang. Combining adaptive noise and promising decreasing variables in local search for SAT. Solver description. SAT Competition, 2007.
    • (2007) SAT Competition
    • Wei, W.1    Li, C.M.2    Zhang, H.3
  • 29
    • 84855809085 scopus 로고    scopus 로고
    • Deterministic and random selection of variables in local search for SAT. Solver description
    • W. Wei, C.M. Li, H. Zhang. Deterministic and random selection of variables in local search for SAT. Solver description. SAT Competition, 2007.
    • (2007) SAT Competition
    • Wei, W.1    Li, C.M.2    Zhang, H.3
  • 31
    • 84890939187 scopus 로고    scopus 로고
    • Hydra: Automatically configuring algorithms for portfolio-based selection
    • L. Xu, H. H. Hoos, K. Leyton-Brown. Hydra: Automatically Configuring Algorithms for Portfolio-Based Selection. AAAI, 2010.
    • (2010) AAAI
    • Xu, L.1    Hoos, H.H.2    Leyton-Brown, K.3
  • 32
    • 84890427025 scopus 로고    scopus 로고
    • SATzilla2009: An automatic algorithm portfolio for SAT. Solver description
    • L. Xu, F. Hutter, H.H. Hoos, K. Leyton-Brown. SATzilla2009: an Automatic Algorithm Portfolio for SAT. Solver description. SAT Competition, 2009.
    • (2009) SAT Competition
    • Xu, L.1    Hutter, F.2    Hoos, H.H.3    Leyton-Brown, K.4
  • 33
    • 52249100995 scopus 로고    scopus 로고
    • SATzilla: Portfolio-based algorithm selection for SAT
    • L. Xu, F. Hutter, H.H. Hoos, K. Leyton-Brown. SATzilla: Portfolio-based Algorithm Selection for SAT. JAIR, 32(1):565-606, 2008.
    • (2008) JAIR , vol.32 , Issue.1 , pp. 565-606
    • Xu, L.1    Hutter, F.2    Hoos, H.H.3    Leyton-Brown, K.4


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