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

Combinatorial and Algorithmic Aspects of Networking最新文献

筛选
英文 中文
Nonadaptive Selfish Routing with Online Demands 具有在线需求的非自适应自适应路由
Combinatorial and Algorithmic Aspects of Networking Pub Date : 2007-08-14 DOI: 10.1007/978-3-540-77294-1_5
T. Harks, László A. Végh
{"title":"Nonadaptive Selfish Routing with Online Demands","authors":"T. Harks, László A. Végh","doi":"10.1007/978-3-540-77294-1_5","DOIUrl":"https://doi.org/10.1007/978-3-540-77294-1_5","url":null,"abstract":"","PeriodicalId":415408,"journal":{"name":"Combinatorial and Algorithmic Aspects of Networking","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-08-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123148687","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}
引用次数: 16
Improving Topological Routing in N2R Networks 改进N2R网络拓扑路由
Combinatorial and Algorithmic Aspects of Networking Pub Date : 2007-08-14 DOI: 10.1007/978-3-540-77294-1_12
José M. Gutiérrez López, R. C. Rumín, J. Pedersen, O. Madsen
{"title":"Improving Topological Routing in N2R Networks","authors":"José M. Gutiérrez López, R. C. Rumín, J. Pedersen, O. Madsen","doi":"10.1007/978-3-540-77294-1_12","DOIUrl":"https://doi.org/10.1007/978-3-540-77294-1_12","url":null,"abstract":"","PeriodicalId":415408,"journal":{"name":"Combinatorial and Algorithmic Aspects of Networking","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-08-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129532803","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
Selfish Routing and Path Coloring in All-Optical Networks 全光网络中的自路由和路径着色
Combinatorial and Algorithmic Aspects of Networking Pub Date : 2007-08-14 DOI: 10.1007/978-3-540-77294-1_8
I. Milis, Aris Pagourtzis, Katerina Potika
{"title":"Selfish Routing and Path Coloring in All-Optical Networks","authors":"I. Milis, Aris Pagourtzis, Katerina Potika","doi":"10.1007/978-3-540-77294-1_8","DOIUrl":"https://doi.org/10.1007/978-3-540-77294-1_8","url":null,"abstract":"","PeriodicalId":415408,"journal":{"name":"Combinatorial and Algorithmic Aspects of Networking","volume":"422 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-08-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126709392","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
Preemptive Scheduling on Selfish Machines 自私机器上的抢占调度
Combinatorial and Algorithmic Aspects of Networking Pub Date : 2007-08-14 DOI: 10.1007/978-3-540-77294-1_7
L. Epstein, R. V. Stee
{"title":"Preemptive Scheduling on Selfish Machines","authors":"L. Epstein, R. V. Stee","doi":"10.1007/978-3-540-77294-1_7","DOIUrl":"https://doi.org/10.1007/978-3-540-77294-1_7","url":null,"abstract":"","PeriodicalId":415408,"journal":{"name":"Combinatorial and Algorithmic Aspects of Networking","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-08-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123931437","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
Luck vs. Skill 运气vs技能
Combinatorial and Algorithmic Aspects of Networking Pub Date : 2007-08-14 DOI: 10.1007/978-3-540-77294-1_1
Peter Winkler
{"title":"Luck vs. Skill","authors":"Peter Winkler","doi":"10.1007/978-3-540-77294-1_1","DOIUrl":"https://doi.org/10.1007/978-3-540-77294-1_1","url":null,"abstract":"","PeriodicalId":415408,"journal":{"name":"Combinatorial and Algorithmic Aspects of Networking","volume":"65 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-08-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114163254","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
Valiant Load Balancing, Capacity Provisioning and Resilient Backbone Design 英勇的负载平衡，容量分配和弹性骨干设计
Combinatorial and Algorithmic Aspects of Networking Pub Date : 2007-08-14 DOI: 10.1007/978-3-540-77294-1_3
A. López-Ortiz
{"title":"Valiant Load Balancing, Capacity Provisioning and Resilient Backbone Design","authors":"A. López-Ortiz","doi":"10.1007/978-3-540-77294-1_3","DOIUrl":"https://doi.org/10.1007/978-3-540-77294-1_3","url":null,"abstract":"","PeriodicalId":415408,"journal":{"name":"Combinatorial and Algorithmic Aspects of Networking","volume":"125 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-08-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132919329","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
A Worst-Case Time Upper Bound for Counting the Number of Independent Sets 计算独立集合数目的最坏情况时间上界
Combinatorial and Algorithmic Aspects of Networking Pub Date : 2007-08-14 DOI: 10.1007/978-3-540-77294-1_9
G. D. I. Luna, A. López-López
{"title":"A Worst-Case Time Upper Bound for Counting the Number of Independent Sets","authors":"G. D. I. Luna, A. López-López","doi":"10.1007/978-3-540-77294-1_9","DOIUrl":"https://doi.org/10.1007/978-3-540-77294-1_9","url":null,"abstract":"","PeriodicalId":415408,"journal":{"name":"Combinatorial and Algorithmic Aspects of Networking","volume":"64 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-08-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133849500","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
Improving the Efficiency of Helsgaun's Lin-Kernighan Heuristic for the Symmetric TSP 提高对称TSP的helsgan的Lin-Kernighan启发式的效率
Combinatorial and Algorithmic Aspects of Networking Pub Date : 2007-08-14 DOI: 10.1007/978-3-540-77294-1_10
D. Richter, B. Goldengorin, G. Jäger, P. Molitor
{"title":"Improving the Efficiency of Helsgaun's Lin-Kernighan Heuristic for the Symmetric TSP","authors":"D. Richter, B. Goldengorin, G. Jäger, P. Molitor","doi":"10.1007/978-3-540-77294-1_10","DOIUrl":"https://doi.org/10.1007/978-3-540-77294-1_10","url":null,"abstract":"","PeriodicalId":415408,"journal":{"name":"Combinatorial and Algorithmic Aspects of Networking","volume":"256 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-08-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121237660","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
Combinatorial Algorithms for Listing Paths in Minimal Change Order 以最小变化顺序列出路径的组合算法
Combinatorial and Algorithmic Aspects of Networking Pub Date : 2007-08-14 DOI: 10.1007/978-3-540-77294-1_11
Z. Alamgir, Sarmad Abbasi
{"title":"Combinatorial Algorithms for Listing Paths in Minimal Change Order","authors":"Z. Alamgir, Sarmad Abbasi","doi":"10.1007/978-3-540-77294-1_11","DOIUrl":"https://doi.org/10.1007/978-3-540-77294-1_11","url":null,"abstract":"","PeriodicalId":415408,"journal":{"name":"Combinatorial and Algorithmic Aspects of Networking","volume":"362 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-08-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122809642","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
Cleaning Random d-Regular Graphs with Brushes Using a Degree-Greedy Algorithm 使用度贪婪算法用刷清理随机d规则图
Combinatorial and Algorithmic Aspects of Networking Pub Date : 2007-08-14 DOI: 10.1007/978-3-540-77294-1_4
M. Messinger, P. Prałat, R. Nowakowski, N. Wormald
{"title":"Cleaning Random d-Regular Graphs with Brushes Using a Degree-Greedy Algorithm","authors":"M. Messinger, P. Prałat, R. Nowakowski, N. Wormald","doi":"10.1007/978-3-540-77294-1_4","DOIUrl":"https://doi.org/10.1007/978-3-540-77294-1_4","url":null,"abstract":"","PeriodicalId":415408,"journal":{"name":"Combinatorial and Algorithmic Aspects of Networking","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-08-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126295114","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
下一页 尾页
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学术官方微信