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

Combinatorics, Algorithms, Probabilistic and Experimental Methodologies最新文献

筛选
英文 中文
Optimal Semi-online Algorithms for Scheduling with Machine Activation Cost 具有机器激活代价的最优半在线调度算法
Combinatorics, Algorithms, Probabilistic and Experimental Methodologies Pub Date : 2007-04-07 DOI: 10.1007/978-3-540-74450-4_18
Shuguang Han, Yiwei Jiang, Jue-liang Hu
{"title":"Optimal Semi-online Algorithms for Scheduling with Machine Activation Cost","authors":"Shuguang Han, Yiwei Jiang, Jue-liang Hu","doi":"10.1007/978-3-540-74450-4_18","DOIUrl":"https://doi.org/10.1007/978-3-540-74450-4_18","url":null,"abstract":"","PeriodicalId":396841,"journal":{"name":"Combinatorics, Algorithms, Probabilistic and Experimental Methodologies","volume":"60 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-04-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131894297","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
Constrained Cycle Covers in Halin Graphs Halin图中的约束环盖
Combinatorics, Algorithms, Probabilistic and Experimental Methodologies Pub Date : 2007-04-07 DOI: 10.1007/978-3-540-74450-4_17
Yueping Li
{"title":"Constrained Cycle Covers in Halin Graphs","authors":"Yueping Li","doi":"10.1007/978-3-540-74450-4_17","DOIUrl":"https://doi.org/10.1007/978-3-540-74450-4_17","url":null,"abstract":"","PeriodicalId":396841,"journal":{"name":"Combinatorics, Algorithms, Probabilistic and Experimental Methodologies","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-04-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129564017","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
A Digital Watermarking Scheme Based on Singular Value Decomposition 基于奇异值分解的数字水印方案
Combinatorics, Algorithms, Probabilistic and Experimental Methodologies Pub Date : 2007-04-07 DOI: 10.1007/978-3-540-74450-4_8
Chinchen Chang, Yih-Shin Hu, Chia-Chen Lin
{"title":"A Digital Watermarking Scheme Based on Singular Value Decomposition","authors":"Chinchen Chang, Yih-Shin Hu, Chia-Chen Lin","doi":"10.1007/978-3-540-74450-4_8","DOIUrl":"https://doi.org/10.1007/978-3-540-74450-4_8","url":null,"abstract":"","PeriodicalId":396841,"journal":{"name":"Combinatorics, Algorithms, Probabilistic and Experimental Methodologies","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-04-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134299793","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}
引用次数: 50
The Tight Bound of First Fit Decreasing Bin-Packing Algorithm Is FFD(I) <= 11/9OPT(I) + 6/9 首次拟合递减装箱算法的紧界为FFD(I) <= 11/9OPT(I) + 6/9
Combinatorics, Algorithms, Probabilistic and Experimental Methodologies Pub Date : 2007-04-07 DOI: 10.1007/978-3-540-74450-4_1
G. Dósa
{"title":"The Tight Bound of First Fit Decreasing Bin-Packing Algorithm Is FFD(I) <= 11/9OPT(I) + 6/9","authors":"G. Dósa","doi":"10.1007/978-3-540-74450-4_1","DOIUrl":"https://doi.org/10.1007/978-3-540-74450-4_1","url":null,"abstract":"","PeriodicalId":396841,"journal":{"name":"Combinatorics, Algorithms, Probabilistic and Experimental Methodologies","volume":"135 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-04-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127029000","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}
引用次数: 188
Fast Matching Method for DNA Sequences DNA序列快速匹配方法
Combinatorics, Algorithms, Probabilistic and Experimental Methodologies Pub Date : 2007-04-07 DOI: 10.1007/978-3-540-74450-4_25
Jin Wook Kim, Eunsang Kim, Kunsoo Park
{"title":"Fast Matching Method for DNA Sequences","authors":"Jin Wook Kim, Eunsang Kim, Kunsoo Park","doi":"10.1007/978-3-540-74450-4_25","DOIUrl":"https://doi.org/10.1007/978-3-540-74450-4_25","url":null,"abstract":"","PeriodicalId":396841,"journal":{"name":"Combinatorics, Algorithms, Probabilistic and Experimental Methodologies","volume":"56 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-04-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121860732","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}
引用次数: 12
On the Minimum Risk-Sum Path Problem 关于最小风险和路径问题
Combinatorics, Algorithms, Probabilistic and Experimental Methodologies Pub Date : 2007-04-07 DOI: 10.1007/978-3-540-74450-4_16
Xujin Chen, Jie Hu, Xiaodong Hu
{"title":"On the Minimum Risk-Sum Path Problem","authors":"Xujin Chen, Jie Hu, Xiaodong Hu","doi":"10.1007/978-3-540-74450-4_16","DOIUrl":"https://doi.org/10.1007/978-3-540-74450-4_16","url":null,"abstract":"","PeriodicalId":396841,"journal":{"name":"Combinatorics, Algorithms, Probabilistic and Experimental Methodologies","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-04-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115402895","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
Robust Optimization Model for a Class of Uncertain Linear Programs 一类不确定线性规划的鲁棒优化模型
Combinatorics, Algorithms, Probabilistic and Experimental Methodologies Pub Date : 2007-04-07 DOI: 10.1007/978-3-540-74450-4_35
Weimin Miao, Hongxia Yin, D. Du, Jiye Han
{"title":"Robust Optimization Model for a Class of Uncertain Linear Programs","authors":"Weimin Miao, Hongxia Yin, D. Du, Jiye Han","doi":"10.1007/978-3-540-74450-4_35","DOIUrl":"https://doi.org/10.1007/978-3-540-74450-4_35","url":null,"abstract":"","PeriodicalId":396841,"journal":{"name":"Combinatorics, Algorithms, Probabilistic and Experimental Methodologies","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-04-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129155067","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 New Succinct Representation of RMQ-Information and Improvements in the Enhanced Suffix Array 一种新的rmq -信息简练表示及增强后缀数组的改进
Combinatorics, Algorithms, Probabilistic and Experimental Methodologies Pub Date : 2007-04-07 DOI: 10.1007/978-3-540-74450-4_41
J. Fischer, Volker Heun
{"title":"A New Succinct Representation of RMQ-Information and Improvements in the Enhanced Suffix Array","authors":"J. Fischer, Volker Heun","doi":"10.1007/978-3-540-74450-4_41","DOIUrl":"https://doi.org/10.1007/978-3-540-74450-4_41","url":null,"abstract":"","PeriodicalId":396841,"journal":{"name":"Combinatorics, Algorithms, Probabilistic and Experimental Methodologies","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-04-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131276994","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}
引用次数: 150
Heuristic Search for 2D NMR Alignment to Support Metabolite Identification 启发式搜索二维核磁共振比对，以支持代谢物鉴定
Combinatorics, Algorithms, Probabilistic and Experimental Methodologies Pub Date : 2007-04-07 DOI: 10.1007/978-3-540-74450-4_40
Geun-Cheol Lee, J. D. Ropp, M. Viant, D. L. Woodruff, Ping Yu
{"title":"Heuristic Search for 2D NMR Alignment to Support Metabolite Identification","authors":"Geun-Cheol Lee, J. D. Ropp, M. Viant, D. L. Woodruff, Ping Yu","doi":"10.1007/978-3-540-74450-4_40","DOIUrl":"https://doi.org/10.1007/978-3-540-74450-4_40","url":null,"abstract":"","PeriodicalId":396841,"journal":{"name":"Combinatorics, Algorithms, Probabilistic and Experimental Methodologies","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-04-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121286950","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
Optimal Semi-online Scheduling Algorithms on a Small Number of Machines 少数机器上的最优半在线调度算法
Combinatorics, Algorithms, Probabilistic and Experimental Methodologies Pub Date : 2007-04-07 DOI: 10.1007/978-3-540-74450-4_45
Yong Wu, Z. Tan, Qifan Yang
{"title":"Optimal Semi-online Scheduling Algorithms on a Small Number of Machines","authors":"Yong Wu, Z. Tan, Qifan Yang","doi":"10.1007/978-3-540-74450-4_45","DOIUrl":"https://doi.org/10.1007/978-3-540-74450-4_45","url":null,"abstract":"","PeriodicalId":396841,"journal":{"name":"Combinatorics, Algorithms, Probabilistic and Experimental Methodologies","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-04-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116155047","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
首页 上一页 下一页 尾页
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学术官方微信