메뉴 건너뛰기




Volumn 45, Issue 1, 2002, Pages 88-100

Optimal scheduling of digital signal processing data-flow graphs using shortest-path algorithms

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTER HARDWARE; DIGITAL SIGNAL PROCESSING; GRAPH THEORY; INPUT OUTPUT PROGRAMS; OPTIMIZATION; PARALLEL ALGORITHMS; PARALLEL PROCESSING SYSTEMS;

EID: 0036171029     PISSN: 00104620     EISSN: None     Source Type: Journal    
DOI: 10.1093/comjnl/45.1.88     Document Type: Article
Times cited : (6)

References (29)


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