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

Frontiers in Algorithmics最新文献

筛选
英文 中文
The Scheduling Strategy of Virtual Machine Migration Based on the Gray Forecasting Model 基于灰色预测模型的虚拟机迁移调度策略
Frontiers in Algorithmics Pub Date : 2016-06-30 DOI: 10.1007/978-3-319-39817-4_9
He Hong, Cao Boyan
{"title":"The Scheduling Strategy of Virtual Machine Migration Based on the Gray Forecasting Model","authors":"He Hong, Cao Boyan","doi":"10.1007/978-3-319-39817-4_9","DOIUrl":"https://doi.org/10.1007/978-3-319-39817-4_9","url":null,"abstract":"","PeriodicalId":101589,"journal":{"name":"Frontiers in Algorithmics","volume":"84 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131588341","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
A Much Faster Branch-and-Bound Algorithm for Finding a Maximum Clique 一种更快的寻找最大团的分支定界算法
Frontiers in Algorithmics Pub Date : 2016-06-30 DOI: 10.1007/978-3-319-39817-4_21
E. Tomita, K. Yoshida, T. Hatta, A. Nagao, Hiro Ito, Mitsuo Wakatsuki
{"title":"A Much Faster Branch-and-Bound Algorithm for Finding a Maximum Clique","authors":"E. Tomita, K. Yoshida, T. Hatta, A. Nagao, Hiro Ito, Mitsuo Wakatsuki","doi":"10.1007/978-3-319-39817-4_21","DOIUrl":"https://doi.org/10.1007/978-3-319-39817-4_21","url":null,"abstract":"","PeriodicalId":101589,"journal":{"name":"Frontiers in Algorithmics","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121471331","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}
引用次数: 24
Algorithms for Queryable Uncertainty 可查询不确定性算法
Frontiers in Algorithmics Pub Date : 2016-06-30 DOI: 10.1007/978-3-319-39817-4_1
T. Erlebach
{"title":"Algorithms for Queryable Uncertainty","authors":"T. Erlebach","doi":"10.1007/978-3-319-39817-4_1","DOIUrl":"https://doi.org/10.1007/978-3-319-39817-4_1","url":null,"abstract":"","PeriodicalId":101589,"journal":{"name":"Frontiers in Algorithmics","volume":"256 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132793809","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
Online Scheduling with Increasing Subsequence Serving Constraint 具有递增子序列服务约束的在线调度
Frontiers in Algorithmics Pub Date : 2016-06-30 DOI: 10.1007/978-3-319-39817-4_14
Kelin Luo, Yinfeng Xu, Xin Feng
{"title":"Online Scheduling with Increasing Subsequence Serving Constraint","authors":"Kelin Luo, Yinfeng Xu, Xin Feng","doi":"10.1007/978-3-319-39817-4_14","DOIUrl":"https://doi.org/10.1007/978-3-319-39817-4_14","url":null,"abstract":"","PeriodicalId":101589,"journal":{"name":"Frontiers in Algorithmics","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115184578","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
Notes on the 6/5-Approximation Algorithm for One-Sided Scaffold Filling 关于单侧支架填充的6/5近似算法的说明
Frontiers in Algorithmics Pub Date : 2016-06-30 DOI: 10.1007/978-3-319-39817-4_15
Jingjing Ma, Haitao Jiang
{"title":"Notes on the 6/5-Approximation Algorithm for One-Sided Scaffold Filling","authors":"Jingjing Ma, Haitao Jiang","doi":"10.1007/978-3-319-39817-4_15","DOIUrl":"https://doi.org/10.1007/978-3-319-39817-4_15","url":null,"abstract":"","PeriodicalId":101589,"journal":{"name":"Frontiers in Algorithmics","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127072484","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}
引用次数: 7
Linear Time Algorithm for 1-Center in Rd Under Convex Polyhedral Distance Function 凸多面体距离函数下Rd中1中心的线性时间算法
Frontiers in Algorithmics Pub Date : 2016-06-30 DOI: 10.1007/978-3-319-39817-4_5
Sandip Das, Ayan Nandy, Swami Sarvottamananda
{"title":"Linear Time Algorithm for 1-Center in Rd Under Convex Polyhedral Distance Function","authors":"Sandip Das, Ayan Nandy, Swami Sarvottamananda","doi":"10.1007/978-3-319-39817-4_5","DOIUrl":"https://doi.org/10.1007/978-3-319-39817-4_5","url":null,"abstract":"","PeriodicalId":101589,"journal":{"name":"Frontiers in Algorithmics","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128691000","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
Improved Algorithms for Several Parameterized Problems Based on Random Methods 基于随机方法的几种参数化问题的改进算法
Frontiers in Algorithmics Pub Date : 2016-06-30 DOI: 10.1007/978-3-319-39817-4_7
Qilong Feng, Xiong Jiang, Jian-xin Wang
{"title":"Improved Algorithms for Several Parameterized Problems Based on Random Methods","authors":"Qilong Feng, Xiong Jiang, Jian-xin Wang","doi":"10.1007/978-3-319-39817-4_7","DOIUrl":"https://doi.org/10.1007/978-3-319-39817-4_7","url":null,"abstract":"","PeriodicalId":101589,"journal":{"name":"Frontiers in Algorithmics","volume":"363 4","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134326236","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
Graph Modification Problems: A Modern Perspective 图形修改问题:现代视角
Frontiers in Algorithmics Pub Date : 2015-07-03 DOI: 10.1007/978-3-319-19647-3_1
F. Fomin, Saket Saurabh, Neeldhara Misra
{"title":"Graph Modification Problems: A Modern Perspective","authors":"F. Fomin, Saket Saurabh, Neeldhara Misra","doi":"10.1007/978-3-319-19647-3_1","DOIUrl":"https://doi.org/10.1007/978-3-319-19647-3_1","url":null,"abstract":"","PeriodicalId":101589,"journal":{"name":"Frontiers in Algorithmics","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-07-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122533396","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}
引用次数: 10
Approximate Model Counting via Extension Rule 利用可拓规则逼近模型计数
Frontiers in Algorithmics Pub Date : 2015-07-03 DOI: 10.1007/978-3-319-19647-3_22
Jinyan Wang, Minghao Yin, Jingli Wu
{"title":"Approximate Model Counting via Extension Rule","authors":"Jinyan Wang, Minghao Yin, Jingli Wu","doi":"10.1007/978-3-319-19647-3_22","DOIUrl":"https://doi.org/10.1007/978-3-319-19647-3_22","url":null,"abstract":"","PeriodicalId":101589,"journal":{"name":"Frontiers in Algorithmics","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-07-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131442066","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
Local Search to Approximate Max NAE- k k -Sat Tightly 局部搜索逼近最大NAE- k - k - sat
Frontiers in Algorithmics Pub Date : 2015-07-03 DOI: 10.1007/978-3-319-19647-3_25
Aiyong Xian, Kaiyuan Zhu, Daming Zhu, Lianrong Pu
{"title":"Local Search to Approximate Max NAE- k k -Sat Tightly","authors":"Aiyong Xian, Kaiyuan Zhu, Daming Zhu, Lianrong Pu","doi":"10.1007/978-3-319-19647-3_25","DOIUrl":"https://doi.org/10.1007/978-3-319-19647-3_25","url":null,"abstract":"","PeriodicalId":101589,"journal":{"name":"Frontiers in Algorithmics","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-07-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132649062","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学术官方微信