找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: Online Algorithms; The State of the Art Amos Fiat,Gerhard J. Woeginger Book 1998 Springer-Verlag Berlin Heidelberg 1998 Distributed Algorit

[复制链接]
查看: 34854|回复: 47
发表于 2025-3-21 17:13:44 | 显示全部楼层 |阅读模式
书目名称Online Algorithms
副标题The State of the Art
编辑Amos Fiat,Gerhard J. Woeginger
视频video
丛书名称Lecture Notes in Computer Science
图书封面Titlebook: Online Algorithms; The State of the Art Amos Fiat,Gerhard J. Woeginger Book 1998 Springer-Verlag Berlin Heidelberg 1998 Distributed Algorit
描述This coherent anthology presents the state of the art in the booming area of online algorithms and competitive analysis of such algorithms. The 17 papers are carefully revised and thoroughly improved versions of presentations given first during a Dagstuhl seminar in 1996..An overview by the volume editors introduces the area to the reader. The technical chapters are devoted to foundational and methodological issues for the design and analysis of various classes of online algorithms as well as to the detailed evaluation of algorithms for various activities in online processing, ranging from load balancing and scheduling to networking and financial problems. An outlook by the volume editors and a bibliography listing more than 750 references complete the work..The book is ideally suited for advanced courses and self-study in online algorithms. It is indispensable reading for researchers and professionals active in the area.
出版日期Book 1998
关键词Distributed Algorithms; Online Load Balancing; Online Navigation; Online Network Routing; Online Schedul
版次1
doihttps://doi.org/10.1007/BFb0029561
isbn_softcover978-3-540-64917-5
isbn_ebook978-3-540-68311-7Series ISSN 0302-9743 Series E-ISSN 1611-3349
issn_series 0302-9743
copyrightSpringer-Verlag Berlin Heidelberg 1998
The information of publication is updating

书目名称Online Algorithms影响因子(影响力)




书目名称Online Algorithms影响因子(影响力)学科排名




书目名称Online Algorithms网络公开度




书目名称Online Algorithms网络公开度学科排名




书目名称Online Algorithms被引频次




书目名称Online Algorithms被引频次学科排名




书目名称Online Algorithms年度引用




书目名称Online Algorithms年度引用学科排名




书目名称Online Algorithms读者反馈




书目名称Online Algorithms读者反馈学科排名




单选投票, 共有 1 人参与投票
 

1票 100.00%

Perfect with Aesthetics

 

0票 0.00%

Better Implies Difficulty

 

0票 0.00%

Good and Satisfactory

 

0票 0.00%

Adverse Performance

 

0票 0.00%

Disdainful Garbage

您所在的用户组没有投票权限
发表于 2025-3-21 22:59:34 | 显示全部楼层
发表于 2025-3-22 01:55:51 | 显示全部楼层
发表于 2025-3-22 06:10:20 | 显示全部楼层
On-line network routing,ign more efficient algorithms in practical existing networks. A first relevant issue in this direction is to devise efficient distributed implementations of competitive on-line network routing algorithms.
发表于 2025-3-22 10:00:29 | 显示全部楼层
978-3-540-64917-5Springer-Verlag Berlin Heidelberg 1998
发表于 2025-3-22 13:04:02 | 显示全部楼层
发表于 2025-3-22 20:33:33 | 显示全部楼层
发表于 2025-3-23 00:26:51 | 显示全部楼层
https://doi.org/10.1007/BFb0029561Distributed Algorithms; Online Load Balancing; Online Navigation; Online Network Routing; Online Schedul
发表于 2025-3-23 03:22:19 | 显示全部楼层
On-line scheduling,Studied scheduling problems differ not only in the setting and numerical results, but also in the techniques used. In this way on-line scheduling illustrates many general aspects of competitive analysis.
发表于 2025-3-23 05:31:51 | 显示全部楼层
Metrical task systems, the server problem and the work function algorithm,
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-5-2 10:08
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表