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

Inf. Process. Lett.最新文献

筛选
英文 中文
Faster algorithms for single machine scheduling with release dates and rejection 具有发布日期和拒绝的单机调度的更快算法
Inf. Process. Lett. Pub Date : 2016-08-01 DOI: 10.1016/j.ipl.2016.02.008
Jinwen Ou, X. Zhong, Chung-Lun Li
{"title":"Faster algorithms for single machine scheduling with release dates and rejection","authors":"Jinwen Ou, X. Zhong, Chung-Lun Li","doi":"10.1016/j.ipl.2016.02.008","DOIUrl":"https://doi.org/10.1016/j.ipl.2016.02.008","url":null,"abstract":"","PeriodicalId":13545,"journal":{"name":"Inf. Process. Lett.","volume":"18 1","pages":"503-507"},"PeriodicalIF":0.0,"publicationDate":"2016-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82234975","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
Efficient multi-party concurrent signature from lattices 基于格的高效多方并发签名
Inf. Process. Lett. Pub Date : 2016-08-01 DOI: 10.1016/j.ipl.2016.02.007
Xinyin Xiang, Hui Li, Mingyu Wang, Xingwen Zhao
{"title":"Efficient multi-party concurrent signature from lattices","authors":"Xinyin Xiang, Hui Li, Mingyu Wang, Xingwen Zhao","doi":"10.1016/j.ipl.2016.02.007","DOIUrl":"https://doi.org/10.1016/j.ipl.2016.02.007","url":null,"abstract":"","PeriodicalId":13545,"journal":{"name":"Inf. Process. Lett.","volume":"14 1","pages":"497-502"},"PeriodicalIF":0.0,"publicationDate":"2016-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87851989","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
A Hybrid Biased Random Key Genetic Algorithm for the Quadratic Assignment Problem 二次分配问题的混合有偏随机密钥遗传算法
Inf. Process. Lett. Pub Date : 2016-08-01 DOI: 10.1016/j.ipl.2016.03.002
Eduardo Lalla-Ruiz, Christopher Expósito-Izquierdo, B. Melián-Batista, J. M. Moreno-Vega
{"title":"A Hybrid Biased Random Key Genetic Algorithm for the Quadratic Assignment Problem","authors":"Eduardo Lalla-Ruiz, Christopher Expósito-Izquierdo, B. Melián-Batista, J. M. Moreno-Vega","doi":"10.1016/j.ipl.2016.03.002","DOIUrl":"https://doi.org/10.1016/j.ipl.2016.03.002","url":null,"abstract":"","PeriodicalId":13545,"journal":{"name":"Inf. Process. Lett.","volume":"1 1","pages":"513-520"},"PeriodicalIF":0.0,"publicationDate":"2016-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89723278","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}
引用次数: 14
Sufficient conditions for edit-optimal clusters 编辑最优集群的充分条件
Inf. Process. Lett. Pub Date : 2016-04-01 DOI: 10.1016/j.ipl.2015.12.004
P. Damaschke
{"title":"Sufficient conditions for edit-optimal clusters","authors":"P. Damaschke","doi":"10.1016/j.ipl.2015.12.004","DOIUrl":"https://doi.org/10.1016/j.ipl.2015.12.004","url":null,"abstract":"","PeriodicalId":13545,"journal":{"name":"Inf. Process. Lett.","volume":"31 1","pages":"267-272"},"PeriodicalIF":0.0,"publicationDate":"2016-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74601326","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
Inefficiency analysis of the scheduling game on limited identical machines with activation costs 具有激活成本的有限相同机器调度博弈的无效率分析
Inf. Process. Lett. Pub Date : 2016-04-01 DOI: 10.1016/j.ipl.2015.10.006
Fang Xie, Yuzhong Zhang, Qingguo Bai, Zhe Xu
{"title":"Inefficiency analysis of the scheduling game on limited identical machines with activation costs","authors":"Fang Xie, Yuzhong Zhang, Qingguo Bai, Zhe Xu","doi":"10.1016/j.ipl.2015.10.006","DOIUrl":"https://doi.org/10.1016/j.ipl.2015.10.006","url":null,"abstract":"","PeriodicalId":13545,"journal":{"name":"Inf. Process. Lett.","volume":"79 1","pages":"316-320"},"PeriodicalIF":0.0,"publicationDate":"2016-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80937137","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
Improving counting Bloom filter performance with fingerprints 改进计数布隆过滤器性能与指纹
Inf. Process. Lett. Pub Date : 2016-04-01 DOI: 10.1016/j.ipl.2015.11.002
S. Pontarelli, P. Reviriego, J. A. Maestro
{"title":"Improving counting Bloom filter performance with fingerprints","authors":"S. Pontarelli, P. Reviriego, J. A. Maestro","doi":"10.1016/j.ipl.2015.11.002","DOIUrl":"https://doi.org/10.1016/j.ipl.2015.11.002","url":null,"abstract":"","PeriodicalId":13545,"journal":{"name":"Inf. Process. Lett.","volume":"114 1","pages":"304-309"},"PeriodicalIF":0.0,"publicationDate":"2016-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86236737","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}
引用次数: 30
Capacity and delay analysis in delay tolerant network with multiple communities 多社团容延迟网络的容量与时延分析
Inf. Process. Lett. Pub Date : 2016-04-01 DOI: 10.1016/j.ipl.2015.11.001
Yahui Wu, S. Deng, Hongbin Huang
{"title":"Capacity and delay analysis in delay tolerant network with multiple communities","authors":"Yahui Wu, S. Deng, Hongbin Huang","doi":"10.1016/j.ipl.2015.11.001","DOIUrl":"https://doi.org/10.1016/j.ipl.2015.11.001","url":null,"abstract":"","PeriodicalId":13545,"journal":{"name":"Inf. Process. Lett.","volume":"26 1","pages":"310-315"},"PeriodicalIF":0.0,"publicationDate":"2016-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81359062","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
A faster FPT algorithm for 3-path vertex cover 一种更快的三路径顶点覆盖FPT算法
Inf. Process. Lett. Pub Date : 2016-04-01 DOI: 10.1016/j.ipl.2015.12.002
Ján Katrenic
{"title":"A faster FPT algorithm for 3-path vertex cover","authors":"Ján Katrenic","doi":"10.1016/j.ipl.2015.12.002","DOIUrl":"https://doi.org/10.1016/j.ipl.2015.12.002","url":null,"abstract":"","PeriodicalId":13545,"journal":{"name":"Inf. Process. Lett.","volume":"123 1","pages":"273-278"},"PeriodicalIF":0.0,"publicationDate":"2016-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88467918","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}
引用次数: 34
The (k, ℓ) unpartitioned probe problem NP-complete versus polynomial dichotomy (k, r)未分割探针问题的np完全与多项式二分
Inf. Process. Lett. Pub Date : 2016-04-01 DOI: 10.1016/j.ipl.2015.11.004
S. Dantas, L. Faria, C. M. Figueiredo, Rafael B. Teixeira
{"title":"The (k, ℓ) unpartitioned probe problem NP-complete versus polynomial dichotomy","authors":"S. Dantas, L. Faria, C. M. Figueiredo, Rafael B. Teixeira","doi":"10.1016/j.ipl.2015.11.004","DOIUrl":"https://doi.org/10.1016/j.ipl.2015.11.004","url":null,"abstract":"","PeriodicalId":13545,"journal":{"name":"Inf. Process. Lett.","volume":"12 1","pages":"294-298"},"PeriodicalIF":0.0,"publicationDate":"2016-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81963557","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
On the construction of all shortest node-disjoint paths in star networks 星型网络中所有最短节点不相交路径的构造
Inf. Process. Lett. Pub Date : 2016-04-01 DOI: 10.1016/j.ipl.2015.11.003
Cheng-Nan Lai
{"title":"On the construction of all shortest node-disjoint paths in star networks","authors":"Cheng-Nan Lai","doi":"10.1016/j.ipl.2015.11.003","DOIUrl":"https://doi.org/10.1016/j.ipl.2015.11.003","url":null,"abstract":"","PeriodicalId":13545,"journal":{"name":"Inf. Process. Lett.","volume":"40 1","pages":"299-303"},"PeriodicalIF":0.0,"publicationDate":"2016-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74895996","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学术文献互助群
群 号：604180095
Book学术官方微信