MARC보기
LDR01755nam u200409 4500
001000000419475
00520190215163715
008181129s2018 |||||||||||||||||c||eng d
020 ▼a 9780438377462
035 ▼a (MiAaPQ)AAI10840528
035 ▼a (MiAaPQ)duke:14841
040 ▼a MiAaPQ ▼c MiAaPQ ▼d 247004
0820 ▼a 004
1001 ▼a Kell, Nathaniel.
24510 ▼a Algorithms for Allocation Problems in Online Settings.
260 ▼a [S.l.]: ▼b Duke University., ▼c 2018.
260 1 ▼a Ann Arbor: ▼b ProQuest Dissertations & Theses, ▼c 2018.
300 ▼a 161 p.
500 ▼a Source: Dissertation Abstracts International, Volume: 80-02(E), Section: B.
500 ▼a Adviser: Debmalya Panigrahi.
5021 ▼a Thesis (Ph.D.)--Duke University, 2018.
520 ▼a A fundamental computational challenge that arises in the operation of online systems, services, and platforms is that of resource allocation . Broadly defined, a resource allocation problem is one where set of users generate demands, which then
520 ▼a In this thesis, we examine resource allocation problems in online settings, focusing on problems in data center scheduling and internet advertising. Our results are summarized as follows.
520 ▼a &bull
520 ▼a &bull
590 ▼a School code: 0066.
650 4 ▼a Computer science.
690 ▼a 0984
71020 ▼a Duke University. ▼b Computer Science.
7730 ▼t Dissertation Abstracts International ▼g 80-02B(E).
773 ▼t Dissertation Abstract International
790 ▼a 0066
791 ▼a Ph.D.
792 ▼a 2018
793 ▼a English
85640 ▼u http://www.riss.kr/pdu/ddodLink.do?id=T14999734 ▼n KERIS ▼z 이 자료의 원문은 한국교육학술정보원에서 제공합니다.
980 ▼a 201812 ▼f 2019
990 ▼a ***1012033