語系:
繁體中文
English
日文
簡体中文
說明(常見問題)
登入
回首頁
切換:
標籤
|
MARC模式
|
ISBD
Experimental algorithms[electronic r...
~
Clark Conference ((2005 :)
Experimental algorithms[electronic resource] :15th International Symposium, SEA 2016, St. Petersburg, Russia, June 5-8, 2016 : proceedings /
紀錄類型:
書目-語言資料,印刷品 : Monograph/item
杜威分類號:
005.1
書名/作者:
Experimental algorithms : 15th International Symposium, SEA 2016, St. Petersburg, Russia, June 5-8, 2016 : proceedings // edited by Andrew V. Goldberg, Alexander S. Kulikov.
其他題名:
SEA 2016
其他作者:
Goldberg, Andrew V.
團體作者:
Clark Conference
出版者:
Cham : : Springer International Publishing :, 2016.
面頁冊數:
xvi, 386 p. : : ill., digital ;; 24 cm.
Contained By:
Springer eBooks
標題:
Computer algorithms
標題:
Software engineering
標題:
Computer Science.
標題:
Algorithm Analysis and Problem Complexity.
標題:
Discrete Mathematics in Computer Science.
標題:
Data Structures.
標題:
Numeric Computing.
標題:
Algorithms.
標題:
Artificial Intelligence (incl. Robotics)
ISBN:
9783319388519
ISBN:
9783319388502
內容註:
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.
電子資源:
http://dx.doi.org/10.1007/978-3-319-38851-9
Experimental algorithms[electronic resource] :15th International Symposium, SEA 2016, St. Petersburg, Russia, June 5-8, 2016 : proceedings /
Experimental algorithms
15th 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 ;7103..
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
Standard No.: 10.1007/978-3-319-38851-9doiSubjects--Topical Terms:
154731
Computer algorithms
LC Class. No.: QA76.9.A43
Dewey Class. No.: 005.1
Experimental algorithms[electronic resource] :15th International Symposium, SEA 2016, St. Petersburg, Russia, June 5-8, 2016 : proceedings /
LDR
:03379nam a2200337 a 4500
001
450481
003
DE-He213
005
20161025094635.0
006
m d
007
cr nn 008maaau
008
161210s2016 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
$a
Clark Conference
$d
(2005 :
$c
Sterling and Francine Clark Art Institute)
$3
347558
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
$3
154731
650
0
$a
Software engineering
$3
135422
650
1 4
$a
Computer Science.
$3
423143
650
2 4
$a
Algorithm Analysis and Problem Complexity.
$3
463701
650
2 4
$a
Discrete Mathematics in Computer Science.
$3
464912
650
2 4
$a
Data Structures.
$3
467911
650
2 4
$a
Numeric Computing.
$3
466954
650
2 4
$a
Algorithms.
$3
182797
650
2 4
$a
Artificial Intelligence (incl. Robotics)
$3
463642
700
1
$a
Goldberg, Andrew V.
$3
646634
700
1
$a
Kulikov, Alexander S.
$3
590621
710
2
$a
SpringerLink (Online service)
$3
463450
773
0
$t
Springer eBooks
830
0
$a
Lecture notes in computer science ;
$v
7103.
$3
466200
856
4 0
$u
http://dx.doi.org/10.1007/978-3-319-38851-9
950
$a
Computer Science (Springer-11645)
筆 0 讀者評論
多媒體
多媒體檔案
http://dx.doi.org/10.1007/978-3-319-38851-9
評論
新增評論
分享你的心得
Export
取書館別
處理中
...
變更密碼
登入