메뉴 건너뛰기




Volumn 3, Issue , 2005, Pages 2499-2505

Using evolutionary techniques to hunt for snakes and coils

Author keywords

[No Author keywords available]

Indexed keywords

CODING THEORY; COMPUTER NETWORK TOPOLOGIES; HYPERCUBES; SEARCH ALGORITHMS;

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

References (13)
  • 1
    • 0003104296 scopus 로고
    • On the construction of snake-in-the-box codes
    • Abbott, H. L. and M. Katchalski. 1991. On the Construction of Snake-In-The-Box Codes. Utilitas Mathematica 40:97-116.
    • (1991) Utilitas Mathematica , vol.40 , pp. 97-116
    • Abbott, H.L.1    Katchalski, M.2
  • 2
    • 27144516937 scopus 로고    scopus 로고
    • April, Personal Communication
    • Brown, W. April, 2004. Personal Communication.
    • (2004)
    • Brown, W.1
  • 6
    • 84938014745 scopus 로고
    • Unit-distance error-checking codes
    • Kautz, W. H. 1958. Unit-Distance Error-Checking Codes. IRE Trans. Electronic Computers 7:179-180.
    • (1958) IRE Trans. Electronic Computers , vol.7 , pp. 179-180
    • Kautz, W.H.1
  • 8
    • 0042713841 scopus 로고
    • What is the maximum length of a d-dimensional snake?
    • Klee, V. 1970. What is the Maximum Length of a d-Dimensional Snake? American Mathematics Monthly 77:63-65.
    • (1970) American Mathematics Monthly , vol.77 , pp. 63-65
    • Klee, V.1


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