Proceedings of the ... Workshop on Algorithm Engineering and Experiments : ALENEX最新文献

筛选
英文 中文
Optimised Predecessor Data Structures for Internal Memory 优化了内存的前身数据结构
Naila Rahman, R. Cole, R. Raman
{"title":"Optimised Predecessor Data Structures for Internal Memory","authors":"Naila Rahman, R. Cole, R. Raman","doi":"10.1007/3-540-44688-5_6","DOIUrl":"https://doi.org/10.1007/3-540-44688-5_6","url":null,"abstract":"","PeriodicalId":93608,"journal":{"name":"Proceedings of the ... Workshop on Algorithm Engineering and Experiments : ALENEX","volume":"83 1","pages":"67-78"},"PeriodicalIF":0.0,"publicationDate":"2001-08-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83726556","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}
引用次数: 45
Experimental Analysis of Algorithms for Bilateral-Contract Clearing Mechanisms Arising in Deregulated Power Industry 放松管制下电力行业双边合约清算机制算法的实验分析
Proceedings of the ... Workshop on Algorithm Engineering and Experiments : ALENEX Pub Date : 2001-05-01 DOI: 10.1007/3-540-44688-5_14
C. Barrett, Doug Cook, Gregory Hicks, V. Faber, A. Marathe, M. Marathe, A. Srinivasan, Yoram J. Sussmann, H. Thornquist
{"title":"Experimental Analysis of Algorithms for Bilateral-Contract Clearing Mechanisms Arising in Deregulated Power Industry","authors":"C. Barrett, Doug Cook, Gregory Hicks, V. Faber, A. Marathe, M. Marathe, A. Srinivasan, Yoram J. Sussmann, H. Thornquist","doi":"10.1007/3-540-44688-5_14","DOIUrl":"https://doi.org/10.1007/3-540-44688-5_14","url":null,"abstract":"","PeriodicalId":93608,"journal":{"name":"Proceedings of the ... Workshop on Algorithm Engineering and Experiments : ALENEX","volume":"477 1","pages":"172-184"},"PeriodicalIF":0.0,"publicationDate":"2001-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76336737","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
Algorithm Engineering: 4th International Workshop, WAE 2000 Saarbrücken, Germany, September 5–8, 2000 Proceedings 算法工程:第四届国际研讨会,WAE 2000 saarbrcken,德国,2000年9月5-8日
R. Dementiev, Thorsten Herfet, P. Sanders, G. Weikum, U. Meyer
{"title":"Algorithm Engineering: 4th International Workshop, WAE 2000 Saarbrücken, Germany, September 5–8, 2000 Proceedings","authors":"R. Dementiev, Thorsten Herfet, P. Sanders, G. Weikum, U. Meyer","doi":"10.1007/3-540-44691-5","DOIUrl":"https://doi.org/10.1007/3-540-44691-5","url":null,"abstract":"","PeriodicalId":93608,"journal":{"name":"Proceedings of the ... Workshop on Algorithm Engineering and Experiments : ALENEX","volume":"75 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2001-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86643395","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
Interchanging Two Segments of an Array in a Hierarchical Memory System 层次化存储系统中数组两段的交换
Proceedings of the ... Workshop on Algorithm Engineering and Experiments : ALENEX Pub Date : 2000-09-05 DOI: 10.1007/3-540-44691-5_14
J. Bojesen, J. Katajainen
{"title":"Interchanging Two Segments of an Array in a Hierarchical Memory System","authors":"J. Bojesen, J. Katajainen","doi":"10.1007/3-540-44691-5_14","DOIUrl":"https://doi.org/10.1007/3-540-44691-5_14","url":null,"abstract":"","PeriodicalId":93608,"journal":{"name":"Proceedings of the ... Workshop on Algorithm Engineering and Experiments : ALENEX","volume":"30 1","pages":"159-170"},"PeriodicalIF":0.0,"publicationDate":"2000-09-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75309695","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
Analysis and Experimental Evaluation of an Innovative and Efficient Routing Protocol for Ad-hoc Mobile Networks 一种创新高效的Ad-hoc移动网络路由协议分析与实验评估
I. Chatzigiannakis, S. Nikoletseas, P. Spirakis
{"title":"Analysis and Experimental Evaluation of an Innovative and Efficient Routing Protocol for Ad-hoc Mobile Networks","authors":"I. Chatzigiannakis, S. Nikoletseas, P. Spirakis","doi":"10.1007/3-540-44691-5_9","DOIUrl":"https://doi.org/10.1007/3-540-44691-5_9","url":null,"abstract":"","PeriodicalId":93608,"journal":{"name":"Proceedings of the ... Workshop on Algorithm Engineering and Experiments : ALENEX","volume":"38 1","pages":"99-110"},"PeriodicalIF":0.0,"publicationDate":"2000-09-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87974510","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}
引用次数: 28
Two-Dimensional Arrangements in CGAL and Adaptive Point Location for Parametric Curves CGAL中的二维排列与参数曲线的自适应点定位
Proceedings of the ... Workshop on Algorithm Engineering and Experiments : ALENEX Pub Date : 2000-09-05 DOI: 10.1007/3-540-44691-5_15
Iddo Hanniel, D. Halperin
{"title":"Two-Dimensional Arrangements in CGAL and Adaptive Point Location for Parametric Curves","authors":"Iddo Hanniel, D. Halperin","doi":"10.1007/3-540-44691-5_15","DOIUrl":"https://doi.org/10.1007/3-540-44691-5_15","url":null,"abstract":"","PeriodicalId":93608,"journal":{"name":"Proceedings of the ... Workshop on Algorithm Engineering and Experiments : ALENEX","volume":"41 1","pages":"171-182"},"PeriodicalIF":0.0,"publicationDate":"2000-09-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86277233","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}
引用次数: 24
Maintaining Shortest Paths in Digraphs with Arbitrary Arc Weights: An Experimental Study 任意圆弧权值有向图中保持最短路径的实验研究
Proceedings of the ... Workshop on Algorithm Engineering and Experiments : ALENEX Pub Date : 2000-09-05 DOI: 10.1007/3-540-44691-5_19
C. Demetrescu, D. Frigioni, A. Marchetti-Spaccamela, U. Nanni
{"title":"Maintaining Shortest Paths in Digraphs with Arbitrary Arc Weights: An Experimental Study","authors":"C. Demetrescu, D. Frigioni, A. Marchetti-Spaccamela, U. Nanni","doi":"10.1007/3-540-44691-5_19","DOIUrl":"https://doi.org/10.1007/3-540-44691-5_19","url":null,"abstract":"","PeriodicalId":93608,"journal":{"name":"Proceedings of the ... Workshop on Algorithm Engineering and Experiments : ALENEX","volume":"32 1","pages":"218-229"},"PeriodicalIF":0.0,"publicationDate":"2000-09-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78536051","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}
引用次数: 38
Lattice Basis Reduction with Dynamic Approximation 动态逼近的格基约简
W. Backes, S. Wetzel
{"title":"Lattice Basis Reduction with Dynamic Approximation","authors":"W. Backes, S. Wetzel","doi":"10.1007/3-540-44691-5_6","DOIUrl":"https://doi.org/10.1007/3-540-44691-5_6","url":null,"abstract":"","PeriodicalId":93608,"journal":{"name":"Proceedings of the ... Workshop on Algorithm Engineering and Experiments : ALENEX","volume":"1 1","pages":"63-73"},"PeriodicalIF":0.0,"publicationDate":"2000-09-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88782687","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
On the Differences between "Practical" and "Applied" 论“实用”与“应用”的区别
K. Weihe
{"title":"On the Differences between \"Practical\" and \"Applied\"","authors":"K. Weihe","doi":"10.1007/3-540-44691-5_1","DOIUrl":"https://doi.org/10.1007/3-540-44691-5_1","url":null,"abstract":"","PeriodicalId":93608,"journal":{"name":"Proceedings of the ... Workshop on Algorithm Engineering and Experiments : ALENEX","volume":"14 1","pages":"1-10"},"PeriodicalIF":0.0,"publicationDate":"2000-09-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81222741","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}
引用次数: 22
Dynamic Maintenance Versus Swapping: An Experimental Study on Shortest Paths Trees 动态维护与交换:最短路径树的实验研究
Proceedings of the ... Workshop on Algorithm Engineering and Experiments : ALENEX Pub Date : 2000-09-05 DOI: 10.1007/3-540-44691-5_18
Guido Proietti
{"title":"Dynamic Maintenance Versus Swapping: An Experimental Study on Shortest Paths Trees","authors":"Guido Proietti","doi":"10.1007/3-540-44691-5_18","DOIUrl":"https://doi.org/10.1007/3-540-44691-5_18","url":null,"abstract":"","PeriodicalId":93608,"journal":{"name":"Proceedings of the ... Workshop on Algorithm Engineering and Experiments : ALENEX","volume":"1 1","pages":"207-217"},"PeriodicalIF":0.0,"publicationDate":"2000-09-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88869530","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}
引用次数: 13
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学术官方微信