首页 > 最新文献

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

英文 中文
Fractal Matrix Multiplication: A Case Study on Portability of Cache Performance 分形矩阵乘法:缓存性能可移植性的案例研究
G. Bilardi, P. D'Alberto, A. Nicolau
{"title":"Fractal Matrix Multiplication: A Case Study on Portability of Cache Performance","authors":"G. Bilardi, P. D'Alberto, A. Nicolau","doi":"10.1007/3-540-44688-5_3","DOIUrl":"https://doi.org/10.1007/3-540-44688-5_3","url":null,"abstract":"","PeriodicalId":93608,"journal":{"name":"Proceedings of the ... Workshop on Algorithm Engineering and Experiments : ALENEX","volume":"3 1","pages":"26-38"},"PeriodicalIF":0.0,"publicationDate":"2001-08-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87515412","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}
引用次数: 17
An Experimental Study of Basic Communication Protocols in Ad-hoc Mobile Networks 自组织移动网络中基本通信协议的实验研究
Pub Date : 2001-08-28 DOI: 10.1007/3-540-44688-5_13
I. Chatzigiannakis, S. Nikoletseas, Nearchos Paspallis, P. Spirakis, C. Zaroliagis
{"title":"An Experimental Study of Basic Communication Protocols in Ad-hoc Mobile Networks","authors":"I. Chatzigiannakis, S. Nikoletseas, Nearchos Paspallis, P. Spirakis, C. Zaroliagis","doi":"10.1007/3-540-44688-5_13","DOIUrl":"https://doi.org/10.1007/3-540-44688-5_13","url":null,"abstract":"","PeriodicalId":93608,"journal":{"name":"Proceedings of the ... Workshop on Algorithm Engineering and Experiments : ALENEX","volume":"142 1","pages":"159-171"},"PeriodicalIF":0.0,"publicationDate":"2001-08-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77897412","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}
引用次数: 49
Using PRAM Algorithms on a Uniform-Memory-Access Shared-Memory Architecture 在统一内存-访问共享内存架构中的PRAM算法
Pub Date : 2001-08-28 DOI: 10.1007/3-540-44688-5_11
David A. Bader, A. K. Illendula, B. Moret, N. Weisse-Bernstein
{"title":"Using PRAM Algorithms on a Uniform-Memory-Access Shared-Memory Architecture","authors":"David A. Bader, A. K. Illendula, B. Moret, N. Weisse-Bernstein","doi":"10.1007/3-540-44688-5_11","DOIUrl":"https://doi.org/10.1007/3-540-44688-5_11","url":null,"abstract":"","PeriodicalId":93608,"journal":{"name":"Proceedings of the ... Workshop on Algorithm Engineering and Experiments : ALENEX","volume":"108 1","pages":"129-144"},"PeriodicalIF":0.0,"publicationDate":"2001-08-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89942908","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
Improving the Efficiency of Branch and Bound Algorithms for the Simple Plant Location Problem 提高简单植物定位问题分支定界算法的效率
B. Goldengorin, D. Ghosh, G. Sierksma
{"title":"Improving the Efficiency of Branch and Bound Algorithms for the Simple Plant Location Problem","authors":"B. Goldengorin, D. Ghosh, G. Sierksma","doi":"10.1007/3-540-44688-5_9","DOIUrl":"https://doi.org/10.1007/3-540-44688-5_9","url":null,"abstract":"","PeriodicalId":93608,"journal":{"name":"Proceedings of the ... Workshop on Algorithm Engineering and Experiments : ALENEX","volume":"20 1","pages":"106-117"},"PeriodicalIF":0.0,"publicationDate":"2001-08-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88689150","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
The Max-Shift Algorithm for Approximate String Matching 近似字符串匹配的最大移位算法
C. Iliopoulos, L. Mouchard, Y. Pinzón
{"title":"The Max-Shift Algorithm for Approximate String Matching","authors":"C. Iliopoulos, L. Mouchard, Y. Pinzón","doi":"10.1007/3-540-44688-5_2","DOIUrl":"https://doi.org/10.1007/3-540-44688-5_2","url":null,"abstract":"","PeriodicalId":93608,"journal":{"name":"Proceedings of the ... Workshop on Algorithm Engineering and Experiments : ALENEX","volume":"1 1","pages":"13-25"},"PeriodicalIF":0.0,"publicationDate":"2001-08-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88328413","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
Efficient Resource Allocation with Noisy Functions 带噪声函数的有效资源分配
A. Andersson, P. Carlsson, F. Ygge
{"title":"Efficient Resource Allocation with Noisy Functions","authors":"A. Andersson, P. Carlsson, F. Ygge","doi":"10.1007/3-540-44688-5_8","DOIUrl":"https://doi.org/10.1007/3-540-44688-5_8","url":null,"abstract":"","PeriodicalId":93608,"journal":{"name":"Proceedings of the ... Workshop on Algorithm Engineering and Experiments : ALENEX","volume":"1 1","pages":"91-105"},"PeriodicalIF":0.0,"publicationDate":"2001-08-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83454078","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
Pareto Shortest Paths is Often Feasible in Practice 帕累托最短路径在实践中通常是可行的
Pub Date : 2001-08-28 DOI: 10.1007/3-540-44688-5_15
M. Müller-Hannemann, K. Weihe
{"title":"Pareto Shortest Paths is Often Feasible in Practice","authors":"M. Müller-Hannemann, K. Weihe","doi":"10.1007/3-540-44688-5_15","DOIUrl":"https://doi.org/10.1007/3-540-44688-5_15","url":null,"abstract":"","PeriodicalId":93608,"journal":{"name":"Proceedings of the ... Workshop on Algorithm Engineering and Experiments : ALENEX","volume":"23 4 1","pages":"185-198"},"PeriodicalIF":0.0,"publicationDate":"2001-08-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80047893","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}
引用次数: 102
Compact DFA Representation for Fast Regular Expression Search 用于快速正则表达式搜索的紧凑DFA表示
G. Navarro, M. Raffinot
{"title":"Compact DFA Representation for Fast Regular Expression Search","authors":"G. Navarro, M. Raffinot","doi":"10.1007/3-540-44688-5_1","DOIUrl":"https://doi.org/10.1007/3-540-44688-5_1","url":null,"abstract":"","PeriodicalId":93608,"journal":{"name":"Proceedings of the ... Workshop on Algorithm Engineering and Experiments : ALENEX","volume":"125 1","pages":"1-12"},"PeriodicalIF":0.0,"publicationDate":"2001-08-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73140000","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}
引用次数: 40
Designing and Implementing a General Purpose Halfedge Data Structure 通用半边缘数据结构的设计与实现
Hervé Brönnimann
{"title":"Designing and Implementing a General Purpose Halfedge Data Structure","authors":"Hervé Brönnimann","doi":"10.1007/3-540-44688-5_5","DOIUrl":"https://doi.org/10.1007/3-540-44688-5_5","url":null,"abstract":"","PeriodicalId":93608,"journal":{"name":"Proceedings of the ... Workshop on Algorithm Engineering and Experiments : ALENEX","volume":"18 1","pages":"51-66"},"PeriodicalIF":0.0,"publicationDate":"2001-08-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74548336","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
Experiences with the Design and Implementation of Space-Efficient Deques 空间高效deque的设计与实现经验
J. Katajainen, Bjarke Buur Mortensen
{"title":"Experiences with the Design and Implementation of Space-Efficient Deques","authors":"J. Katajainen, Bjarke Buur Mortensen","doi":"10.1007/3-540-44688-5_4","DOIUrl":"https://doi.org/10.1007/3-540-44688-5_4","url":null,"abstract":"","PeriodicalId":93608,"journal":{"name":"Proceedings of the ... Workshop on Algorithm Engineering and Experiments : ALENEX","volume":"20 1","pages":"39-50"},"PeriodicalIF":0.0,"publicationDate":"2001-08-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90323903","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}
引用次数: 25
期刊
Proceedings of the ... Workshop on Algorithm Engineering and Experiments : ALENEX
全部 Acc. Chem. Res. ACS Applied Bio Materials ACS Appl. Electron. Mater. ACS Appl. Energy Mater. ACS Appl. Mater. Interfaces ACS Appl. Nano Mater. ACS Appl. Polym. Mater. ACS BIOMATER-SCI ENG ACS Catal. ACS Cent. Sci. ACS Chem. Biol. ACS Chemical Health & Safety ACS Chem. Neurosci. ACS Comb. Sci. ACS Earth Space Chem. ACS Energy Lett. ACS Infect. Dis. ACS Macro Lett. ACS Mater. Lett. ACS Med. Chem. Lett. ACS Nano ACS Omega ACS Photonics ACS Sens. ACS Sustainable Chem. Eng. ACS Synth. Biol. Anal. Chem. BIOCHEMISTRY-US Bioconjugate Chem. BIOMACROMOLECULES Chem. Res. Toxicol. Chem. Rev. Chem. Mater. CRYST GROWTH DES ENERG FUEL Environ. Sci. Technol. Environ. Sci. Technol. Lett. Eur. J. Inorg. Chem. IND ENG CHEM RES Inorg. Chem. J. Agric. Food. Chem. J. Chem. Eng. Data J. Chem. Educ. J. Chem. Inf. Model. J. Chem. Theory Comput. J. Med. Chem. J. Nat. Prod. J PROTEOME RES J. Am. Chem. Soc. LANGMUIR MACROMOLECULES Mol. Pharmaceutics Nano Lett. Org. Lett. ORG PROCESS RES DEV ORGANOMETALLICS J. Org. Chem. J. Phys. Chem. J. Phys. Chem. A J. Phys. Chem. B J. Phys. Chem. C J. Phys. Chem. Lett. Analyst Anal. Methods Biomater. Sci. Catal. Sci. Technol. Chem. Commun. Chem. Soc. Rev. CHEM EDUC RES PRACT CRYSTENGCOMM Dalton Trans. Energy Environ. Sci. ENVIRON SCI-NANO ENVIRON SCI-PROC IMP ENVIRON SCI-WAT RES Faraday Discuss. Food Funct. Green Chem. Inorg. Chem. Front. Integr. Biol. J. Anal. At. Spectrom. J. Mater. Chem. A J. Mater. Chem. B J. Mater. Chem. C Lab Chip Mater. Chem. Front. Mater. Horiz. MEDCHEMCOMM Metallomics Mol. Biosyst. Mol. Syst. Des. Eng. Nanoscale Nanoscale Horiz. Nat. Prod. Rep. New J. Chem. Org. Biomol. Chem. Org. Chem. Front. PHOTOCH PHOTOBIO SCI PCCP Polym. Chem.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1