메뉴 건너뛰기




Volumn , Issue , 2011, Pages 163-171

Faster black-box algorithms through higher arity operators

Author keywords

Black box complexity; Pseudo Boolean optimization; Runtime analysis; Theory

Indexed keywords

BINARY OPERATORS; BLACK BOXES; BLACK-BOX COMPLEXITY; BLACK-BOX MODEL; PSEUDO-BOOLEAN OPTIMIZATION; RUN-TIME ANALYSIS; THEORY; UNARY OPERATORS; VARIATION OPERATOR;

EID: 79955999294     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1967654.1967669     Document Type: Conference Paper
Times cited : (73)

References (9)
  • 4
    • 0037029331 scopus 로고    scopus 로고
    • On the analysis of the (1 + 1) evolutionary algorithm
    • DOI 10.1016/S0304-3975(01)00182-7, PII S0304397501001827
    • S. Droste, T. Jansen, and I. Wegener, On the analysis of the (1 + 1) evolutionary algorithm, Theoretical Computer Science 276 (2002), 51-81. (Pubitemid 34295606)
    • (2002) Theoretical Computer Science , vol.276 , Issue.1-2 , pp. 51-81
    • Droste, S.1    Jansen, T.2    Wegener, I.3
  • 5
    • 33745050688 scopus 로고    scopus 로고
    • Upper and lower bounds for randomized search heuristics in black-box optimization
    • DOI 10.1007/s00224-004-1177-z
    • S. Droste, T. Jansen, and I. Wegener, Upper and lower bounds for randomized search heuristics in black-box optimization, Theoretical Computer Science 39 (2006), 525-544. (Pubitemid 43876884)
    • (2006) Theory of Computing Systems , vol.39 , Issue.4 , pp. 525-544
    • Droste, S.1    Jansen, T.2    Wegener, I.3


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