메뉴 건너뛰기




Volumn I, Issue , 2005, Pages 312-317

TDMA time slot and turn optimization with evolutionary search techniques

Author keywords

[No Author keywords available]

Indexed keywords

BINARY CODES; EVOLUTIONARY ALGORITHMS; HEURISTIC METHODS; OPTIMIZATION; PROBLEM SOLVING; SCHEDULING;

EID: 33646912489     PISSN: 15301591     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/DATE.2005.299     Document Type: Conference Paper
Times cited : (27)

References (12)
  • 10
    • 21644480237 scopus 로고    scopus 로고
    • Automated design space exploration for embedded computer systems
    • Hewlett-Packard Laboratories
    • G. Snider. Automated design space exploration for embedded computer systems. Technical Report HPL-2001-220, Hewlett-Packard Laboratories, 2001.
    • (2001) Technical Report , vol.HPL-2001-220
    • Snider, G.1
  • 11
    • 0036044485 scopus 로고    scopus 로고
    • A framework for evaluating design tradeoffs in packet processing architectures
    • New Orleans, USA, ACM Press
    • L. Thiele, S. Chakraborty, M. Gries, and S. Künzli, A framework for evaluating design tradeoffs in packet processing architectures. In Proc. 39th Design Automation Conference (DAC), pages 880-885, New Orleans, USA, 2002. ACM Press.
    • (2002) Proc. 39th Design Automation Conference (DAC) , pp. 880-885
    • Thiele, L.1    Chakraborty, S.2    Gries, M.3    Künzli, S.4
  • 12
    • 0004140075 scopus 로고    scopus 로고
    • SPEA2: Improving the strength pareto evolutionary algorithm
    • Gloriastrasse 35, CH-8092 Zurich, Switzerland
    • Eckart Zitzler, Marco Laumanns, and Lothar Thiele. SPEA2: Improving the Strength Pareto Evolutionary Algorithm. Technical Report 103, Gloriastrasse 35, CH-8092 Zurich, Switzerland, 2001.
    • (2001) Technical Report , vol.103
    • Zitzler, E.1    Laumanns, M.2    Thiele, L.3


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