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

Analysis of Experimental Algorithms - Special Event最新文献

筛选
英文 中文
Fixed Set Search Applied to the Minimum Weighted Vertex Cover Problem 固定集搜索应用于最小加权顶点覆盖问题
Analysis of Experimental Algorithms - Special Event Pub Date : 2019-06-24 DOI: 10.1007/978-3-030-34029-2_31
R. Jovanovic, S. Voß
{"title":"Fixed Set Search Applied to the Minimum Weighted Vertex Cover Problem","authors":"R. Jovanovic, S. Voß","doi":"10.1007/978-3-030-34029-2_31","DOIUrl":"https://doi.org/10.1007/978-3-030-34029-2_31","url":null,"abstract":"","PeriodicalId":186261,"journal":{"name":"Analysis of Experimental Algorithms - Special Event","volume":"74 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115615811","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
Navigating a Shortest Path with High Probability in Massive Complex Networks 大规模复杂网络中的高概率最短路径导航
Analysis of Experimental Algorithms - Special Event Pub Date : 2019-06-24 DOI: 10.1007/978-3-030-34029-2_6
Jun Liu, Yicheng Pan, Qifu Hu, Angsheng Li
{"title":"Navigating a Shortest Path with High Probability in Massive Complex Networks","authors":"Jun Liu, Yicheng Pan, Qifu Hu, Angsheng Li","doi":"10.1007/978-3-030-34029-2_6","DOIUrl":"https://doi.org/10.1007/978-3-030-34029-2_6","url":null,"abstract":"","PeriodicalId":186261,"journal":{"name":"Analysis of Experimental Algorithms - Special Event","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125709047","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
Quantum-Inspired Evolutionary Algorithms for Covering Arrays of Arbitrary Strength 覆盖任意强度阵列的量子启发进化算法
Analysis of Experimental Algorithms - Special Event Pub Date : 2019-06-24 DOI: 10.1007/978-3-030-34029-2_20
Michael Wagner, Ludwig Kampel, D. Simos
{"title":"Quantum-Inspired Evolutionary Algorithms for Covering Arrays of Arbitrary Strength","authors":"Michael Wagner, Ludwig Kampel, D. Simos","doi":"10.1007/978-3-030-34029-2_20","DOIUrl":"https://doi.org/10.1007/978-3-030-34029-2_20","url":null,"abstract":"","PeriodicalId":186261,"journal":{"name":"Analysis of Experimental Algorithms - Special Event","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131503404","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
Computing a Minimum Color Path in Edge-Colored Graphs 计算边缘彩色图的最小颜色路径
Analysis of Experimental Algorithms - Special Event Pub Date : 2019-06-24 DOI: 10.1007/978-3-030-34029-2_3
Neeraj Kumar
{"title":"Computing a Minimum Color Path in Edge-Colored Graphs","authors":"Neeraj Kumar","doi":"10.1007/978-3-030-34029-2_3","DOIUrl":"https://doi.org/10.1007/978-3-030-34029-2_3","url":null,"abstract":"","PeriodicalId":186261,"journal":{"name":"Analysis of Experimental Algorithms - Special Event","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131259449","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
Hacker's Multiple-Precision Integer-Division Program in Close Scrutiny 黑客在严密监视下的多精度整数除法程序
Analysis of Experimental Algorithms - Special Event Pub Date : 2019-06-24 DOI: 10.1007/978-3-030-34029-2_25
J. Katajainen
{"title":"Hacker's Multiple-Precision Integer-Division Program in Close Scrutiny","authors":"J. Katajainen","doi":"10.1007/978-3-030-34029-2_25","DOIUrl":"https://doi.org/10.1007/978-3-030-34029-2_25","url":null,"abstract":"","PeriodicalId":186261,"journal":{"name":"Analysis of Experimental Algorithms - Special Event","volume":"92 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123260029","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
Colorful Frontier-Based Search: Implicit Enumeration of Chordal and Interval Subgraphs 基于彩色边界的搜索:弦子图和区间子图的隐式枚举
Analysis of Experimental Algorithms - Special Event Pub Date : 2019-06-24 DOI: 10.1007/978-3-030-34029-2_9
J. Kawahara, Toshiki Saitoh, Hirofumi Suzuki, Ryo Yoshinaka
{"title":"Colorful Frontier-Based Search: Implicit Enumeration of Chordal and Interval Subgraphs","authors":"J. Kawahara, Toshiki Saitoh, Hirofumi Suzuki, Ryo Yoshinaka","doi":"10.1007/978-3-030-34029-2_9","DOIUrl":"https://doi.org/10.1007/978-3-030-34029-2_9","url":null,"abstract":"","PeriodicalId":186261,"journal":{"name":"Analysis of Experimental Algorithms - Special Event","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134603911","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
Engineering a PTAS for Minimum Feedback Vertex Set in Planar Graphs 设计一个平面图中最小反馈顶点集的PTAS
Analysis of Experimental Algorithms - Special Event Pub Date : 2019-06-24 DOI: 10.1007/978-3-030-34029-2_7
G. Borradaile, Hung Le, Baigong Zheng
{"title":"Engineering a PTAS for Minimum Feedback Vertex Set in Planar Graphs","authors":"G. Borradaile, Hung Le, Baigong Zheng","doi":"10.1007/978-3-030-34029-2_7","DOIUrl":"https://doi.org/10.1007/978-3-030-34029-2_7","url":null,"abstract":"","PeriodicalId":186261,"journal":{"name":"Analysis of Experimental Algorithms - Special Event","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121513502","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
Algorithmic Aspects on the Construction of Separating Codes 分隔码构造的算法问题
Analysis of Experimental Algorithms - Special Event Pub Date : 2019-06-24 DOI: 10.1007/978-3-030-34029-2_33
Marcel Fernández, John Livieratos
{"title":"Algorithmic Aspects on the Construction of Separating Codes","authors":"Marcel Fernández, John Livieratos","doi":"10.1007/978-3-030-34029-2_33","DOIUrl":"https://doi.org/10.1007/978-3-030-34029-2_33","url":null,"abstract":"","PeriodicalId":186261,"journal":{"name":"Analysis of Experimental Algorithms - Special Event","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115617095","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
Assessing Algorithm Parameter Importance Using Global Sensitivity Analysis 基于全局灵敏度分析的算法参数重要性评估
Analysis of Experimental Algorithms - Special Event Pub Date : 2019-06-24 DOI: 10.1007/978-3-030-34029-2_26
A. Greco, Salvatore Danilo Riccio, J. Timmis, Giuseppe Nicosia
{"title":"Assessing Algorithm Parameter Importance Using Global Sensitivity Analysis","authors":"A. Greco, Salvatore Danilo Riccio, J. Timmis, Giuseppe Nicosia","doi":"10.1007/978-3-030-34029-2_26","DOIUrl":"https://doi.org/10.1007/978-3-030-34029-2_26","url":null,"abstract":"","PeriodicalId":186261,"journal":{"name":"Analysis of Experimental Algorithms - Special Event","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132369738","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
Efficient Split-Radix and Radix-4 DCT Algorithms and Applications 高效分割基数和基数-4 DCT算法及其应用
Analysis of Experimental Algorithms - Special Event Pub Date : 2019-06-24 DOI: 10.1007/978-3-030-34029-2_13
Sirani M. Perera, Daniel Silverio, Austin Ogle
{"title":"Efficient Split-Radix and Radix-4 DCT Algorithms and Applications","authors":"Sirani M. Perera, Daniel Silverio, Austin Ogle","doi":"10.1007/978-3-030-34029-2_13","DOIUrl":"https://doi.org/10.1007/978-3-030-34029-2_13","url":null,"abstract":"","PeriodicalId":186261,"journal":{"name":"Analysis of Experimental Algorithms - Special Event","volume":"56 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130076651","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学术官方微信