用户名  找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: An Introduction to Online Computation; Determinism, Randomi Dennis Komm Textbook 2016 Springer International Publishing Switzerland 2016 Ad

[复制链接]
查看: 49975|回复: 42
发表于 2025-3-21 17:20:41 | 显示全部楼层 |阅读模式
期刊全称An Introduction to Online Computation
期刊简称Determinism, Randomi
影响因子2023Dennis Komm
视频video
发行地址Particular emphasis on the paging problem and advice complexity.Appropriate for undergraduate and graduate students of computer science.Key feature of author‘s approach is focus on the information whi
学科分类Texts in Theoretical Computer Science. An EATCS Series
图书封面Titlebook: An Introduction to Online Computation; Determinism, Randomi Dennis Komm Textbook 2016 Springer International Publishing Switzerland 2016 Ad
影响因子.This textbook explains online computation in different settings, with particular emphasis on randomization and advice complexity. These settings are analyzed for various online problems such as the paging problem, the k-server problem, job shop scheduling, the knapsack problem, the bit guessing problem, and problems on graphs...This book is appropriate for undergraduate and graduate students of computer science, assuming a basic knowledge in algorithmics and discrete mathematics. Also researchers will find this a valuable reference for the recent field of advice complexity..
Pindex Textbook 2016
The information of publication is updating

书目名称An Introduction to Online Computation影响因子(影响力)




书目名称An Introduction to Online Computation影响因子(影响力)学科排名




书目名称An Introduction to Online Computation网络公开度




书目名称An Introduction to Online Computation网络公开度学科排名




书目名称An Introduction to Online Computation被引频次




书目名称An Introduction to Online Computation被引频次学科排名




书目名称An Introduction to Online Computation年度引用




书目名称An Introduction to Online Computation年度引用学科排名




书目名称An Introduction to Online Computation读者反馈




书目名称An Introduction to Online Computation读者反馈学科排名




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

0票 0%

Perfect with Aesthetics

 

0票 0%

Better Implies Difficulty

 

0票 0%

Good and Satisfactory

 

0票 0%

Adverse Performance

 

0票 0%

Disdainful Garbage

您所在的用户组没有投票权限
发表于 2025-3-21 20:26:23 | 显示全部楼层
发表于 2025-3-22 00:36:19 | 显示全部楼层
发表于 2025-3-22 05:32:11 | 显示全部楼层
https://doi.org/10.1007/978-3-319-42749-2Advice Complexity; Computational Complexity; Online Algorithms; Oracles; Paging Problem; Randomized Algor
发表于 2025-3-22 09:10:03 | 显示全部楼层
发表于 2025-3-22 14:01:46 | 显示全部楼层
https://doi.org/10.1007/978-3-322-93569-4This chapter introduces the concept of computing online, after briefly looking at algorithms from a more general perspective.
发表于 2025-3-22 17:39:10 | 显示全部楼层
https://doi.org/10.1007/978-3-322-93569-4This chapter introduces the concept of randomized online computation.
发表于 2025-3-22 22:51:46 | 显示全部楼层
发表于 2025-3-23 04:25:37 | 显示全部楼层
Das Zeitalter des Fortschritts,This chapter examines an online problem that is among the most studied and is especially interesting from a theoretical point of view.
发表于 2025-3-23 08:58:00 | 显示全部楼层
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-5-20 10:11
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表