메뉴 건너뛰기




Volumn 2330 LNCS, Issue PART 2, 2002, Pages 1049-1058

The implementation and testing of time-minimal and resource-optimal parallel reversal schedules

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE; COMPUTERS;

EID: 84886837517     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-46080-2_110     Document Type: Conference Paper
Times cited : (5)

References (8)
  • 2
    • 0026858844 scopus 로고
    • Achieving logarithmic growth of temporal and spatial complexity in reverse automatic differentiation
    • Griewank, A.: Achieving logarithmic growth of temporal and spatial complexity in reverse automatic differentiation. Optimisation Methods and Software 1 (1992) 35-54.
    • (1992) Optimisation Methods and Software , vol.1 , pp. 35-54
    • Griewank, A.1
  • 6
    • 84886863631 scopus 로고    scopus 로고
    • Adjoint calculation using time-minimal program reversals for multiprocessor machines
    • Technische Universiẗat Dresden
    • Walther, A., Lehmann, U.: Adjoint calculation using time-minimal program reversals for multiprocessor machines. Technical Report IOKOMO-09-2001, Technische Universiẗat Dresden (2001).
    • (2001) Technical Report IOKOMO-09-2001
    • Walther, A.1    Lehmann, U.2
  • 7
    • 0034550013 scopus 로고    scopus 로고
    • Runge-Kutta methods in optimal control and the transformed adjoint system
    • Hager, W.: Runge-Kutta methods in optimal control and the transformed adjoint system. Numer. Math. 87 (2000) 247-282.
    • (2000) Numer. Math. , vol.87 , pp. 247-282
    • Hager, W.1


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