메뉴 건너뛰기




Volumn , Issue , 2002, Pages 395-400

Accelerated SAT-based scheduling of control/data flow graphs

Author keywords

[No Author keywords available]

Indexed keywords

ADDERS; ALGORITHMS; BOOLEAN FUNCTIONS; COMPUTATIONAL COMPLEXITY; GRAPH THEORY; LINEAR PROGRAMMING; OPTIMIZATION; RESOURCE ALLOCATION;

EID: 0036398348     PISSN: 10636404     EISSN: None     Source Type: Journal    
DOI: 10.1109/ICCD.2002.1106801     Document Type: Article
Times cited : (23)

References (13)
  • 1
    • 0028728185 scopus 로고
    • Analyzing and exploiting the structure of the constraints in the ILP-approach to the scheduling problem
    • December
    • S. Chaudhuri, R.A. Walker, and J.E. Mitchell, "Analyzing and Exploiting the Structure of the Constraints in the ILP-Approach to the Scheduling Problem", IEEE Transactions on Very Large Scale Integration (VLSI) System, 2(4) pp. 456-471, December 1994.
    • (1994) IEEE Transactions on Very Large Scale Integration (VLSI) System , vol.2 , Issue.4 , pp. 456-471
    • Chaudhuri, S.1    Walker, R.A.2    Mitchell, J.E.3
  • 3
    • 0027660748 scopus 로고
    • Global optimization approach for architectural synthesis
    • Sep
    • C. H. Gebotys, M. Elmasry, "Global Optimization Approach for Architectural Synthesis", IEEE Trans. CAD/ICAS, 12(9), pp. 1266-1278, Sep. 1993.
    • (1993) IEEE Trans. CAD/ICAS , vol.12 , Issue.9 , pp. 1266-1278
    • Gebotys, C.H.1    Elmasry, M.2
  • 6
    • 0024942755 scopus 로고    scopus 로고
    • A new integer linear programming formulation for the scheduling problem in data path synthesis
    • J. H. Lee, Y. C. Hsu, Y. L. Lin, "A New Integer Linear Programming Formulation for the Scheduling Problem in Data Path Synthesis", Design Automation Conference, 1989.
    • Design Automation Conference, 1989
    • Lee, J.H.1    Hsu, Y.C.2    Lin, Y.L.3


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