東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Algorithm engineering = selected res...

SpringerLink (Online service)

FindBook

Google Book

Amazon

博客來

Algorithm engineering = selected results and surveys /

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Algorithm engineering/ edited by Lasse Kliemann, Peter Sanders.
其他題名:	selected results and surveys /
其他作者:	Kliemann, Lasse.
出版者:	Cham :Springer International Publishing : : 2016.,
面頁冊數:	x, 419 p. :ill., digital ;24 cm.
內容註:	Engineering a Lightweight and Efficient Local Search SAT Solver -- Route Planning in Transportation Networks -- Theoretical Analysis of the k-Means Algorithm - A Survey -- Recent Advances in Graph Partitioning -- How to Generate Randomized Roundings with Dependencies and How to Derandomize Them -- External-Memory State Space Search -- Algorithm Engineering Aspects of Real-Time Rendering Algorithms -- Algorithm Engineering in Robust Optimization -- Clustering Evolving Networks -- Integrating Sequencing and Scheduling: A Generic Approach with Two Exemplary Industrial Applications -- Engineering a Bipartite Matching Algorithm in the Semi-Streaming Model -- Engineering Art Galleries.
Contained By:	Springer eBooks
標題:	Algorithms. -
電子資源:	http://dx.doi.org/10.1007/978-3-319-49487-6
ISBN:	9783319494876

Algorithm engineering = selected results and surveys /
Algorithm engineeringselected results and surveys /[electronic resource] :edited by Lasse Kliemann, Peter Sanders. - Cham :Springer International Publishing :2016. - x, 419 p. :ill., digital ;24 cm. - Lecture notes in computer science,92200302-9743 ;. - Lecture notes in computer science ;9220..

Engineering a Lightweight and Efficient Local Search SAT Solver -- Route Planning in Transportation Networks -- Theoretical Analysis of the k-Means Algorithm - A Survey -- Recent Advances in Graph Partitioning -- How to Generate Randomized Roundings with Dependencies and How to Derandomize Them -- External-Memory State Space Search -- Algorithm Engineering Aspects of Real-Time Rendering Algorithms -- Algorithm Engineering in Robust Optimization -- Clustering Evolving Networks -- Integrating Sequencing and Scheduling: A Generic Approach with Two Exemplary Industrial Applications -- Engineering a Bipartite Matching Algorithm in the Semi-Streaming Model -- Engineering Art Galleries.

Algorithm Engineering is a methodology for algorithmic research that combines theory with implementation and experimentation in order to obtain better algorithms with high practical impact. Traditionally, the study of algorithms was dominated by mathematical (worst-case) analysis. In Algorithm Engineering, algorithms are also implemented and experiments conducted in a systematic way, sometimes resembling the experimentation processes known from fields such as biology, chemistry, or physics. This helps in counteracting an otherwise growing gap between theory and practice.

ISBN: 9783319494876

Standard No.: 10.1007/978-3-319-49487-6doiSubjects--Topical Terms:

536374
Algorithms.

LC Class. No.: QA9.58

Dewey Class. No.: 518.1

Algorithm engineering = selected results and surveys /
LDR:02276nmm a2200325 a 4500 001 2080633
003 DE-He213
005 20161110160822.0
006 m d
007 cr nn 008maaau
008 170616s2016 gw s 0 eng d
020 $a 9783319494876 $q (electronic bk.)
020 $a 9783319494869 $q (paper)
024 7 $a 10.1007/978-3-319-49487-6 $2 doi
035 $a 978-3-319-49487-6
040 $a GP $c GP
041 0 $a eng
050 4 $a QA9.58
072 7 $a UMB $2 bicssc
072 7 $a COM051300 $2 bisacsh
082 0 4 $a 518.1 $2 23
090 $a QA9.58 $b .A396 2016
245 0 0 $a Algorithm engineering $h [electronic resource] : $b selected results and surveys / $c edited by Lasse Kliemann, Peter Sanders.
260 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2016.
300 $a x, 419 p. : $b ill., digital ; $c 24 cm.
490 1 $a Lecture notes in computer science, $x 0302-9743 ; $v 9220
505 0 $a Engineering a Lightweight and Efficient Local Search SAT Solver -- Route Planning in Transportation Networks -- Theoretical Analysis of the k-Means Algorithm - A Survey -- Recent Advances in Graph Partitioning -- How to Generate Randomized Roundings with Dependencies and How to Derandomize Them -- External-Memory State Space Search -- Algorithm Engineering Aspects of Real-Time Rendering Algorithms -- Algorithm Engineering in Robust Optimization -- Clustering Evolving Networks -- Integrating Sequencing and Scheduling: A Generic Approach with Two Exemplary Industrial Applications -- Engineering a Bipartite Matching Algorithm in the Semi-Streaming Model -- Engineering Art Galleries.
520 $a Algorithm Engineering is a methodology for algorithmic research that combines theory with implementation and experimentation in order to obtain better algorithms with high practical impact. Traditionally, the study of algorithms was dominated by mathematical (worst-case) analysis. In Algorithm Engineering, algorithms are also implemented and experiments conducted in a systematic way, sometimes resembling the experimentation processes known from fields such as biology, chemistry, or physics. This helps in counteracting an otherwise growing gap between theory and practice.
650 0 $a Algorithms. $3 536374
650 1 4 $a Computer Science. $3 626642
650 2 4 $a Algorithm Analysis and Problem Complexity. $3 891007
650 2 4 $a Information Systems Applications (incl. Internet) $3 1565452
650 2 4 $a Artificial Intelligence (incl. Robotics) $3 890894
650 2 4 $a Computer Communication Networks. $3 775497
650 2 4 $a Computation by Abstract Devices. $3 891207
650 2 4 $a Discrete Mathematics in Computer Science. $3 892513
700 1 $a Kliemann, Lasse. $3 3200719
700 1 $a Sanders, Peter. $3 898240
710 2 $a SpringerLink (Online service) $3 836513
773 0 $t Springer eBooks
830 0 $a Lecture notes in computer science ; $v 9220. $3 3200720
856 4 0 $u http://dx.doi.org/10.1007/978-3-319-49487-6
950 $a Computer Science (Springer-11645)