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

Frontiers in Algorithmics最新文献

筛选
英文 中文
Equilibrium Analysis of Block Withholding Attack: An Evolutionary Game Perspective 拦网攻击的均衡分析:一个进化博弈的视角
Frontiers in Algorithmics Pub Date : 2022-12-30 DOI: 10.1007/978-3-031-20796-9_6
Zhanghao Yao, Yukun Cheng, Zhiqi Xu
{"title":"Equilibrium Analysis of Block Withholding Attack: An Evolutionary Game Perspective","authors":"Zhanghao Yao, Yukun Cheng, Zhiqi Xu","doi":"10.1007/978-3-031-20796-9_6","DOIUrl":"https://doi.org/10.1007/978-3-031-20796-9_6","url":null,"abstract":"","PeriodicalId":101589,"journal":{"name":"Frontiers in Algorithmics","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-12-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122668433","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
String Rearrangement Inequalities and a Total Order Between Primitive Words 字符串重排不等式和原语词之间的总顺序
Frontiers in Algorithmics Pub Date : 2022-04-24 DOI: 10.48550/arXiv.2204.11213
Ruixi Luo, Taikun Zhu, Kai Jin
{"title":"String Rearrangement Inequalities and a Total Order Between Primitive Words","authors":"Ruixi Luo, Taikun Zhu, Kai Jin","doi":"10.48550/arXiv.2204.11213","DOIUrl":"https://doi.org/10.48550/arXiv.2204.11213","url":null,"abstract":"We study the following rearrangement problem: Given $n$ words, rearrange and concatenate them so that the obtained string is lexicographically smallest (or largest, respectively). We show that this problem reduces to sorting the given words so that their repeating strings are non-decreasing (or non-increasing, respectively), where the repeating string of a word $A$ refers to the infinite string $AAAldots$. Moreover, for fixed size alphabet $Sigma$, we design an $O(L)$ time sorting algorithm of the words (in the mentioned orders), where $L$ denotes the total length of the input words. Hence we obtain an $O(L)$ time algorithm for the rearrangement problem. Finally, we point out that comparing primitive words via comparing their repeating strings leads to a total order, which can further be extended to a total order on the finite words (or all words).","PeriodicalId":101589,"journal":{"name":"Frontiers in Algorithmics","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-04-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130707757","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
Buffer Minimization with Conflicts on a Line 一行上有冲突的缓冲区最小化
Frontiers in Algorithmics Pub Date : 2021-07-01 DOI: 10.1007/978-3-030-59901-0_6
Felix Höhne, R. V. Stee
{"title":"Buffer Minimization with Conflicts on a Line","authors":"Felix Höhne, R. V. Stee","doi":"10.1007/978-3-030-59901-0_6","DOIUrl":"https://doi.org/10.1007/978-3-030-59901-0_6","url":null,"abstract":"","PeriodicalId":101589,"journal":{"name":"Frontiers in Algorithmics","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125318540","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 Energy on Homogeneous Processors with Shared Memory 基于共享内存的同构处理器能耗最小化
Frontiers in Algorithmics Pub Date : 2021-04-01 DOI: 10.1007/978-3-030-59901-0_8
Vincent Chau, Chi Kit Ken Fong, Shengxin Liu, Elaine Yinling Wang, Yong Zhang
{"title":"Minimizing Energy on Homogeneous Processors with Shared Memory","authors":"Vincent Chau, Chi Kit Ken Fong, Shengxin Liu, Elaine Yinling Wang, Yong Zhang","doi":"10.1007/978-3-030-59901-0_8","DOIUrl":"https://doi.org/10.1007/978-3-030-59901-0_8","url":null,"abstract":"","PeriodicalId":101589,"journal":{"name":"Frontiers in Algorithmics","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115238188","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
Single Machine Scheduling Problem with a Flexible Maintenance Revisited 考虑灵活维护的单机调度问题
Frontiers in Algorithmics Pub Date : 2020-10-19 DOI: 10.1007/978-3-030-59901-0_7
Dehua Xu, Limin Xu, Zhijun Xu
{"title":"Single Machine Scheduling Problem with a Flexible Maintenance Revisited","authors":"Dehua Xu, Limin Xu, Zhijun Xu","doi":"10.1007/978-3-030-59901-0_7","DOIUrl":"https://doi.org/10.1007/978-3-030-59901-0_7","url":null,"abstract":"","PeriodicalId":101589,"journal":{"name":"Frontiers in Algorithmics","volume":"188 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-10-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123210816","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
Two-Way Jumping Automata 双向跳跃自动机
Frontiers in Algorithmics Pub Date : 2020-10-19 DOI: 10.1007/978-3-030-59901-0_10
S. Fazekas, Kaito Hoshi, A. Yamamura
{"title":"Two-Way Jumping Automata","authors":"S. Fazekas, Kaito Hoshi, A. Yamamura","doi":"10.1007/978-3-030-59901-0_10","DOIUrl":"https://doi.org/10.1007/978-3-030-59901-0_10","url":null,"abstract":"","PeriodicalId":101589,"journal":{"name":"Frontiers in Algorithmics","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-10-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115250461","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
Approximation Schemes for Subset Sum Ratio Problems 子集和比问题的近似格式
Frontiers in Algorithmics Pub Date : 2020-03-01 DOI: 10.1007/978-3-030-59901-0_9
N. Melissinos, Aris Pagourtzis, Theofilos Triommatis
{"title":"Approximation Schemes for Subset Sum Ratio Problems","authors":"N. Melissinos, Aris Pagourtzis, Theofilos Triommatis","doi":"10.1007/978-3-030-59901-0_9","DOIUrl":"https://doi.org/10.1007/978-3-030-59901-0_9","url":null,"abstract":"","PeriodicalId":101589,"journal":{"name":"Frontiers in Algorithmics","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114185506","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
Complexity results for the proper disconnection of graphs 复杂性导致图的适当断开
Frontiers in Algorithmics Pub Date : 2019-12-21 DOI: 10.1007/978-3-030-59901-0_1
You Chen, Ping Li, Xueliang Li, Yindi Weng
{"title":"Complexity results for the proper disconnection of graphs","authors":"You Chen, Ping Li, Xueliang Li, Yindi Weng","doi":"10.1007/978-3-030-59901-0_1","DOIUrl":"https://doi.org/10.1007/978-3-030-59901-0_1","url":null,"abstract":"","PeriodicalId":101589,"journal":{"name":"Frontiers in Algorithmics","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-12-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133258009","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
New Approximation Algorithms for the Minimum Cycle Cover Problem 最小周期覆盖问题的新逼近算法
Frontiers in Algorithmics Pub Date : 2019-11-01 DOI: 10.1007/978-3-319-78455-7_7
Wei Yu, Zhaohui Liu, Xiaoguang Bao
{"title":"New Approximation Algorithms for the Minimum Cycle Cover Problem","authors":"Wei Yu, Zhaohui Liu, Xiaoguang Bao","doi":"10.1007/978-3-319-78455-7_7","DOIUrl":"https://doi.org/10.1007/978-3-319-78455-7_7","url":null,"abstract":"","PeriodicalId":101589,"journal":{"name":"Frontiers in Algorithmics","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114157317","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}
引用次数: 16
The Inapproximability of k-DominatingSet for Parameterized mathsf AC^0 AC 0 Circuits 参数化数学电路k-支配集的不可逼近性
Frontiers in Algorithmics Pub Date : 2019-04-29 DOI: 10.1007/978-3-030-18126-0_12
Wenxing Lai
{"title":"The Inapproximability of k-DominatingSet for Parameterized mathsf AC^0 AC 0 Circuits","authors":"Wenxing Lai","doi":"10.1007/978-3-030-18126-0_12","DOIUrl":"https://doi.org/10.1007/978-3-030-18126-0_12","url":null,"abstract":"","PeriodicalId":101589,"journal":{"name":"Frontiers in Algorithmics","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-04-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123728978","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
下一页 尾页
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学术官方微信