大葉大學圖書館 |

登入

回首頁

An introduction to online computatio...

Komm, Dennis.

An introduction to online computation[electronic resource] :determinism, randomization, advice /

紀錄類型:	書目-電子資源 : Monograph/item
杜威分類號:	004.33
書名/作者:	An introduction to online computation : determinism, randomization, advice // by Dennis Komm.
作者:	Komm, Dennis.
出版者:	Cham : : Springer International Publishing :, 2016.
面頁冊數:	xv, 349 p. : : ill., digital ;; 24 cm.
Contained By:	Springer eBooks
標題:	Online data processing.
標題:	Computer science.
標題:	Computers.
標題:	Algorithms.
標題:	Computer Science.
標題:	Theory of Computation.
ISBN:	9783319427492
ISBN:	9783319427478
內容註:	Introduction -- Randomization -- Advice Complexity -- The k-Server Problem -- Job Shop Scheduling -- The Knapsack Problem -- The Bit Guessing Problem -- Problems on Graphs.
摘要、提要註:	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.
電子資源:	http://dx.doi.org/10.1007/978-3-319-42749-2

An introduction to online computation[electronic resource] :determinism, randomization, advice /
Komm, Dennis.

An introduction to online computationdeterminism, randomization, advice /[electronic resource] :by Dennis Komm. - Cham :Springer International Publishing :2016. - xv, 349 p. :ill., digital ;24 cm. - Texts in theoretical computer science,1862-4499. - Texts in theoretical computer science..

Introduction -- Randomization -- Advice Complexity -- The k-Server Problem -- Job Shop Scheduling -- The Knapsack Problem -- The Bit Guessing Problem -- Problems on Graphs.

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.

ISBN: 9783319427492

Standard No.: 10.1007/978-3-319-42749-2doiSubjects--Topical Terms:

672675
Online data processing.

LC Class. No.: QA76.55

Dewey Class. No.: 004.33

An introduction to online computation[electronic resource] :determinism, randomization, advice /
LDR:01820nmm a2200349 a 4500 001 467428
003 DE-He213
005 20161031124242.0
006 m d
007 cr nn 008maaau
008 170511s2016 gw s 0 eng d
020 $a 9783319427492 $q (electronic bk.)
020 $a 9783319427478 $q (paper)
024 7 $a 10.1007/978-3-319-42749-2 $2 doi
035 $a 978-3-319-42749-2
040 $a GP $c GP
041 0 $a eng
050 4 $a QA76.55
072 7 $a UY $2 bicssc
072 7 $a UYA $2 bicssc
072 7 $a COM014000 $2 bisacsh
072 7 $a COM031000 $2 bisacsh
082 0 4 $a 004.33 $2 23
090 $a QA76.55 $b .K81 2016
100 1 $a Komm, Dennis. $3 672674
245 1 3 $a An introduction to online computation $h [electronic resource] : $b determinism, randomization, advice / $c by Dennis Komm.
260 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2016.
300 $a xv, 349 p. : $b ill., digital ; $c 24 cm.
490 1 $a Texts in theoretical computer science, $x 1862-4499
505 0 $a Introduction -- Randomization -- Advice Complexity -- The k-Server Problem -- Job Shop Scheduling -- The Knapsack Problem -- The Bit Guessing Problem -- Problems on Graphs.
520 $a 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.
650 0 $a Online data processing. $3 672675
650 0 $a Computer science. $3 182962
650 0 $a Computers. $3 182571
650 0 $a Algorithms. $3 182797
650 1 4 $a Computer Science. $3 423143
650 2 4 $a Theory of Computation. $3 464054
710 2 $a SpringerLink (Online service) $3 463450
773 0 $t Springer eBooks
830 0 $a Texts in theoretical computer science. $3 634850
856 4 0 $u http://dx.doi.org/10.1007/978-3-319-42749-2
950 $a Computer Science (Springer-11645)

筆 0 讀者評論

多媒體

多媒體檔案
http://dx.doi.org/10.1007/978-3-319-42749-2

評論

新增評論分享你的心得

Export

取書館別