國立高雄大學圖資館 |

語系: 繁體中文

說明(常見問題)

圖資館首頁

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Experimental algorithms15th Internat...

(1998 :)

Experimental algorithms15th International Symposium, SEA 2016, St. Petersburg, Russia, June 5-8, 2016 : proceedings /

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Experimental algorithmsedited by Andrew V. Goldberg, Alexander S. Kulikov.
其他題名:	15th International Symposium, SEA 2016, St. Petersburg, Russia, June 5-8, 2016 : proceedings /
其他題名:	SEA 2016
其他作者:	Goldberg, Andrew V.
團體作者:
出版者:	Cham :Springer International Publishing :2016.
面頁冊數:	xvi, 386 p. :ill., digital ;24 cm.
Contained By:	Springer eBooks
標題:	Computer algorithmsCongresses.
電子資源:	http://dx.doi.org/10.1007/978-3-319-38851-9
ISBN:	9783319388519$q(electronic bk.)

Experimental algorithms15th International Symposium, SEA 2016, St. Petersburg, Russia, June 5-8, 2016 : proceedings /
Experimental algorithms15th International Symposium, SEA 2016, St. Petersburg, Russia, June 5-8, 2016 : proceedings /[electronic resource] :SEA 2016edited by Andrew V. Goldberg, Alexander S. Kulikov. - Cham :Springer International Publishing :2016. - xvi, 386 p. :ill., digital ;24 cm. - Lecture notes in computer science,96850302-9743 ;. - Lecture notes in computer science ;4891..

Practical Variable Length Gap Pattern Matching using Wavelet Trees -- Fast Exact Computation of Isochrones in Road Networks -- Dynamic Time-Dependent Route Planning in Road Networks with User Preferences -- UKP5: a New Algorithm for the Unbounded Knapsack Problem -- Lempel-Ziv Decoding in External Memory -- A Practical Method for the Minimum Genus of a Graph: Models and Experiments -- Compact Flow Diagrams for State Sequences -- Practical Dynamic Entropy-Compressed Bitvectors with Applications -- Accelerating Local Search for the Maximum Independent Set Problem -- Computing Nonsimple Polygons of Minimum Perimeter -- Sparse Subgraphs for 2-Connectivity in Directed Graphs -- Worst-Case-Efficient Dynamic Arrays in Practice -- On the Solution of Circulant Weighing Matrices Problems Using Algorithm Portfolios on Multi-Core Processors -- Engineering Hybrid DenseZDDs -- Steiner Tree Heuristic in the Euclidean d-Space Using Bottleneck Distances -- Tractable Pathfinding for the Stochastic On-Time Arrival Problem -- An Experimental Evaluation of Fast Approximation Algorithms for the Maximum Satisfiability Problem -- Experimental Analysis of Algorithms for Coflow Scheduling -- An Empirical Study of Online Packet Scheduling Algorithms -- Advanced Multilevel Node Separator Algorithms -- A merging heuristic for the rectangle decomposition of binary matrice -- CHICO: A Compressed Hybrid Index for Repetitive Collections -- Fast Scalable Construction of (Minimal Perfect Hash) Functions -- Better partitions of protein graphs for subsystem quantum chemistry -- Online Algorithm for Approximate Quantile Queries on Sliding Windows.

This book constitutes the refereed proceedings of the 15th International Symposium on Experimental Algorithms, SEA 2016, held in St. Petersburg, Russia, in June 2016. The 25 revised full papers presented were carefully reviewed and selected from 54 submissions. The main theme of the symposium is the role of experimentation and of algorithm engineering techniques in the design and evaluation of algorithms and data structures. SEA covers a wide range of topics in experimental algorithmics, bringing together researchers from algorithm engineering, mathematical programming, and combinatorial optimization communities.

ISBN: 9783319388519$q(electronic bk.)

Standard No.: 10.1007/978-3-319-38851-9doiSubjects--Topical Terms:

380777
Computer algorithms
--Congresses.

LC Class. No.: QA76.9.A43

Dewey Class. No.: 005.1

