服务器问题和在线游戏

On-Line Algorithms Pub Date : 1900-01-01 DOI:10.1090/dimacs/007/02

M. Chrobak, L. Larmore

{"title":"服务器问题和在线游戏","authors":"M. Chrobak, L. Larmore","doi":"10.1090/dimacs/007/02","DOIUrl":null,"url":null,"abstract":"2 The Server Problem 5 2.1 Convex Hulls . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 6 2.2 The Equipoise Algorithm . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 8 2.2.1 Lower Bound . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 16 2.3 The Work Function Algorithm for k Servers . . . . . . . . . . . . . . . . . . . . 17 2.3.1 A Conjectured Outline of the Proof of Optimality . . . . . . . . . . . . 20 2.3.2 WFA is 2-Competitive for 2 Servers . . . . . . . . . . . . . . . . . . . . 22","PeriodicalId":388557,"journal":{"name":"On-Line Algorithms","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"100","resultStr":"{\"title\":\"The Server Problem and On-Line Games\",\"authors\":\"M. Chrobak, L. Larmore\",\"doi\":\"10.1090/dimacs/007/02\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"2 The Server Problem 5 2.1 Convex Hulls . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 6 2.2 The Equipoise Algorithm . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 8 2.2.1 Lower Bound . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 16 2.3 The Work Function Algorithm for k Servers . . . . . . . . . . . . . . . . . . . . 17 2.3.1 A Conjectured Outline of the Proof of Optimality . . . . . . . . . . . . 20 2.3.2 WFA is 2-Competitive for 2 Servers . . . . . . . . . . . . . . . . . . . . 22\",\"PeriodicalId\":388557,\"journal\":{\"name\":\"On-Line Algorithms\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1900-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"100\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"On-Line Algorithms\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1090/dimacs/007/02\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"On-Line Algorithms","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1090/dimacs/007/02","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 100

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

The Server Problem and On-Line Games

2 The Server Problem 5 2.1 Convex Hulls . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 6 2.2 The Equipoise Algorithm . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 8 2.2.1 Lower Bound . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 16 2.3 The Work Function Algorithm for k Servers . . . . . . . . . . . . . . . . . . . . 17 2.3.1 A Conjectured Outline of the Proof of Optimality . . . . . . . . . . . . 20 2.3.2 WFA is 2-Competitive for 2 Servers . . . . . . . . . . . . . . . . . . . . 22

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

On-Line Algorithms

自引率

0.00%

发文量

期刊最新文献

Navigating in Unfamiliar Geometric Terrain (Extended Summary) The Server Problem and On-Line Games Visual Searching and Mapping On-line Graph Coloring The Harmonic Online K-Server Algorithm in Competitive