发布求助
文献互助 智能选刊 最新文献

Colloquium on Structural Information & Communication Complexity最新文献

筛选
英文 中文
Visiting Infinitely Often the Unit Interval While Minimizing the Idle Time of High Priority Segments 以单位间隔无限次访问，同时最小化高优先级段的空闲时间
Colloquium on Structural Information & Communication Complexity Pub Date : 2019-07-01 DOI: 10.1007/978-3-030-24922-9_30
Oscar Morales-Ponce
{"title":"Visiting Infinitely Often the Unit Interval While Minimizing the Idle Time of High Priority Segments","authors":"Oscar Morales-Ponce","doi":"10.1007/978-3-030-24922-9_30","DOIUrl":"https://doi.org/10.1007/978-3-030-24922-9_30","url":null,"abstract":"","PeriodicalId":116242,"journal":{"name":"Colloquium on Structural Information & Communication Complexity","volume":"222 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121190213","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
Anonymous Read/Write Memory: Leader Election and De-anonymization 匿名读写内存:领导者选举和去匿名化
Colloquium on Structural Information & Communication Complexity Pub Date : 2019-07-01 DOI: 10.1007/978-3-030-24922-9_17
Emmanuel Godard, Damien Imbs, M. Raynal, G. Taubenfeld
{"title":"Anonymous Read/Write Memory: Leader Election and De-anonymization","authors":"Emmanuel Godard, Damien Imbs, M. Raynal, G. Taubenfeld","doi":"10.1007/978-3-030-24922-9_17","DOIUrl":"https://doi.org/10.1007/978-3-030-24922-9_17","url":null,"abstract":"","PeriodicalId":116242,"journal":{"name":"Colloquium on Structural Information & Communication Complexity","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125595653","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}
引用次数: 5
Asynchronous Rendezvous with Different Maps 不同地图的异步会合
Colloquium on Structural Information & Communication Complexity Pub Date : 2019-07-01 DOI: 10.1007/978-3-030-24922-9_11
Serafino Cicerone, G. Stefano, L. Gąsieniec, A. Navarra
{"title":"Asynchronous Rendezvous with Different Maps","authors":"Serafino Cicerone, G. Stefano, L. Gąsieniec, A. Navarra","doi":"10.1007/978-3-030-24922-9_11","DOIUrl":"https://doi.org/10.1007/978-3-030-24922-9_11","url":null,"abstract":"","PeriodicalId":116242,"journal":{"name":"Colloquium on Structural Information & Communication Complexity","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130573627","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
A Strongly-Stabilizing Protocol for Spanning Tree Construction Against a Mobile Byzantine Fault 针对移动拜占庭故障的生成树构造强稳定协议
Colloquium on Structural Information & Communication Complexity Pub Date : 2019-07-01 DOI: 10.1007/978-3-030-24922-9_28
Koki Inoue, Y. Sudo, H. Kakugawa, T. Masuzawa
{"title":"A Strongly-Stabilizing Protocol for Spanning Tree Construction Against a Mobile Byzantine Fault","authors":"Koki Inoue, Y. Sudo, H. Kakugawa, T. Masuzawa","doi":"10.1007/978-3-030-24922-9_28","DOIUrl":"https://doi.org/10.1007/978-3-030-24922-9_28","url":null,"abstract":"","PeriodicalId":116242,"journal":{"name":"Colloquium on Structural Information & Communication Complexity","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133944149","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
Making Randomized Algorithms Self-stabilizing 使随机算法自稳定
Colloquium on Structural Information & Communication Complexity Pub Date : 2019-07-01 DOI: 10.1007/978-3-030-24922-9_21
V. Turau
{"title":"Making Randomized Algorithms Self-stabilizing","authors":"V. Turau","doi":"10.1007/978-3-030-24922-9_21","DOIUrl":"https://doi.org/10.1007/978-3-030-24922-9_21","url":null,"abstract":"","PeriodicalId":116242,"journal":{"name":"Colloquium on Structural Information & Communication Complexity","volume":" 13","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132187557","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}
引用次数: 6
On Sense of Direction and Mobile Agents 关于方向感和移动代理
Colloquium on Structural Information & Communication Complexity Pub Date : 2019-07-01 DOI: 10.1007/978-3-030-24922-9_2
P. Flocchini
{"title":"On Sense of Direction and Mobile Agents","authors":"P. Flocchini","doi":"10.1007/978-3-030-24922-9_2","DOIUrl":"https://doi.org/10.1007/978-3-030-24922-9_2","url":null,"abstract":"","PeriodicalId":116242,"journal":{"name":"Colloquium on Structural Information & Communication Complexity","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121061386","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
Faster Construction of Overlay Networks 更快地构建覆盖网络
Colloquium on Structural Information & Communication Complexity Pub Date : 2019-07-01 DOI: 10.1007/978-3-030-24922-9_18
Thorsten Götte, Kristian Hinnenthal, C. Scheideler
{"title":"Faster Construction of Overlay Networks","authors":"Thorsten Götte, Kristian Hinnenthal, C. Scheideler","doi":"10.1007/978-3-030-24922-9_18","DOIUrl":"https://doi.org/10.1007/978-3-030-24922-9_18","url":null,"abstract":"","PeriodicalId":116242,"journal":{"name":"Colloquium on Structural Information & Communication Complexity","volume":"68 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122292010","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}
引用次数: 8
Explicit and Tight Bounds of the Convergence Time of Average-Based Population Protocols 基于平均的种群协议收敛时间的显式和严格界
Colloquium on Structural Information & Communication Complexity Pub Date : 2019-07-01 DOI: 10.1007/978-3-030-24922-9_29
Yves Mocquard, B. Sericola, E. Anceaume
{"title":"Explicit and Tight Bounds of the Convergence Time of Average-Based Population Protocols","authors":"Yves Mocquard, B. Sericola, E. Anceaume","doi":"10.1007/978-3-030-24922-9_29","DOIUrl":"https://doi.org/10.1007/978-3-030-24922-9_29","url":null,"abstract":"","PeriodicalId":116242,"journal":{"name":"Colloquium on Structural Information & Communication Complexity","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130766985","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
Positional Encoding by Robots with Non-Rigid Movements 非刚性运动机器人的位置编码
Colloquium on Structural Information & Communication Complexity Pub Date : 2019-05-23 DOI: 10.1007/978-3-030-24922-9_7
K. Bose, Ranendu Adhikary, Manash Kumar Kundu, B. Sau
{"title":"Positional Encoding by Robots with Non-Rigid Movements","authors":"K. Bose, Ranendu Adhikary, Manash Kumar Kundu, B. Sau","doi":"10.1007/978-3-030-24922-9_7","DOIUrl":"https://doi.org/10.1007/978-3-030-24922-9_7","url":null,"abstract":"","PeriodicalId":116242,"journal":{"name":"Colloquium on Structural Information & Communication Complexity","volume":"153 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-05-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123088939","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
Infinite Grid Exploration by Disoriented Robots 迷失方向机器人的无限网格探索
Colloquium on Structural Information & Communication Complexity Pub Date : 2019-05-22 DOI: 10.1007/978-3-030-24922-9_25
Quentin Bramas, Stéphane Devismes, P. Lafourcade
{"title":"Infinite Grid Exploration by Disoriented Robots","authors":"Quentin Bramas, Stéphane Devismes, P. Lafourcade","doi":"10.1007/978-3-030-24922-9_25","DOIUrl":"https://doi.org/10.1007/978-3-030-24922-9_25","url":null,"abstract":"","PeriodicalId":116242,"journal":{"name":"Colloquium on Structural Information & Communication Complexity","volume":"116 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-05-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116283995","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}
引用次数: 14
首页 上一页 下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：481959085
Book学术官方微信