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

International Conference on Topics in Theoretical Computer Science最新文献

筛选
英文 中文
Visibility Graphs of Anchor Polygons 锚多边形的可见性图
International Conference on Topics in Theoretical Computer Science Pub Date : 2015-08-26 DOI: 10.1007/978-3-319-28678-5_6
Hossein Boomari, Alireza Zarei
{"title":"Visibility Graphs of Anchor Polygons","authors":"Hossein Boomari, Alireza Zarei","doi":"10.1007/978-3-319-28678-5_6","DOIUrl":"https://doi.org/10.1007/978-3-319-28678-5_6","url":null,"abstract":"","PeriodicalId":225805,"journal":{"name":"International Conference on Topics in Theoretical Computer Science","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-08-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125342798","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}
引用次数: 1
On Symmetric and Choiceless Computation 关于对称和无选择计算
International Conference on Topics in Theoretical Computer Science Pub Date : 2015-08-26 DOI: 10.1007/978-3-319-28678-5_2
A. Dawar
{"title":"On Symmetric and Choiceless Computation","authors":"A. Dawar","doi":"10.1007/978-3-319-28678-5_2","DOIUrl":"https://doi.org/10.1007/978-3-319-28678-5_2","url":null,"abstract":"","PeriodicalId":225805,"journal":{"name":"International Conference on Topics in Theoretical Computer Science","volume":"57 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-08-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133371741","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}
引用次数: 4
Some Properties of Continuous Yao Graph 连续姚图的若干性质
International Conference on Topics in Theoretical Computer Science Pub Date : 2015-08-26 DOI: 10.1007/978-3-319-28678-5_4
D. Bakhshesh, M. Farshi
{"title":"Some Properties of Continuous Yao Graph","authors":"D. Bakhshesh, M. Farshi","doi":"10.1007/978-3-319-28678-5_4","DOIUrl":"https://doi.org/10.1007/978-3-319-28678-5_4","url":null,"abstract":"","PeriodicalId":225805,"journal":{"name":"International Conference on Topics in Theoretical Computer Science","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-08-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116969987","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
Automating the Verification of Realtime Observers Using Probes and the Modal mu-calculus 利用探针和模态微演算实现实时观察者的自动验证
International Conference on Topics in Theoretical Computer Science Pub Date : 2015-08-26 DOI: 10.1007/978-3-319-28678-5_7
Silvano Dal-Zilio, B. Berthomieu
{"title":"Automating the Verification of Realtime Observers Using Probes and the Modal mu-calculus","authors":"Silvano Dal-Zilio, B. Berthomieu","doi":"10.1007/978-3-319-28678-5_7","DOIUrl":"https://doi.org/10.1007/978-3-319-28678-5_7","url":null,"abstract":"","PeriodicalId":225805,"journal":{"name":"International Conference on Topics in Theoretical Computer Science","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-08-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121876579","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
Robots' Cooperation for Finding a Target in Streets 机器人在街道上寻找目标的合作
International Conference on Topics in Theoretical Computer Science Pub Date : 2015-08-26 DOI: 10.1007/978-3-319-28678-5_3
Mohammad Abouei Mehrizi, M. Ghodsi, Azadeh Tabatabaei
{"title":"Robots' Cooperation for Finding a Target in Streets","authors":"Mohammad Abouei Mehrizi, M. Ghodsi, Azadeh Tabatabaei","doi":"10.1007/978-3-319-28678-5_3","DOIUrl":"https://doi.org/10.1007/978-3-319-28678-5_3","url":null,"abstract":"","PeriodicalId":225805,"journal":{"name":"International Conference on Topics in Theoretical Computer Science","volume":"358 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-08-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115871338","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
Minimizing Walking Length in Map Matching 最小化地图匹配中的行走长度
International Conference on Topics in Theoretical Computer Science Pub Date : 2015-08-26 DOI: 10.1007/978-3-319-28678-5_8
Amin Gheibi, A. Maheshwari, J. Sack
{"title":"Minimizing Walking Length in Map Matching","authors":"Amin Gheibi, A. Maheshwari, J. Sack","doi":"10.1007/978-3-319-28678-5_8","DOIUrl":"https://doi.org/10.1007/978-3-319-28678-5_8","url":null,"abstract":"","PeriodicalId":225805,"journal":{"name":"International Conference on Topics in Theoretical Computer Science","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-08-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132928090","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}
引用次数: 9
Deterministic Algorithm for 1-Median 1-Center Two-Objective Optimization Problem 一中一中心二目标优化问题的确定性算法
International Conference on Topics in Theoretical Computer Science Pub Date : 2015-08-26 DOI: 10.1007/978-3-319-28678-5_12
Vahid Roostapour, Iman Kiarazm, Mansoor Davoodi Monfared
{"title":"Deterministic Algorithm for 1-Median 1-Center Two-Objective Optimization Problem","authors":"Vahid Roostapour, Iman Kiarazm, Mansoor Davoodi Monfared","doi":"10.1007/978-3-319-28678-5_12","DOIUrl":"https://doi.org/10.1007/978-3-319-28678-5_12","url":null,"abstract":"","PeriodicalId":225805,"journal":{"name":"International Conference on Topics in Theoretical Computer Science","volume":"62 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-08-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126792902","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}
引用次数: 4
Path Planning with Objectives Minimum Length and Maximum Clearance 以最小长度和最大间隙为目标的路径规划
International Conference on Topics in Theoretical Computer Science Pub Date : 1900-01-01 DOI: 10.1007/978-3-030-57852-7_8
Mansoor Davoodi Monfared, Arman Rouhani, Maryam Sanisales
{"title":"Path Planning with Objectives Minimum Length and Maximum Clearance","authors":"Mansoor Davoodi Monfared, Arman Rouhani, Maryam Sanisales","doi":"10.1007/978-3-030-57852-7_8","DOIUrl":"https://doi.org/10.1007/978-3-030-57852-7_8","url":null,"abstract":"","PeriodicalId":225805,"journal":{"name":"International Conference on Topics in Theoretical Computer Science","volume":"111 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":"117196422","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
Improved Algorithms for Distributed Balanced Clustering 分布式均衡聚类的改进算法
International Conference on Topics in Theoretical Computer Science Pub Date : 1900-01-01 DOI: 10.1007/978-3-030-57852-7_6
Kian Mirjalali, H. Zarrabi-Zadeh
{"title":"Improved Algorithms for Distributed Balanced Clustering","authors":"Kian Mirjalali, H. Zarrabi-Zadeh","doi":"10.1007/978-3-030-57852-7_6","DOIUrl":"https://doi.org/10.1007/978-3-030-57852-7_6","url":null,"abstract":"","PeriodicalId":225805,"journal":{"name":"International Conference on Topics in Theoretical Computer Science","volume":"31 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":"129762059","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
On the Complexity of the Upper r-Tolerant Edge Cover Problem 上容r边盖问题的复杂性
International Conference on Topics in Theoretical Computer Science Pub Date : 1900-01-01 DOI: 10.1007/978-3-030-57852-7_3
Ararat Harutyunyan, M. K. Ghadikolaei, N. Melissinos, J. Monnot, Aris Pagourtzis
{"title":"On the Complexity of the Upper r-Tolerant Edge Cover Problem","authors":"Ararat Harutyunyan, M. K. Ghadikolaei, N. Melissinos, J. Monnot, Aris Pagourtzis","doi":"10.1007/978-3-030-57852-7_3","DOIUrl":"https://doi.org/10.1007/978-3-030-57852-7_3","url":null,"abstract":"","PeriodicalId":225805,"journal":{"name":"International Conference on Topics in Theoretical Computer Science","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":"128275098","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
首页 上一页 下一页 尾页
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学术文献互助群
群 号：604180095
Book学术官方微信