Experimental algorithms15th International Symposium, SEA 2016, St. Petersburg, Russia, June 5-8, 2016 : proceedings /
LDR:03379nmm a2200337 a 4500 001 489133
003 DE-He213
005 20161025094635.0
006 m d
007 cr nn 008maaau
008 161213s2016 gw s 0 eng d
020 $a 9783319388519$q(electronic bk.)
020 $a 9783319388502$q(paper)
024 7 $a 10.1007/978-3-319-38851-9 $2 doi
035 $a 978-3-319-38851-9
040 $a GP $c GP
041 0 $a eng
050 4 $a QA76.9.A43
072 7 $a UMB $2 bicssc
072 7 $a COM051300 $2 bisacsh
082 0 4 $a 005.1 $2 23
090 $a QA76.9.A43 $b S438 2016
111 2 $n (3rd : $d 1998 : $c Amsterdam, Netherlands) $3 194767
245 1 0 $a Experimental algorithms $h [electronic resource] : $b 15th International Symposium, SEA 2016, St. Petersburg, Russia, June 5-8, 2016 : proceedings / $c edited by Andrew V. Goldberg, Alexander S. Kulikov.
246 3 $a SEA 2016
260 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2016.
300 $a xvi, 386 p. : $b ill., digital ; $c 24 cm.
490 1 $a Lecture notes in computer science, $x 0302-9743 ; $v 9685
505 0 $a Practical Variable Length Gap Pattern Matching using Wavelet Trees -- Fast Exact Computation of Isochrones in Road Networks -- Dynamic Time-Dependent Route Planning in Road Networks with User Preferences -- UKP5: a New Algorithm for the Unbounded Knapsack Problem -- Lempel-Ziv Decoding in External Memory -- A Practical Method for the Minimum Genus of a Graph: Models and Experiments -- Compact Flow Diagrams for State Sequences -- Practical Dynamic Entropy-Compressed Bitvectors with Applications -- Accelerating Local Search for the Maximum Independent Set Problem -- Computing Nonsimple Polygons of Minimum Perimeter -- Sparse Subgraphs for 2-Connectivity in Directed Graphs -- Worst-Case-Efficient Dynamic Arrays in Practice -- On the Solution of Circulant Weighing Matrices Problems Using Algorithm Portfolios on Multi-Core Processors -- Engineering Hybrid DenseZDDs -- Steiner Tree Heuristic in the Euclidean d-Space Using Bottleneck Distances -- Tractable Pathfinding for the Stochastic On-Time Arrival Problem -- An Experimental Evaluation of Fast Approximation Algorithms for the Maximum Satisfiability Problem -- Experimental Analysis of Algorithms for Coflow Scheduling -- An Empirical Study of Online Packet Scheduling Algorithms -- Advanced Multilevel Node Separator Algorithms -- A merging heuristic for the rectangle decomposition of binary matrice -- CHICO: A Compressed Hybrid Index for Repetitive Collections -- Fast Scalable Construction of (Minimal Perfect Hash) Functions -- Better partitions of protein graphs for subsystem quantum chemistry -- Online Algorithm for Approximate Quantile Queries on Sliding Windows.
520 $a This book constitutes the refereed proceedings of the 15th International Symposium on Experimental Algorithms, SEA 2016, held in St. Petersburg, Russia, in June 2016. The 25 revised full papers presented were carefully reviewed and selected from 54 submissions. The main theme of the symposium is the role of experimentation and of algorithm engineering techniques in the design and evaluation of algorithms and data structures. SEA covers a wide range of topics in experimental algorithmics, bringing together researchers from algorithm engineering, mathematical programming, and combinatorial optimization communities.
650 0 $a Computer algorithms $v Congresses. $3 380777
650 0 $a Software engineering $3 253562
650 1 4 $a Computer Science. $3 212513
650 2 4 $a Algorithm Analysis and Problem Complexity. $3 273702
650 2 4 $a Discrete Mathematics in Computer Science. $3 274791
650 2 4 $a Data Structures. $3 273992
650 2 4 $a Numeric Computing. $3 275524
650 2 4 $a Algorithms. $3 184661
650 2 4 $a Artificial Intelligence (incl. Robotics) $3 252959
700 1 $a Goldberg, Andrew V. $3 357048
700 1 $a Kulikov, Alexander S. $3 682935
710 2 $a SpringerLink (Online service) $3 273601
773 0 $t Springer eBooks
830 0 $a Lecture notes in computer science ; $v 4891. $3 383229
856 4 0 $u http://dx.doi.org/10.1007/978-3-319-38851-9
950 $a Computer Science (Springer-11645)