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

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

筛选
英文 中文
Small k-Dominating Sets of Regular Graphs 正则图的小k控制集
International Workshop Randomization and Approximation Techniques in Computer Science Pub Date : 2002-09-13 DOI: 10.1007/3-540-45726-7_11
W. Duckworth, B. Mans
{"title":"Small k-Dominating Sets of Regular Graphs","authors":"W. Duckworth, B. Mans","doi":"10.1007/3-540-45726-7_11","DOIUrl":"https://doi.org/10.1007/3-540-45726-7_11","url":null,"abstract":"","PeriodicalId":423704,"journal":{"name":"International Workshop Randomization and Approximation Techniques in Computer Science","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126907531","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
omega-Regular Languages Are Testable with a Constant Number of Queries omega-正则语言可以用常量查询进行测试
International Workshop Randomization and Approximation Techniques in Computer Science Pub Date : 2002-09-13 DOI: 10.1007/3-540-45726-7_3
Hana Chockler, O. Kupferman
{"title":"omega-Regular Languages Are Testable with a Constant Number of Queries","authors":"Hana Chockler, O. Kupferman","doi":"10.1007/3-540-45726-7_3","DOIUrl":"https://doi.org/10.1007/3-540-45726-7_3","url":null,"abstract":"","PeriodicalId":423704,"journal":{"name":"International Workshop Randomization and Approximation Techniques in Computer Science","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122118589","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
Counting and Sampling H-Colourings h -着色计数和抽样
International Workshop Randomization and Approximation Techniques in Computer Science Pub Date : 2002-09-13 DOI: 10.1007/3-540-45726-7_5
M. Dyer, L. A. Goldberg, M. Jerrum
{"title":"Counting and Sampling H-Colourings","authors":"M. Dyer, L. A. Goldberg, M. Jerrum","doi":"10.1007/3-540-45726-7_5","DOIUrl":"https://doi.org/10.1007/3-540-45726-7_5","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":"2002-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129946364","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
Classifying Special Interest Groups in Web Graphs Web图中特殊兴趣组的分类
International Workshop Randomization and Approximation Techniques in Computer Science Pub Date : 2002-09-13 DOI: 10.1007/3-540-45726-7_21
C. Cooper
{"title":"Classifying Special Interest Groups in Web Graphs","authors":"C. Cooper","doi":"10.1007/3-540-45726-7_21","DOIUrl":"https://doi.org/10.1007/3-540-45726-7_21","url":null,"abstract":"","PeriodicalId":423704,"journal":{"name":"International Workshop Randomization and Approximation Techniques in Computer Science","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125447680","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
Quantum Walks on the Hypercube 量子行走在超立方体上
International Workshop Randomization and Approximation Techniques in Computer Science Pub Date : 2001-04-29 DOI: 10.1007/3-540-45726-7_14
Cristopher Moore, A. Russell
{"title":"Quantum Walks on the Hypercube","authors":"Cristopher Moore, A. Russell","doi":"10.1007/3-540-45726-7_14","DOIUrl":"https://doi.org/10.1007/3-540-45726-7_14","url":null,"abstract":"","PeriodicalId":423704,"journal":{"name":"International Workshop Randomization and Approximation Techniques in Computer Science","volume":"95 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-04-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123817673","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}
引用次数: 202
Parallel Random Search and Tabu Search for the Minimal Consistent Subset Selection Problem 最小一致子集选择问题的并行随机搜索与禁忌搜索
International Workshop Randomization and Approximation Techniques in Computer Science Pub Date : 1998-10-08 DOI: 10.1007/3-540-49543-6_20
V. Cerverón, Ariadna Fuertes
{"title":"Parallel Random Search and Tabu Search for the Minimal Consistent Subset Selection Problem","authors":"V. Cerverón, Ariadna Fuertes","doi":"10.1007/3-540-49543-6_20","DOIUrl":"https://doi.org/10.1007/3-540-49543-6_20","url":null,"abstract":"","PeriodicalId":423704,"journal":{"name":"International Workshop Randomization and Approximation Techniques in Computer Science","volume":"54 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":"117022747","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
"Balls into Bins" - A Simple and Tight Analysis “把球扔进垃圾桶”——一个简单而严密的分析
International Workshop Randomization and Approximation Techniques in Computer Science Pub Date : 1998-10-08 DOI: 10.1007/3-540-49543-6_13
Martin Raab, A. Steger
{"title":"\"Balls into Bins\" - A Simple and Tight Analysis","authors":"Martin Raab, A. Steger","doi":"10.1007/3-540-49543-6_13","DOIUrl":"https://doi.org/10.1007/3-540-49543-6_13","url":null,"abstract":"","PeriodicalId":423704,"journal":{"name":"International Workshop Randomization and Approximation Techniques in Computer Science","volume":"39 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":"134122103","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}
引用次数: 519
A High Performance Approximate Algorithm for the Steiner Problem in Graphs 图中Steiner问题的一种高性能近似算法
International Workshop Randomization and Approximation Techniques in Computer Science Pub Date : 1998-10-08 DOI: 10.1007/3-540-49543-6_22
P. Guitart, Josep M. Basart
{"title":"A High Performance Approximate Algorithm for the Steiner Problem in Graphs","authors":"P. Guitart, Josep M. Basart","doi":"10.1007/3-540-49543-6_22","DOIUrl":"https://doi.org/10.1007/3-540-49543-6_22","url":null,"abstract":"","PeriodicalId":423704,"journal":{"name":"International Workshop Randomization and Approximation Techniques in Computer Science","volume":"18 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":"122249750","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
Talagrand's Inequality and Locality in Distributed Computing 分布式计算中的Talagrand不等式与局部性
International Workshop Randomization and Approximation Techniques in Computer Science Pub Date : 1998-10-08 DOI: 10.1007/3-540-49543-6_6
Devdatt P. Dubhashi
{"title":"Talagrand's Inequality and Locality in Distributed Computing","authors":"Devdatt P. Dubhashi","doi":"10.1007/3-540-49543-6_6","DOIUrl":"https://doi.org/10.1007/3-540-49543-6_6","url":null,"abstract":"","PeriodicalId":423704,"journal":{"name":"International Workshop Randomization and Approximation Techniques in Computer Science","volume":"212 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":"121224295","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
The "Burnside Process" Converges Slowly “伯恩赛德过程”缓慢收敛
International Workshop Randomization and Approximation Techniques in Computer Science Pub Date : 1998-10-08 DOI: 10.1007/3-540-49543-6_26
L. A. Goldberg, M. Jerrum
{"title":"The \"Burnside Process\" Converges Slowly","authors":"L. A. Goldberg, M. Jerrum","doi":"10.1007/3-540-49543-6_26","DOIUrl":"https://doi.org/10.1007/3-540-49543-6_26","url":null,"abstract":"","PeriodicalId":423704,"journal":{"name":"International Workshop Randomization and Approximation Techniques in Computer Science","volume":"18 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":"122478225","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
首页 上一页 下一页 尾页
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学术官方微信