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

Taschenbuch der Algorithmen最新文献

筛选
英文 中文
Tiefensuche (Ariadne und Co.) 搜寻深。
Taschenbuch der Algorithmen Pub Date : 1900-01-01 DOI: 10.1007/978-3-540-76394-9_7
Michael Dom, Falk Hüffner, Rolf Niedermeier
{"title":"Tiefensuche (Ariadne und Co.)","authors":"Michael Dom, Falk Hüffner, Rolf Niedermeier","doi":"10.1007/978-3-540-76394-9_7","DOIUrl":"https://doi.org/10.1007/978-3-540-76394-9_7","url":null,"abstract":"","PeriodicalId":169909,"journal":{"name":"Taschenbuch der Algorithmen","volume":"237 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121872207","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
Binäre Suche
Taschenbuch der Algorithmen Pub Date : 1900-01-01 DOI: 10.1007/978-3-540-76394-9_1
T. Seidl, Jost Enderle
{"title":"Binäre Suche","authors":"T. Seidl, Jost Enderle","doi":"10.1007/978-3-540-76394-9_1","DOIUrl":"https://doi.org/10.1007/978-3-540-76394-9_1","url":null,"abstract":"","PeriodicalId":169909,"journal":{"name":"Taschenbuch der Algorithmen","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127694190","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
Topologisches Sortieren - Mit welcher Aufgabe meiner ToDo-Liste fange ich an? 资源分类要从哪里开始呢?
Taschenbuch der Algorithmen Pub Date : 1900-01-01 DOI: 10.1007/978-3-540-76394-9_5
H. Höpfner
{"title":"Topologisches Sortieren - Mit welcher Aufgabe meiner ToDo-Liste fange ich an?","authors":"H. Höpfner","doi":"10.1007/978-3-540-76394-9_5","DOIUrl":"https://doi.org/10.1007/978-3-540-76394-9_5","url":null,"abstract":"","PeriodicalId":169909,"journal":{"name":"Taschenbuch der Algorithmen","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129489231","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
Der Alphabeta-Algorithmus für Spielbäume: Wie bringe ich meinen Computer zum Schachspielen? 老子们的字母顺序算法:我怎么给我的电脑玩象棋?
Taschenbuch der Algorithmen Pub Date : 1900-01-01 DOI: 10.1007/978-3-540-76394-9_28
B. Monien, U. Lorenz, D. Warner
{"title":"Der Alphabeta-Algorithmus für Spielbäume: Wie bringe ich meinen Computer zum Schachspielen?","authors":"B. Monien, U. Lorenz, D. Warner","doi":"10.1007/978-3-540-76394-9_28","DOIUrl":"https://doi.org/10.1007/978-3-540-76394-9_28","url":null,"abstract":"","PeriodicalId":169909,"journal":{"name":"Taschenbuch der Algorithmen","volume":"107 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117262938","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
Das Rucksackproblem 这Rucksackproblem
Taschenbuch der Algorithmen Pub Date : 1900-01-01 DOI: 10.1007/978-3-540-76394-9_41
René Beier, Berthold Vöcking
{"title":"Das Rucksackproblem","authors":"René Beier, Berthold Vöcking","doi":"10.1007/978-3-540-76394-9_41","DOIUrl":"https://doi.org/10.1007/978-3-540-76394-9_41","url":null,"abstract":"","PeriodicalId":169909,"journal":{"name":"Taschenbuch der Algorithmen","volume":"182 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124479395","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
Teilen von Geheimnissen 分享秘密
Taschenbuch der Algorithmen Pub Date : 1900-01-01 DOI: 10.1007/978-3-540-76394-9_17
J. Blömer
{"title":"Teilen von Geheimnissen","authors":"J. Blömer","doi":"10.1007/978-3-540-76394-9_17","DOIUrl":"https://doi.org/10.1007/978-3-540-76394-9_17","url":null,"abstract":"","PeriodicalId":169909,"journal":{"name":"Taschenbuch der Algorithmen","volume":"179 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123394438","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
Faires Teilen: Eine Weihnachtsstollengeschichte 故事很公平
Taschenbuch der Algorithmen Pub Date : 1900-01-01 DOI: 10.1007/978-3-540-76394-9_33
R. Seidel
{"title":"Faires Teilen: Eine Weihnachtsstollengeschichte","authors":"R. Seidel","doi":"10.1007/978-3-540-76394-9_33","DOIUrl":"https://doi.org/10.1007/978-3-540-76394-9_33","url":null,"abstract":"","PeriodicalId":169909,"journal":{"name":"Taschenbuch der Algorithmen","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125366754","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
Zyklensuche in Graphen
Taschenbuch der Algorithmen Pub Date : 1900-01-01 DOI: 10.1007/978-3-540-76394-9_9
H. Schlingloff
{"title":"Zyklensuche in Graphen","authors":"H. Schlingloff","doi":"10.1007/978-3-540-76394-9_9","DOIUrl":"https://doi.org/10.1007/978-3-540-76394-9_9","url":null,"abstract":"","PeriodicalId":169909,"journal":{"name":"Taschenbuch der Algorithmen","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125298416","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
Einweg-Funktionen: Vorsicht Falle - Rückweg nur für Eingeweihte! 返回时注意惯性，只准内部人员使用
Taschenbuch der Algorithmen Pub Date : 1900-01-01 DOI: 10.1007/978-3-540-76394-9_14
R. Reischuk, M. Hinkelmann
{"title":"Einweg-Funktionen: Vorsicht Falle - Rückweg nur für Eingeweihte!","authors":"R. Reischuk, M. Hinkelmann","doi":"10.1007/978-3-540-76394-9_14","DOIUrl":"https://doi.org/10.1007/978-3-540-76394-9_14","url":null,"abstract":"","PeriodicalId":169909,"journal":{"name":"Taschenbuch der Algorithmen","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122639142","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
Der Euklidische Algorithmus
Taschenbuch der Algorithmen Pub Date : 1900-01-01 DOI: 10.1007/978-3-540-76394-9_12
Friedrich Eisenbrand
{"title":"Der Euklidische Algorithmus","authors":"Friedrich Eisenbrand","doi":"10.1007/978-3-540-76394-9_12","DOIUrl":"https://doi.org/10.1007/978-3-540-76394-9_12","url":null,"abstract":"","PeriodicalId":169909,"journal":{"name":"Taschenbuch der Algorithmen","volume":"48 7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123175283","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
首页 上一页 下一页 尾页
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学术官方微信