找回密碼
 To register

QQ登錄

只需一步，快速開(kāi)始

掃一掃，訪問(wèn)微社區(qū)

打印 上一主題 下一主題

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

[復(fù)制鏈接]
查看: 50047|回復(fù): 42
樓主
發(fā)表于 2025-3-21 17:20:41 | 只看該作者 |倒序?yàn)g覽 |閱讀模式
期刊全稱An Introduction to Online Computation
期刊簡(jiǎn)稱Determinism, Randomi
影響因子2023Dennis Komm
視頻videohttp://file.papertrans.cn/156/155408/155408.mp4
發(fā)行地址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
學(xué)科分類Texts in Theoretical Computer Science. An EATCS Series
圖書(shū)封面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

書(shū)目名稱An Introduction to Online Computation影響因子(影響力)




書(shū)目名稱An Introduction to Online Computation影響因子(影響力)學(xué)科排名




書(shū)目名稱An Introduction to Online Computation網(wǎng)絡(luò)公開(kāi)度




書(shū)目名稱An Introduction to Online Computation網(wǎng)絡(luò)公開(kāi)度學(xué)科排名




書(shū)目名稱An Introduction to Online Computation被引頻次




書(shū)目名稱An Introduction to Online Computation被引頻次學(xué)科排名




書(shū)目名稱An Introduction to Online Computation年度引用




書(shū)目名稱An Introduction to Online Computation年度引用學(xué)科排名




書(shū)目名稱An Introduction to Online Computation讀者反饋




書(shū)目名稱An Introduction to Online Computation讀者反饋學(xué)科排名




單選投票, 共有 0 人參與投票
 

0票 0%

Perfect with Aesthetics
 

0票 0%

Better Implies Difficulty
 

0票 0%

Good and Satisfactory
 

0票 0%

Adverse Performance
 

0票 0%

Disdainful Garbage
您所在的用戶組沒(méi)有投票權(quán)限
沙發(fā)
發(fā)表于 2025-3-21 20:26:23 | 只看該作者
板凳
發(fā)表于 2025-3-22 00:36:19 | 只看該作者
地板
發(fā)表于 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
5#
發(fā)表于 2025-3-22 09:10:03 | 只看該作者
6#
發(fā)表于 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.
7#
發(fā)表于 2025-3-22 17:39:10 | 只看該作者
https://doi.org/10.1007/978-3-322-93569-4This chapter introduces the concept of randomized online computation.
8#
發(fā)表于 2025-3-22 22:51:46 | 只看該作者
9#
發(fā)表于 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.
10#
發(fā)表于 2025-3-23 08:58:00 | 只看該作者
 關(guān)于派博傳思  派博傳思旗下網(wǎng)站  友情鏈接
派博傳思介紹 公司地理位置 論文服務(wù)流程 影響因子官網(wǎng) 吾愛(ài)論文網(wǎng) 大講堂 北京大學(xué) Oxford Uni. Harvard Uni.
發(fā)展歷史沿革 期刊點(diǎn)評(píng) 投稿經(jīng)驗(yàn)總結(jié) SCIENCEGARD IMPACTFACTOR 派博系數(shù) 清華大學(xué) Yale Uni. Stanford Uni.
QQ|Archiver|手機(jī)版|小黑屋| 派博傳思國(guó)際 ( 京公網(wǎng)安備110108008328) GMT+8, 2025-10-8 14:53
Copyright © 2001-2015 派博傳思   京公網(wǎng)安備110108008328 版權(quán)所有 All rights reserved
快速回復(fù) 返回頂部 返回列表
宜宾市| 通许县| 柳河县| 怀柔区| 天峨县| 焉耆| 名山县| 固安县| 遂昌县| 巢湖市| 万荣县| 个旧市| 无锡市| 富平县| 金门县| 迁安市| 彭州市| 张家港市| 平阴县| 宕昌县| 沭阳县| 新津县| 宁蒗| 南城县| 英吉沙县| 溆浦县| 昌宁县| 长兴县| 桂东县| 尚义县| 卫辉市| 安顺市| 新闻| 绥芬河市| 榕江县| 绥中县| 兴文县| 海原县| 禄劝| 溧水县| 河南省|