메뉴 건너뛰기




Volumn , Issue , 2016, Pages 123-136

MCDNN: An approximation-based execution framework for deep stream processing under resource constraints

Author keywords

[No Author keywords available]

Indexed keywords

BUDGET CONTROL; COMPUTER VISION; DISTRIBUTED COMPUTER SYSTEMS; ECONOMIC AND SOCIAL EFFECTS; FLOW MEASUREMENT; MOBILE DEVICES; NATURAL RESOURCES MANAGEMENT; PROBLEM SOLVING; RESOURCE ALLOCATION; SCHEDULING;

EID: 84979939317     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2906388.2906396     Document Type: Conference Paper
Times cited : (398)

References (52)
  • 1
    • 84979911833 scopus 로고    scopus 로고
    • Pwrcheck manual. http://www. westmountainradio.com/pdf/PWRcheckManual.pdf, 2015.
    • (2015) Pwrcheck Manual
  • 7
    • 84878619050 scopus 로고    scopus 로고
    • A primal-dual randomized algorithm for weighted paging
    • N. Bansal, N. Buchbinder, and J. Naor. A primal-dual randomized algorithm for weighted paging. Journal of the ACM (JACM), 59(4): 19, 2012.
    • (2012) Journal of the ACM (JACM) , vol.59 , Issue.4 , pp. 19
    • Bansal, N.1    Buchbinder, N.2    Naor, J.3
  • 8
    • 67650000531 scopus 로고    scopus 로고
    • Online primal-dual algorithms for covering and packing
    • N. Buchbinder and J. Naor. Online primal-dual algorithms for covering and packing. Mathematics of Operations Research, 34(2): 270-286, 2009.
    • (2009) Mathematics of Operations Research , vol.34 , Issue.2 , pp. 270-286
    • Buchbinder, N.1    Naor, J.2
  • 9
    • 33745468622 scopus 로고    scopus 로고
    • A polynomial time approximation scheme for the multiple knapsack problem
    • C. Chekuri and S. Khanna. A polynomial time approximation scheme for the multiple knapsack problem. SIAM Journal on Computing, 35(3): 713-728, 2005.
    • (2005) SIAM Journal on Computing , vol.35 , Issue.3 , pp. 713-728
    • Chekuri, C.1    Khanna, S.2


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