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

Analysis of Experimental Algorithms - Special Event最新文献

筛选
英文 中文
A Faster Convex-Hull Algorithm via Bucketing 一种基于分段的快速凸壳算法
Analysis of Experimental Algorithms - Special Event Pub Date : 2019-06-24 DOI: 10.1007/978-3-030-34029-2_30
A. N. Gamby, J. Katajainen
{"title":"A Faster Convex-Hull Algorithm via Bucketing","authors":"A. N. Gamby, J. Katajainen","doi":"10.1007/978-3-030-34029-2_30","DOIUrl":"https://doi.org/10.1007/978-3-030-34029-2_30","url":null,"abstract":"","PeriodicalId":186261,"journal":{"name":"Analysis of Experimental Algorithms - Special Event","volume":"3 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":"128700199","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
Searching for Best Karatsuba Recurrences 寻找最佳空手道递归式
Analysis of Experimental Algorithms - Special Event Pub Date : 2019-06-24 DOI: 10.1007/978-3-030-34029-2_22
Çağdaş Çalık, Morris Dworkin, Nathan Dykas, R. Peralta
{"title":"Searching for Best Karatsuba Recurrences","authors":"Çağdaş Çalık, Morris Dworkin, Nathan Dykas, R. Peralta","doi":"10.1007/978-3-030-34029-2_22","DOIUrl":"https://doi.org/10.1007/978-3-030-34029-2_22","url":null,"abstract":"","PeriodicalId":186261,"journal":{"name":"Analysis of Experimental Algorithms - Special Event","volume":"41 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":"114962766","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
Student Course Allocation with Constraints 有约束的学生课程分配
Analysis of Experimental Algorithms - Special Event Pub Date : 2019-06-24 DOI: 10.1007/978-3-030-34029-2_4
Akshay Utture, Vedant Somani, P. Krishnaa, Meghana Nasre
{"title":"Student Course Allocation with Constraints","authors":"Akshay Utture, Vedant Somani, P. Krishnaa, Meghana Nasre","doi":"10.1007/978-3-030-34029-2_4","DOIUrl":"https://doi.org/10.1007/978-3-030-34029-2_4","url":null,"abstract":"","PeriodicalId":186261,"journal":{"name":"Analysis of Experimental Algorithms - Special Event","volume":"4 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":"126579125","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
Lagrangian Relaxation in Iterated Local Search for the Workforce Scheduling and Routing Problem 劳动力调度和路由问题的迭代局部搜索中的拉格朗日松弛
Analysis of Experimental Algorithms - Special Event Pub Date : 2019-06-24 DOI: 10.1007/978-3-030-34029-2_34
Hanyu Gu, Yefei Zhang, Y. Zinder
{"title":"Lagrangian Relaxation in Iterated Local Search for the Workforce Scheduling and Routing Problem","authors":"Hanyu Gu, Yefei Zhang, Y. Zinder","doi":"10.1007/978-3-030-34029-2_34","DOIUrl":"https://doi.org/10.1007/978-3-030-34029-2_34","url":null,"abstract":"","PeriodicalId":186261,"journal":{"name":"Analysis of Experimental Algorithms - Special Event","volume":"9 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":"134285500","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
A Combinatorial Branch and Bound for the Min-Max Regret Spanning Tree Problem 最小最大后悔生成树问题的一个组合分支和界
Analysis of Experimental Algorithms - Special Event Pub Date : 2019-06-24 DOI: 10.1007/978-3-030-34029-2_5
Noé Godinho, L. Paquete
{"title":"A Combinatorial Branch and Bound for the Min-Max Regret Spanning Tree Problem","authors":"Noé Godinho, L. Paquete","doi":"10.1007/978-3-030-34029-2_5","DOIUrl":"https://doi.org/10.1007/978-3-030-34029-2_5","url":null,"abstract":"","PeriodicalId":186261,"journal":{"name":"Analysis of Experimental Algorithms - Special Event","volume":"24 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":"129345694","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
Minimum and Maximum Category Constraints in the Orienteering Problem with Time Windows 带时间窗定向运动问题中的最小和最大类别约束
Analysis of Experimental Algorithms - Special Event Pub Date : 2019-06-24 DOI: 10.1007/978-3-030-34029-2_23
Konstantinos Ameranis, Nikolaos Vathis, Dimitris Fotakis
{"title":"Minimum and Maximum Category Constraints in the Orienteering Problem with Time Windows","authors":"Konstantinos Ameranis, Nikolaos Vathis, Dimitris Fotakis","doi":"10.1007/978-3-030-34029-2_23","DOIUrl":"https://doi.org/10.1007/978-3-030-34029-2_23","url":null,"abstract":"","PeriodicalId":186261,"journal":{"name":"Analysis of Experimental Algorithms - Special Event","volume":"45 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":"130607135","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 New Rebalancing Algorithm 一种新的再平衡算法
Analysis of Experimental Algorithms - Special Event Pub Date : 2019-06-24 DOI: 10.1007/978-3-030-34029-2_8
K. Gelashvili, Nikoloz Grdzelidze, Mikheil Tutberidze
{"title":"On New Rebalancing Algorithm","authors":"K. Gelashvili, Nikoloz Grdzelidze, Mikheil Tutberidze","doi":"10.1007/978-3-030-34029-2_8","DOIUrl":"https://doi.org/10.1007/978-3-030-34029-2_8","url":null,"abstract":"","PeriodicalId":186261,"journal":{"name":"Analysis of Experimental Algorithms - Special Event","volume":"86 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":"124975664","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
Approximated ZDD Construction Considering Inclusion Relations of Models 考虑模型包含关系的近似ZDD构造
Analysis of Experimental Algorithms - Special Event Pub Date : 2019-06-24 DOI: 10.1007/978-3-030-34029-2_18
Kotaro Matsuda, Shuhei Denzumi, Kengo Nakamura, Masaaki Nishino, Norihito Yasuda
{"title":"Approximated ZDD Construction Considering Inclusion Relations of Models","authors":"Kotaro Matsuda, Shuhei Denzumi, Kengo Nakamura, Masaaki Nishino, Norihito Yasuda","doi":"10.1007/978-3-030-34029-2_18","DOIUrl":"https://doi.org/10.1007/978-3-030-34029-2_18","url":null,"abstract":"","PeriodicalId":186261,"journal":{"name":"Analysis of Experimental Algorithms - Special Event","volume":"36 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":"126670500","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 Contraction Hierarchy Queries via Perfect Stalling 通过完美失速改进收缩层次查询
Analysis of Experimental Algorithms - Special Event Pub Date : 2019-06-24 DOI: 10.1007/978-3-030-34029-2_11
S. Funke, Thomas Mendel
{"title":"Improved Contraction Hierarchy Queries via Perfect Stalling","authors":"S. Funke, Thomas Mendel","doi":"10.1007/978-3-030-34029-2_11","DOIUrl":"https://doi.org/10.1007/978-3-030-34029-2_11","url":null,"abstract":"","PeriodicalId":186261,"journal":{"name":"Analysis of Experimental Algorithms - Special Event","volume":"94 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":"125542436","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
Analysis of Max-Min Ant System with Local Search Applied to the Asymmetric and Dynamic Travelling Salesman Problem with Moving Vehicle 带局部搜索的最大-最小蚂蚁系统在不对称动态移动车辆旅行商问题中的应用分析
Analysis of Experimental Algorithms - Special Event Pub Date : 2019-06-24 DOI: 10.1007/978-3-030-34029-2_14
J. P. Schmitt, R. S. Parpinelli, F. Baldo
{"title":"Analysis of Max-Min Ant System with Local Search Applied to the Asymmetric and Dynamic Travelling Salesman Problem with Moving Vehicle","authors":"J. P. Schmitt, R. S. Parpinelli, F. Baldo","doi":"10.1007/978-3-030-34029-2_14","DOIUrl":"https://doi.org/10.1007/978-3-030-34029-2_14","url":null,"abstract":"","PeriodicalId":186261,"journal":{"name":"Analysis of Experimental Algorithms - Special Event","volume":"43 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":"121403766","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
首页 上一页 下一页 尾页
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学术官方微信