상세정보
Export to Refworks부가기능
Algorithms for Allocation Problems in Online Settings
상세 프로파일
| 자료유형 | 학위논문 |
|---|---|
| 서명/저자사항 | Algorithms for Allocation Problems in Online Settings. |
| 개인저자 | Kell, Nathaniel. |
| 단체저자명 | Duke University. Computer Science. |
| 발행사항 | [S.l.]: Duke University., 2018. |
| 발행사항 | Ann Arbor: ProQuest Dissertations & Theses, 2018. |
| 형태사항 | 161 p. |
| 기본자료 저록 | Dissertation Abstracts International 80-02B(E). Dissertation Abstract International |
| ISBN | 9780438377462 |
| 학위논문주기 | Thesis (Ph.D.)--Duke University, 2018. |
| 일반주기 |
Source: Dissertation Abstracts International, Volume: 80-02(E), Section: B.
Adviser: Debmalya Panigrahi. |
| 요약 | 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 |
| 요약 | 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. |
| 요약 | &bull |
| 요약 | &bull |
| 일반주제명 | Computer science. |
| 언어 | 영어 |
| 바로가기 | 
: 이 자료의 원문은 한국교육학술정보원에서 제공합니다. |
