메뉴 건너뛰기





Volumn , Issue , 2000, Pages 79-88

Enhanced fixed-priority scheduling with (m,k)-firm guarantee

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; CONSTRAINT THEORY; POLYNOMIALS; RESOURCE ALLOCATION; SCHEDULING;

EID: 0034473645     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (108)

References (19)
  • Reference 정보가 존재하지 않습니다.

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