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

Italian Conference on Theoretical Computer Science最新文献

筛选
英文 中文
Uniform Circle Formation for Fully Semi-, and Asynchronous Opaque Robots with Lights 带光的完全半和异步不透明机器人的均匀圆形成
Italian Conference on Theoretical Computer Science Pub Date : 2023-07-07 DOI: 10.3390/app13137991
Caterina Feletti, C. Mereghetti, Beatrice Palano, Priscilla Raucci
{"title":"Uniform Circle Formation for Fully Semi-, and Asynchronous Opaque Robots with Lights","authors":"Caterina Feletti, C. Mereghetti, Beatrice Palano, Priscilla Raucci","doi":"10.3390/app13137991","DOIUrl":"https://doi.org/10.3390/app13137991","url":null,"abstract":"In the field of robotics, a lot of theoretical models have been settled to formalize multi-agent systems and design distributed algorithms for autonomous robots. Among the most investigated problems for such systems, the study of the Uniform Circle Formation (UCF problem earned a lot of attention for the properties of such a convenient disposition. Such a problem asks robots to move on the plane to form a regular polygon, running a deterministic and distributed algorithm by executing a sequence of look–compute–move cycles. This work aims to solve the UCF problem for a very restrictive model of robots: they are punctiform, anonymous, and indistinguishable. They are completely disoriented, i.e., they share neither the coordinate system nor chirality. Additionally, they are opaque, so collinearities can hide important data for a proper computation. To tackle these system limitations, robots are equipped with a persistent light used to communicate and store a constant amount of information. For such a robot model, this paper presents a solution for UCF for each of the three scheduling modes usually studied in the literature: fully synchronous, semi-synchronous, and asynchronous. Regarding the time complexity, the proposed algorithms use a constant number of cycles (epochs) for fully synchronous (semi-synchronous) robots, and linearly, many epochs in the worst case for asynchronous robots.","PeriodicalId":212849,"journal":{"name":"Italian Conference on Theoretical Computer Science","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-07-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122641494","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 the Parametrized Complexity of the s-Club Cluster Edge Deletion Problem s-Club聚类边删除问题的参数化复杂度
Italian Conference on Theoretical Computer Science Pub Date : 2022-05-22 DOI: 10.48550/arXiv.2205.10834
Fabrizio Montecchiani, Giacomo Ortali, Tommaso Piselli, Alessandra Tappini
{"title":"On the Parametrized Complexity of the s-Club Cluster Edge Deletion Problem","authors":"Fabrizio Montecchiani, Giacomo Ortali, Tommaso Piselli, Alessandra Tappini","doi":"10.48550/arXiv.2205.10834","DOIUrl":"https://doi.org/10.48550/arXiv.2205.10834","url":null,"abstract":"We study the parameterized complexity of the $s$-Club Cluster Edge Deletion problem: Given a graph $G$ and two integers $s ge 2$ and $k ge 1$, is it possible to remove at most $k$ edges from $G$ such that each connected component of the resulting graph has diameter at most $s$? This problem is known to be NP-hard already when $s = 2$. We prove that it admits a fixed-parameter tractable algorithm when parameterized by $s$ and the treewidth of the input graph.","PeriodicalId":212849,"journal":{"name":"Italian Conference on Theoretical Computer Science","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-05-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125420220","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 the Domination Number of t-Constrained de Bruijn Graphs 关于t约束de Bruijn图的支配数
Italian Conference on Theoretical Computer Science Pub Date : 2021-12-20 DOI: 10.46298/dmtcs.8879
T. Calamoneri, A. Monti, B. Sinaimeri
{"title":"On the Domination Number of t-Constrained de Bruijn Graphs","authors":"T. Calamoneri, A. Monti, B. Sinaimeri","doi":"10.46298/dmtcs.8879","DOIUrl":"https://doi.org/10.46298/dmtcs.8879","url":null,"abstract":"Motivated by the work on the domination number of directed de Bruijn graphs\u0000and some of its generalizations, in this paper we introduce a natural\u0000generalization of de Bruijn graphs (directed and undirected), namely\u0000$t$-constrained de Bruijn graphs, where $t$ is a positive integer, and then\u0000study the domination number of these graphs.\u0000 Within the definition of $t$-constrained de Bruijn graphs, de Bruijn and\u0000Kautz graphs correspond to 1-constrained and 2-constrained de Bruijn graphs,\u0000respectively. This generalization inherits many structural properties of de\u0000Bruijn graphs and may have similar applications in interconnection networks or\u0000bioinformatics.\u0000 We establish upper and lower bounds for the domination number on\u0000$t$-constrained de Bruijn graphs both in the directed and in the undirected\u0000case. These bounds are often very close and in some cases we are able to find\u0000the exact value.","PeriodicalId":212849,"journal":{"name":"Italian Conference on Theoretical Computer Science","volume":"152 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-12-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123010266","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
Tracing and Preventing Sharing and Mutation 跟踪和防止共享和突变
Italian Conference on Theoretical Computer Science Pub Date : 2020-11-01 DOI: 10.26686/wgtn.13174931
P. Giannini, M. Servetto, E. Zucca
{"title":"Tracing and Preventing Sharing and Mutation","authors":"P. Giannini, M. Servetto, E. Zucca","doi":"10.26686/wgtn.13174931","DOIUrl":"https://doi.org/10.26686/wgtn.13174931","url":null,"abstract":"Copyright © 2019 for this paper by its authors. We present a type and effect system for tracing and preventing sharing and mutation in imperative languages. That is, on one hand, the type system traces sharing possibly introduced by the evaluation of an expression, so that uniqueness and immutability properties can be easily detected. On the other hand, sharing and mutation can be prevented by type qualifiers which forbid some actions. Sharing is directly represented at the syntactic level as a relation among free variables, thanks to the fact that in the underlying calculus memory is encoded in terms.","PeriodicalId":212849,"journal":{"name":"Italian Conference on Theoretical Computer Science","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132217862","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
System Analysis and Robustness 系统分析与鲁棒性
Italian Conference on Theoretical Computer Science Pub Date : 2019-06-26 DOI: 10.1007/978-3-030-22348-9_4
E. Moggi, Amin Farjudian, Walid Taha
{"title":"System Analysis and Robustness","authors":"E. Moggi, Amin Farjudian, Walid Taha","doi":"10.1007/978-3-030-22348-9_4","DOIUrl":"https://doi.org/10.1007/978-3-030-22348-9_4","url":null,"abstract":"","PeriodicalId":212849,"journal":{"name":"Italian Conference on Theoretical Computer Science","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-06-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131154417","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
Gathering of Robots in a Ring with Mobile Faults 具有移动故障的环形机器人聚集
Italian Conference on Theoretical Computer Science Pub Date : 2019-01-27 DOI: 10.1007/978-3-030-10801-4_14
S. Das, R. Focardi, F. Luccio, Euripides Markou, D. Moro, M. Squarcina
{"title":"Gathering of Robots in a Ring with Mobile Faults","authors":"S. Das, R. Focardi, F. Luccio, Euripides Markou, D. Moro, M. Squarcina","doi":"10.1007/978-3-030-10801-4_14","DOIUrl":"https://doi.org/10.1007/978-3-030-10801-4_14","url":null,"abstract":"","PeriodicalId":212849,"journal":{"name":"Italian Conference on Theoretical Computer Science","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-01-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132517421","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}
引用次数: 18
On Maximal Chain Subgraphs and Covers of Bipartite Graphs 二部图的极大链子图和覆盖
Italian Conference on Theoretical Computer Science Pub Date : 2016-08-17 DOI: 10.1007/978-3-319-44543-4_11
T. Calamoneri, Mattia Gastaldello, A. Mary, M. Sagot, B. Sinaimeri
{"title":"On Maximal Chain Subgraphs and Covers of Bipartite Graphs","authors":"T. Calamoneri, Mattia Gastaldello, A. Mary, M. Sagot, B. Sinaimeri","doi":"10.1007/978-3-319-44543-4_11","DOIUrl":"https://doi.org/10.1007/978-3-319-44543-4_11","url":null,"abstract":"","PeriodicalId":212849,"journal":{"name":"Italian Conference on Theoretical Computer Science","volume":"84 5-6","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-08-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120913735","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
Minimal and Reduced Reversible Automata 最小和简化可逆自动机
Italian Conference on Theoretical Computer Science Pub Date : 2016-07-05 DOI: 10.1007/978-3-319-41114-9_13
G. Lavado, G. Pighizzini, Luca Prigioniero
{"title":"Minimal and Reduced Reversible Automata","authors":"G. Lavado, G. Pighizzini, Luca Prigioniero","doi":"10.1007/978-3-319-41114-9_13","DOIUrl":"https://doi.org/10.1007/978-3-319-41114-9_13","url":null,"abstract":"","PeriodicalId":212849,"journal":{"name":"Italian Conference on Theoretical Computer Science","volume":"78 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-07-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124991706","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}
引用次数: 11
Relating Paths in Transition Systems: the Fall of the Modal mu-Calculus 过渡系统中的关联路径:模态微积分的衰落
Italian Conference on Theoretical Computer Science Pub Date : 2015-08-24 DOI: 10.1007/978-3-662-48057-1_14
C. Dima, Bastien Maubert, S. Pinchinat
{"title":"Relating Paths in Transition Systems: the Fall of the Modal mu-Calculus","authors":"C. Dima, Bastien Maubert, S. Pinchinat","doi":"10.1007/978-3-662-48057-1_14","DOIUrl":"https://doi.org/10.1007/978-3-662-48057-1_14","url":null,"abstract":"","PeriodicalId":212849,"journal":{"name":"Italian Conference on Theoretical Computer Science","volume":"125 33","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-08-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114046854","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}
引用次数: 19
An algebraic characterization of unary two-way transducers 一元双向换能器的代数表征
Italian Conference on Theoretical Computer Science Pub Date : 2014-08-25 DOI: 10.1007/978-3-662-44522-8_17
C. Choffrut, B. Guillon
{"title":"An algebraic characterization of unary two-way transducers","authors":"C. Choffrut, B. Guillon","doi":"10.1007/978-3-662-44522-8_17","DOIUrl":"https://doi.org/10.1007/978-3-662-44522-8_17","url":null,"abstract":"","PeriodicalId":212849,"journal":{"name":"Italian Conference on Theoretical Computer Science","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-08-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129628985","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}
引用次数: 12
下一页 尾页
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学术官方微信