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

International Workshop Randomization and Approximation Techniques in Computer Science最新文献

筛选
英文 中文
Combinatorial Linear Programming: Geometry Can Help 组合线性规划:几何可以提供帮助
International Workshop Randomization and Approximation Techniques in Computer Science Pub Date : 1998-10-08 DOI: 10.1007/3-540-49543-6_8
B. Gärtner
{"title":"Combinatorial Linear Programming: Geometry Can Help","authors":"B. Gärtner","doi":"10.1007/3-540-49543-6_8","DOIUrl":"https://doi.org/10.1007/3-540-49543-6_8","url":null,"abstract":"","PeriodicalId":423704,"journal":{"name":"International Workshop Randomization and Approximation Techniques in Computer Science","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-10-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125798391","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}
引用次数: 21
Tornado Codes: Practical Erasure Codes Based on Random Irregular Graphs 龙卷风代码:基于随机不规则图的实用Erasure代码
International Workshop Randomization and Approximation Techniques in Computer Science Pub Date : 1998-10-08 DOI: 10.1007/3-540-49543-6_14
M. Luby
{"title":"Tornado Codes: Practical Erasure Codes Based on Random Irregular Graphs","authors":"M. Luby","doi":"10.1007/3-540-49543-6_14","DOIUrl":"https://doi.org/10.1007/3-540-49543-6_14","url":null,"abstract":"","PeriodicalId":423704,"journal":{"name":"International Workshop Randomization and Approximation Techniques in Computer Science","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-10-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126921718","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}
引用次数: 29
An Algorithmic Embedding of Graphs via Perfect Matchings 一种基于完美匹配的图嵌入算法
International Workshop Randomization and Approximation Techniques in Computer Science Pub Date : 1998-10-08 DOI: 10.1007/3-540-49543-6_3
V. Rödl, A. Rucinski, M. Wagner
{"title":"An Algorithmic Embedding of Graphs via Perfect Matchings","authors":"V. Rödl, A. Rucinski, M. Wagner","doi":"10.1007/3-540-49543-6_3","DOIUrl":"https://doi.org/10.1007/3-540-49543-6_3","url":null,"abstract":"","PeriodicalId":423704,"journal":{"name":"International Workshop Randomization and Approximation Techniques in Computer Science","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-10-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121198612","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
Quicksort Again Revisited 再次回顾快速排序
International Workshop Randomization and Approximation Techniques in Computer Science Pub Date : 1998-10-08 DOI: 10.1007/3-540-49543-6_27
C. Knessl, W. Szpankowski
{"title":"Quicksort Again Revisited","authors":"C. Knessl, W. Szpankowski","doi":"10.1007/3-540-49543-6_27","DOIUrl":"https://doi.org/10.1007/3-540-49543-6_27","url":null,"abstract":"","PeriodicalId":423704,"journal":{"name":"International Workshop Randomization and Approximation Techniques in Computer Science","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-10-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127584200","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 Balls and Bins with Deletions 关于带有删除的球和箱
International Workshop Randomization and Approximation Techniques in Computer Science Pub Date : 1998-10-08 DOI: 10.1007/3-540-49543-6_12
R. Cole, A. Frieze, B. Maggs, M. Mitzenmacher, A. Richa, R. Sitaraman, E. Upfal
{"title":"On Balls and Bins with Deletions","authors":"R. Cole, A. Frieze, B. Maggs, M. Mitzenmacher, A. Richa, R. Sitaraman, E. Upfal","doi":"10.1007/3-540-49543-6_12","DOIUrl":"https://doi.org/10.1007/3-540-49543-6_12","url":null,"abstract":"","PeriodicalId":423704,"journal":{"name":"International Workshop Randomization and Approximation Techniques in Computer Science","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-10-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133174848","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}
引用次数: 53
Using Approximation Hardness to Achieve Dependable Computation 利用近似硬度实现可靠计算
International Workshop Randomization and Approximation Techniques in Computer Science Pub Date : 1998-10-08 DOI: 10.1007/3-540-49543-6_15
M. Burmester, Y. Desmedt, Yongge Wang
{"title":"Using Approximation Hardness to Achieve Dependable Computation","authors":"M. Burmester, Y. Desmedt, Yongge Wang","doi":"10.1007/3-540-49543-6_15","DOIUrl":"https://doi.org/10.1007/3-540-49543-6_15","url":null,"abstract":"","PeriodicalId":423704,"journal":{"name":"International Workshop Randomization and Approximation Techniques in Computer Science","volume":"180 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-10-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114113500","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}
引用次数: 15
Constructive Bounds and Exact Expectations for the Random Assignment Problem 随机分配问题的构造界和精确期望
International Workshop Randomization and Approximation Techniques in Computer Science Pub Date : 1998-10-08 DOI: 10.1007/3-540-49543-6_25
D. Coppersmith, G. Sorkin
{"title":"Constructive Bounds and Exact Expectations for the Random Assignment Problem","authors":"D. Coppersmith, G. Sorkin","doi":"10.1007/3-540-49543-6_25","DOIUrl":"https://doi.org/10.1007/3-540-49543-6_25","url":null,"abstract":"","PeriodicalId":423704,"journal":{"name":"International Workshop Randomization and Approximation Techniques in Computer Science","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-10-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114823014","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}
引用次数: 70
On Various Cooling Schedules for Simulated Annealing Applied to the Job Shop Problem 应用于作业车间问题的模拟退火的不同冷却方案
International Workshop Randomization and Approximation Techniques in Computer Science Pub Date : 1998-10-08 DOI: 10.1007/3-540-49543-6_21
K. Steinhöfel, A. Albrecht, Chak-Kuen Wong
{"title":"On Various Cooling Schedules for Simulated Annealing Applied to the Job Shop Problem","authors":"K. Steinhöfel, A. Albrecht, Chak-Kuen Wong","doi":"10.1007/3-540-49543-6_21","DOIUrl":"https://doi.org/10.1007/3-540-49543-6_21","url":null,"abstract":"","PeriodicalId":423704,"journal":{"name":"International Workshop Randomization and Approximation Techniques in Computer Science","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-10-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128247771","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}
引用次数: 11
On the Derandomization of Space-Bounded Computations 关于空间有界计算的非随机化
International Workshop Randomization and Approximation Techniques in Computer Science Pub Date : 1998-10-08 DOI: 10.1007/3-540-49543-6_5
R. Armoni
{"title":"On the Derandomization of Space-Bounded Computations","authors":"R. Armoni","doi":"10.1007/3-540-49543-6_5","DOIUrl":"https://doi.org/10.1007/3-540-49543-6_5","url":null,"abstract":"","PeriodicalId":423704,"journal":{"name":"International Workshop Randomization and Approximation Techniques in Computer Science","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-10-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128002333","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}
引用次数: 33
Tally Languages Accepted by Monte Carlo Pushdown Automata 蒙特卡洛下推自动机接受的计数语言
International Workshop Randomization and Approximation Techniques in Computer Science Pub Date : 1997-07-11 DOI: 10.1007/3-540-63248-4_16
J. Kaneps, D. Geidmanis, R. Freivalds
{"title":"Tally Languages Accepted by Monte Carlo Pushdown Automata","authors":"J. Kaneps, D. Geidmanis, R. Freivalds","doi":"10.1007/3-540-63248-4_16","DOIUrl":"https://doi.org/10.1007/3-540-63248-4_16","url":null,"abstract":"","PeriodicalId":423704,"journal":{"name":"International Workshop Randomization and Approximation Techniques in Computer Science","volume":"103 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-07-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114182114","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}
引用次数: 16
首页 上一页 下一页 尾页
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学术官方微信