메뉴 건너뛰기




Volumn 49, Issue 2-3, 2002, Pages 141-160

Building a basic block instruction scheduler with reinforcement learning and rollouts

Author keywords

Instruction scheduling; Reinforcement learning; Rollouts

Indexed keywords

BENCHMARKING; BLOCK CODES; COMPUTER AIDED INSTRUCTION; COMPUTER ARCHITECTURE; COMPUTER SIMULATION; HEURISTIC PROGRAMMING; LEARNING ALGORITHMS;

EID: 0036832961     PISSN: 08856125     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1017976211990     Document Type: Article
Times cited : (31)

References (26)
  • 10
    • 17244381116 scopus 로고    scopus 로고
    • Least-cost instruction selection in DAGs in NP-complete
    • Proebsting, T.1
  • 16
    • 4243905598 scopus 로고    scopus 로고
    • The character of the instruction scheduling problem
    • University of Massachusetts, Amherst
    • (1997)
    • Stefanović, D.1
  • 22
    • 0008864313 scopus 로고    scopus 로고
    • Constructive function approximation
    • Technical Report UM-CS-97-04, University of Massachusetts, Amherst
    • (1997)
    • Utgoff, P.E.1    Precup, D.2
  • 23
    • 0008864313 scopus 로고    scopus 로고
    • Relative value function approximation
    • Technical Report UM-CS-97-003, University of Massachusetts, Amherst
    • (1997)
    • Utgoff, P.E.1    Precup, D.2


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