首页 > 最新文献

On-Line Algorithms最新文献

英文 中文
The Harmonic Online K-Server Algorithm in Competitive 竞争中的谐波在线K-Server算法
On-Line Algorithms
Pub Date : 1900-01-01 DOI: 10.1090/dimacs/007/03
Edward F. Grove
{"title":"The Harmonic Online K-Server Algorithm in Competitive","authors":"Edward F. Grove","doi":"10.1090/dimacs/007/03","DOIUrl":"https://doi.org/10.1090/dimacs/007/03","url":null,"abstract":"","PeriodicalId":388557,"journal":{"name":"On-Line Algorithms","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129659494","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
Navigating in Unfamiliar Geometric Terrain (Extended Summary) 在不熟悉的几何地形中导航(扩展摘要)
On-Line Algorithms
Pub Date : 1900-01-01 DOI: 10.1090/dimacs/007/11
Avrim Blum, P. Raghavan, B. Schieber
{"title":"Navigating in Unfamiliar Geometric Terrain (Extended Summary)","authors":"Avrim Blum, P. Raghavan, B. Schieber","doi":"10.1090/dimacs/007/11","DOIUrl":"https://doi.org/10.1090/dimacs/007/11","url":null,"abstract":"","PeriodicalId":388557,"journal":{"name":"On-Line Algorithms","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121664908","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
The Server Problem and On-Line Games 服务器问题和在线游戏
On-Line Algorithms
Pub Date : 1900-01-01 DOI: 10.1090/dimacs/007/02
M. Chrobak, L. Larmore
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
{"title":"The Server Problem and On-Line Games","authors":"M. Chrobak, L. Larmore","doi":"10.1090/dimacs/007/02","DOIUrl":"https://doi.org/10.1090/dimacs/007/02","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.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123045719","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 100
The K-Server Dual and Loose Competitiveness for Paging 分页的K-Server双竞争和松散竞争
On-Line Algorithms
Pub Date : 1900-01-01 DOI: 10.1090/dimacs/007/04
N. Young
{"title":"The K-Server Dual and Loose Competitiveness for Paging","authors":"N. Young","doi":"10.1090/dimacs/007/04","DOIUrl":"https://doi.org/10.1090/dimacs/007/04","url":null,"abstract":"","PeriodicalId":388557,"journal":{"name":"On-Line Algorithms","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134376992","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 199
A Graph-Theoretic Game and its Application to the k-Server Problem (Extended Abstract) 图论对策及其在k-Server问题中的应用(扩展摘要)
On-Line Algorithms
Pub Date : 1900-01-01 DOI: 10.1090/dimacs/007/01
N. Alon, R. Karp, D. Peleg, D. West
{"title":"A Graph-Theoretic Game and its Application to the k-Server Problem (Extended Abstract)","authors":"N. Alon, R. Karp, D. Peleg, D. West","doi":"10.1090/dimacs/007/01","DOIUrl":"https://doi.org/10.1090/dimacs/007/01","url":null,"abstract":"","PeriodicalId":388557,"journal":{"name":"On-Line Algorithms","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133853739","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
On-line Graph Coloring 联机图着色
On-Line Algorithms
Pub Date : 1900-01-01 DOI: 10.1090/dimacs/007/06
H. Kierstead, W. T. Trotter
{"title":"On-line Graph Coloring","authors":"H. Kierstead, W. T. Trotter","doi":"10.1090/dimacs/007/06","DOIUrl":"https://doi.org/10.1090/dimacs/007/06","url":null,"abstract":"","PeriodicalId":388557,"journal":{"name":"On-Line Algorithms","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126447300","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 38
Visual Searching and Mapping 视觉搜索和映射
On-Line Algorithms
Pub Date : 1900-01-01 DOI: 10.1090/dimacs/007/12
B. Kalyanasundaram, K. Pruhs
{"title":"Visual Searching and Mapping","authors":"B. Kalyanasundaram, K. Pruhs","doi":"10.1090/dimacs/007/12","DOIUrl":"https://doi.org/10.1090/dimacs/007/12","url":null,"abstract":"","PeriodicalId":388557,"journal":{"name":"On-Line Algorithms","volume":"67 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126268251","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 3
On the Competitiveness of Splay Trees: Relations to the Union-Find Problem 论斜树的竞争性:与并查找问题的关系
On-Line Algorithms
Pub Date : 1900-01-01 DOI: 10.1090/dimacs/007/08
Joan M. Lucas
{"title":"On the Competitiveness of Splay Trees: Relations to the Union-Find Problem","authors":"Joan M. Lucas","doi":"10.1090/dimacs/007/08","DOIUrl":"https://doi.org/10.1090/dimacs/007/08","url":null,"abstract":"","PeriodicalId":388557,"journal":{"name":"On-Line Algorithms","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131623361","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 10
A Statistical Adversary for On-line Algorithms 在线算法的统计对手
On-Line Algorithms
Pub Date : 1900-01-01 DOI: 10.1090/dimacs/007/05
P. Raghavan
{"title":"A Statistical Adversary for On-line Algorithms","authors":"P. Raghavan","doi":"10.1090/dimacs/007/05","DOIUrl":"https://doi.org/10.1090/dimacs/007/05","url":null,"abstract":"","PeriodicalId":388557,"journal":{"name":"On-Line Algorithms","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134109517","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 77
Competitive Paging with Locality of Reference (Brief Summary) 具有局部性参考的竞争寻呼(摘要)
On-Line Algorithms
Pub Date : 1900-01-01 DOI: 10.1090/dimacs/007/14
A. Borodin, S. Irani, P. Raghavan, B. Schieber
{"title":"Competitive Paging with Locality of Reference (Brief Summary)","authors":"A. Borodin, S. Irani, P. Raghavan, B. Schieber","doi":"10.1090/dimacs/007/14","DOIUrl":"https://doi.org/10.1090/dimacs/007/14","url":null,"abstract":"","PeriodicalId":388557,"journal":{"name":"On-Line Algorithms","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133942665","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
类型
全部 化学•材料 生命科学 医学 物理 工程技术 环境•农林 材料科学 地球科学 法学 管理学 化学 环境科学与生态学 计算机科学 教育学 经济学 农林科学 人文科学 生物学 数学 物理与天体物理 心理学 综合性期刊 其他 工业工程 理学 历史学 农学 文学 信息工程
数据库
全部 ACS Publications Elsevier ieeexplore Springer The Royal Society of Chemistry Wiley
期刊
On-Line Algorithms
全部 Acc. Chem. Res. ACS Applied Bio Materials ACS Appl. Electron. Mater. ACS Appl. Energy Mater. ACS Appl. Mater. Interfaces ACS Appl. Nano Mater. ACS Appl. Polym. Mater. ACS BIOMATER-SCI ENG ACS Catal. ACS Cent. Sci. ACS Chem. Biol. ACS Chemical Health & Safety ACS Chem. Neurosci. ACS Comb. Sci. ACS Earth Space Chem. ACS Energy Lett. ACS Infect. Dis. ACS Macro Lett. ACS Mater. Lett. ACS Med. Chem. Lett. ACS Nano ACS Omega ACS Photonics ACS Sens. ACS Sustainable Chem. Eng. ACS Synth. Biol. Anal. Chem. BIOCHEMISTRY-US Bioconjugate Chem. BIOMACROMOLECULES Chem. Res. Toxicol. Chem. Rev. Chem. Mater. CRYST GROWTH DES ENERG FUEL Environ. Sci. Technol. Environ. Sci. Technol. Lett. Eur. J. Inorg. Chem. IND ENG CHEM RES Inorg. Chem. J. Agric. Food. Chem. J. Chem. Eng. Data J. Chem. Educ. J. Chem. Inf. Model. J. Chem. Theory Comput. J. Med. Chem. J. Nat. Prod. J PROTEOME RES J. Am. Chem. Soc. LANGMUIR MACROMOLECULES Mol. Pharmaceutics Nano Lett. Org. Lett. ORG PROCESS RES DEV ORGANOMETALLICS J. Org. Chem. J. Phys. Chem. J. Phys. Chem. A J. Phys. Chem. B J. Phys. Chem. C J. Phys. Chem. Lett. Analyst Anal. Methods Biomater. Sci. Catal. Sci. Technol. Chem. Commun. Chem. Soc. Rev. CHEM EDUC RES PRACT CRYSTENGCOMM Dalton Trans. Energy Environ. Sci. ENVIRON SCI-NANO ENVIRON SCI-PROC IMP ENVIRON SCI-WAT RES Faraday Discuss. Food Funct. Green Chem. Inorg. Chem. Front. Integr. Biol. J. Anal. At. Spectrom. J. Mater. Chem. A J. Mater. Chem. B J. Mater. Chem. C Lab Chip Mater. Chem. Front. Mater. Horiz. MEDCHEMCOMM Metallomics Mol. Biosyst. Mol. Syst. Des. Eng. Nanoscale Nanoscale Horiz. Nat. Prod. Rep. New J. Chem. Org. Biomol. Chem. Org. Chem. Front. PHOTOCH PHOTOBIO SCI PCCP Polym. Chem.
﹀
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号：481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们：info@booksci.cn
Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1