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

Fun with Algorithms最新文献

筛选
英文 中文
Lean Programs, Branch Mispredictions, and Sorting 精益计划，分支错误预测和分类
Fun with Algorithms Pub Date : 2012-06-04 DOI: 10.1007/978-3-642-30347-0_14
Amr Elmasry, J. Katajainen
{"title":"Lean Programs, Branch Mispredictions, and Sorting","authors":"Amr Elmasry, J. Katajainen","doi":"10.1007/978-3-642-30347-0_14","DOIUrl":"https://doi.org/10.1007/978-3-642-30347-0_14","url":null,"abstract":"","PeriodicalId":293763,"journal":{"name":"Fun with Algorithms","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-06-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116734803","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
On Computer Integrated Rationalized Crossword Puzzle Manufacturing 计算机集成合理化纵横字谜制作
Fun with Algorithms Pub Date : 2012-06-04 DOI: 10.1007/978-3-642-30347-0_15
Jakob Engel, M. Holzer, O. Ruepp, Frank Sehnke
{"title":"On Computer Integrated Rationalized Crossword Puzzle Manufacturing","authors":"Jakob Engel, M. Holzer, O. Ruepp, Frank Sehnke","doi":"10.1007/978-3-642-30347-0_15","DOIUrl":"https://doi.org/10.1007/978-3-642-30347-0_15","url":null,"abstract":"","PeriodicalId":293763,"journal":{"name":"Fun with Algorithms","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-06-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130052286","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
Distributed Algorithms by Forgetful Mobile Robots 健忘移动机器人的分布式算法
Fun with Algorithms Pub Date : 2012-06-04 DOI: 10.1007/978-3-642-30347-0_1
P. Flocchini
{"title":"Distributed Algorithms by Forgetful Mobile Robots","authors":"P. Flocchini","doi":"10.1007/978-3-642-30347-0_1","DOIUrl":"https://doi.org/10.1007/978-3-642-30347-0_1","url":null,"abstract":"","PeriodicalId":293763,"journal":{"name":"Fun with Algorithms","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-06-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125032311","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
Solving Tantrix via Integer Programming 通过整数规划求解密宗
Fun with Algorithms Pub Date : 2012-02-28 DOI: 10.1007/978-3-642-30347-0_25
Fumika Kino, Yushi Uno
{"title":"Solving Tantrix via Integer Programming","authors":"Fumika Kino, Yushi Uno","doi":"10.1007/978-3-642-30347-0_25","DOIUrl":"https://doi.org/10.1007/978-3-642-30347-0_25","url":null,"abstract":"","PeriodicalId":293763,"journal":{"name":"Fun with Algorithms","volume":"84 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-02-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124141864","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
Return of the Boss Problem: Competing Online against a Non-adaptive Adversary Boss问题的回归:与非适应性对手在线竞争
Fun with Algorithms Pub Date : 2010-06-02 DOI: 10.1007/978-3-642-13122-6_24
M. Halldórsson, H. Shachnai
{"title":"Return of the Boss Problem: Competing Online against a Non-adaptive Adversary","authors":"M. Halldórsson, H. Shachnai","doi":"10.1007/978-3-642-13122-6_24","DOIUrl":"https://doi.org/10.1007/978-3-642-13122-6_24","url":null,"abstract":"","PeriodicalId":293763,"journal":{"name":"Fun with Algorithms","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121458387","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
Fun with Games 游戏的乐趣
Fun with Algorithms Pub Date : 2010-06-02 DOI: 10.1007/978-3-642-13122-6_3
P. Spirakis, I. Chatzigiannakis, Georgios Mylonas, Panagiota N. Panagopoulou
{"title":"Fun with Games","authors":"P. Spirakis, I. Chatzigiannakis, Georgios Mylonas, Panagiota N. Panagopoulou","doi":"10.1007/978-3-642-13122-6_3","DOIUrl":"https://doi.org/10.1007/978-3-642-13122-6_3","url":null,"abstract":"","PeriodicalId":293763,"journal":{"name":"Fun with Algorithms","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131055564","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
The Computational Complexity of the Kakuro Puzzle, Revisited 重新审视Kakuro谜题的计算复杂性
Fun with Algorithms Pub Date : 2010-06-02 DOI: 10.1007/978-3-642-13122-6_31
O. Ruepp, M. Holzer
{"title":"The Computational Complexity of the Kakuro Puzzle, Revisited","authors":"O. Ruepp, M. Holzer","doi":"10.1007/978-3-642-13122-6_31","DOIUrl":"https://doi.org/10.1007/978-3-642-13122-6_31","url":null,"abstract":"","PeriodicalId":293763,"journal":{"name":"Fun with Algorithms","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115993748","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
The Computational Complexity of RaceTrack 赛马场的计算复杂度
Fun with Algorithms Pub Date : 2010-06-02 DOI: 10.1007/978-3-642-13122-6_26
M. Holzer, P. McKenzie
{"title":"The Computational Complexity of RaceTrack","authors":"M. Holzer, P. McKenzie","doi":"10.1007/978-3-642-13122-6_26","DOIUrl":"https://doi.org/10.1007/978-3-642-13122-6_26","url":null,"abstract":"","PeriodicalId":293763,"journal":{"name":"Fun with Algorithms","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128506644","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
Fun at a Department Store: Data Mining Meets Switching Theory 百货商店的乐趣:数据挖掘与转换理论
Fun with Algorithms Pub Date : 2010-06-02 DOI: 10.1007/978-3-642-13122-6_7
A. Bernasconi, V. Ciriani, F. Luccio, L. Pagli
{"title":"Fun at a Department Store: Data Mining Meets Switching Theory","authors":"A. Bernasconi, V. Ciriani, F. Luccio, L. Pagli","doi":"10.1007/978-3-642-13122-6_7","DOIUrl":"https://doi.org/10.1007/978-3-642-13122-6_7","url":null,"abstract":"","PeriodicalId":293763,"journal":{"name":"Fun with Algorithms","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125199380","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
Cracking Bank PINs by Playing Mastermind 通过玩策划者破解银行密码
Fun with Algorithms Pub Date : 2010-06-02 DOI: 10.1007/978-3-642-13122-6_21
R. Focardi, F. Luccio
{"title":"Cracking Bank PINs by Playing Mastermind","authors":"R. Focardi, F. Luccio","doi":"10.1007/978-3-642-13122-6_21","DOIUrl":"https://doi.org/10.1007/978-3-642-13122-6_21","url":null,"abstract":"","PeriodicalId":293763,"journal":{"name":"Fun with Algorithms","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127286007","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}
引用次数: 18
首页 上一页 下一页 尾页
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学术官方微信