標(biāo)題: Titlebook: Experimental Algorithms; 15th International S Andrew V. Goldberg,Alexander S. Kulikov Conference proceedings 2016 Springer International Pu [打印本頁(yè)] 作者: intensify 時(shí)間: 2025-3-21 17:59
書目名稱Experimental Algorithms影響因子(影響力)
作者: 約會(huì) 時(shí)間: 2025-3-21 20:18 作者: condone 時(shí)間: 2025-3-22 02:13
Dynamic Time-Dependent Route Planning in Road Networks with User Preferences,ificantly influences the travel time. One can distinguish traffic congestion that can be predicted using historical traffic data, and congestion due to unpredictable events, e.?g., accidents. We study the . route planning problem, which takes both live traffic and long-term prediction into account. 作者: chronicle 時(shí)間: 2025-3-22 08:11 作者: 忘川河 時(shí)間: 2025-3-22 11:47 作者: 挫敗 時(shí)間: 2025-3-22 12:57
A Practical Method for the Minimum Genus of a Graph: Models and Experiments,an integer linear program (ILP) and as a satisfiability problem (SAT). These allow us to develop the first working implementations of general algorithms for the problem, other than exhaustive search. We investigate several different ways to speed-up and strengthen the formulations; our experimental 作者: 挫敗 時(shí)間: 2025-3-22 20:51 作者: Diuretic 時(shí)間: 2025-3-23 00:15 作者: miracle 時(shí)間: 2025-3-23 03:05
Accelerating Local Search for the Maximum Independent Set Problem,lization techniques can be used to find exact maximum independent sets in medium-sized sparse graphs, as well as high-quality independent sets in huge sparse graphs that are intractable for exact (exponential-time) algorithms. However, a major drawback of these algorithms is that they require signif作者: Bravura 時(shí)間: 2025-3-23 08:39
Computing Nonsimple Polygons of Minimum Perimeter,ion: for a given set of vertices in the plane, the problem Minimum Perimeter Polygon (MPP) asks for a (not necessarily simply connected) polygon with shortest possible boundary length. Even though the closely related problem of finding a minimum cycle cover is polynomially solvable by matching techn作者: 正論 時(shí)間: 2025-3-23 10:41
Sparse Subgraphs for 2-Connectivity in Directed Graphs,ns the pairwise 2-vertex-connectivity of ., i.e., the 2-vertex-connected blocks of . (.). We provide linear-time approximation algorithms for this problem that achieve an approximation ratio of 6. Based on these algorithms, we show how to approximate, in linear time, within a factor of 6 the smalles作者: 袋鼠 時(shí)間: 2025-3-23 16:33 作者: Creditee 時(shí)間: 2025-3-23 18:12 作者: 巨大沒(méi)有 時(shí)間: 2025-3-24 02:13
Engineering Hybrid DenseZDDs,ntations, they still use large amount of memory to support dynamic operations such as taking union and intersection of set families. DenseZDDs and Hybrid DenseZDDs [Denzumi et al. 2014] have been proposed to compress the size of static and dynamic ZDDs, respectively. There exist however no implement作者: Debrief 時(shí)間: 2025-3-24 03:46
Steiner Tree Heuristic in the Euclidean d-Space Using Bottleneck Distances,imum spanning trees to determine small subsets of geometrically close terminals. Their low-cost Steiner trees are determined and concatenated in a greedy fashion to obtain a low cost tree spanning all terminals. The weakness of this approach is that obtained solutions are topologically related to mi作者: CLASP 時(shí)間: 2025-3-24 09:54
Tractable Pathfinding for the Stochastic On-Time Arrival Problem,nown as the path-based stochastic on-time arrival (SOTA) problem. Our primary contribution is a pathfinding algorithm that uses the solution to the .-based SOTA problem—which is of pseudo-polynomial-time complexity in the time budget of the journey—as a search heuristic for the optimal path. In part作者: LAVA 時(shí)間: 2025-3-24 13:43
An Experimental Evaluation of Fast Approximation Algorithms for the Maximum Satisfiability Problem,amination of a broad range of algorithmic techniques reveals that greedy algorithms offer particularly striking performance, delivering very good solutions at low computational cost. Interestingly, their relative ranking does not follow their worst case behavior. Johnson’s deterministic algorithm is作者: 奇思怪想 時(shí)間: 2025-3-24 18:28 作者: inhumane 時(shí)間: 2025-3-24 19:50
An Empirical Study of Online Packet Scheduling Algorithms,lease time ., with a non-negative weight . and an integer deadline .. At each time step, at most one packet is scheduled. The modified greedy (MG) algorithm is 1.618-competitive for the objective of maximizing the sum of weights of packets sent, assuming agreeable deadlines. We analyze the empirical作者: Mast-Cell 時(shí)間: 2025-3-25 02:24
Andrew V. Goldberg,Alexander S. KulikovIncludes supplementary material: 作者: 盤旋 時(shí)間: 2025-3-25 03:37
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/e/image/318802.jpg作者: 雀斑 時(shí)間: 2025-3-25 09:32 作者: 凹處 時(shí)間: 2025-3-25 13:12
Experimental Algorithms978-3-319-38851-9Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: inculpate 時(shí)間: 2025-3-25 16:27
https://doi.org/10.1007/978-1-62703-284-1pplications in a broad range of domains such as Bioinformatics or Natural Language Processing. In this paper we present an efficient solution for static inputs which utilizes the wavelet tree of the suffix array. The algorithm partially traverses the wavelet tree to find matches and can be easily ad作者: minion 時(shí)間: 2025-3-25 20:17 作者: Lumbar-Stenosis 時(shí)間: 2025-3-26 01:39 作者: Facilities 時(shí)間: 2025-3-26 06:19 作者: 比目魚 時(shí)間: 2025-3-26 11:47
,-Inactivation of Homologous Sequences in ,,nt introduction of external memory algorithms for Lempel–Ziv factorization there is a need for external memory LZ77 decoding but the standard algorithm makes random accesses to the text and cannot be trivially modified for external memory computation. We describe the first external memory algorithms作者: 擁護(hù)者 時(shí)間: 2025-3-26 13:03 作者: Pericarditis 時(shí)間: 2025-3-26 17:19 作者: engrossed 時(shí)間: 2025-3-26 21:05 作者: 射手座 時(shí)間: 2025-3-27 01:49
Gene Transfection Using Particle Bombardmentlization techniques can be used to find exact maximum independent sets in medium-sized sparse graphs, as well as high-quality independent sets in huge sparse graphs that are intractable for exact (exponential-time) algorithms. However, a major drawback of these algorithms is that they require signif作者: Dorsal 時(shí)間: 2025-3-27 08:27 作者: Insensate 時(shí)間: 2025-3-27 12:48
https://doi.org/10.1007/11542766ns the pairwise 2-vertex-connectivity of ., i.e., the 2-vertex-connected blocks of . (.). We provide linear-time approximation algorithms for this problem that achieve an approximation ratio of 6. Based on these algorithms, we show how to approximate, in linear time, within a factor of 6 the smalles作者: AMPLE 時(shí)間: 2025-3-27 15:28
Tissue Engineering of Ligament Healingat .(1) worst-case cost. In the literature, many solutions have been proposed, but little information is available on their mutual superiority. Most library implementations only guarantee .(1) amortized cost per operation. Four variations with good worst-case performance were benchmarked: (1)?resiza作者: 迅速成長(zhǎng) 時(shí)間: 2025-3-27 21:07 作者: 錫箔紙 時(shí)間: 2025-3-27 23:30 作者: collagen 時(shí)間: 2025-3-28 05:56 作者: BRAND 時(shí)間: 2025-3-28 10:17
SpringerBriefs in Bioengineeringnown as the path-based stochastic on-time arrival (SOTA) problem. Our primary contribution is a pathfinding algorithm that uses the solution to the .-based SOTA problem—which is of pseudo-polynomial-time complexity in the time budget of the journey—as a search heuristic for the optimal path. In part作者: 逗留 時(shí)間: 2025-3-28 11:40
Gerhard Bauer,Joseph S. Andersonamination of a broad range of algorithmic techniques reveals that greedy algorithms offer particularly striking performance, delivering very good solutions at low computational cost. Interestingly, their relative ranking does not follow their worst case behavior. Johnson’s deterministic algorithm is作者: enumaerate 時(shí)間: 2025-3-28 17:49
https://doi.org/10.1007/978-3-662-11821-4highly parallel data flows with a common performance goal (e.g., the shuffle operations in MapReduce applications). Chowdhury and Stoica [.] introduced the coflow abstraction to capture these parallel communication patterns, and Chowdhury et al. [.] proposed effective heuristics to schedule coflows 作者: bronchodilator 時(shí)間: 2025-3-28 21:18 作者: 永久 時(shí)間: 2025-3-28 23:20 作者: 結(jié)合 時(shí)間: 2025-3-29 06:20
https://doi.org/10.1007/978-1-62703-284-1apted to several variants of the problem. We explore the practical properties of our solution in an experimental study where we compare to online and semi-indexed solutions using standard datasets. The experiments show that our approach is the best choice for searching patterns with many gaps in large texts.作者: FILTH 時(shí)間: 2025-3-29 11:10
Sunil Kumar Raghav,Bart DeplanckeWe propose a practical algorithm that, while robust to user preferences, is able to integrate global changes of the time-dependent metric faster than previous approaches and allows queries in the order of milliseconds.作者: Emasculate 時(shí)間: 2025-3-29 13:36
,-Inactivation of Homologous Sequences in ,, for LZ77 decoding, prove that their I/O complexity is optimal, and demonstrate that they are very fast in practice, only about three times slower than in-memory decoding (when reading input and writing output is included in the time).作者: 連鎖,連串 時(shí)間: 2025-3-29 17:00
Kenneth W. Culver,R. Michael Blaesend updates in . time on a .-bit word machine. This is the first implementation that provably achieves compressed space and is also practical, operating within microseconds. Bitvectors are the basis of most compressed data structures; we explore applications to sequences and graphs.作者: 拖網(wǎng) 時(shí)間: 2025-3-29 21:18 作者: adroit 時(shí)間: 2025-3-30 01:51 作者: 拋射物 時(shí)間: 2025-3-30 05:59
Dynamic Time-Dependent Route Planning in Road Networks with User Preferences,We propose a practical algorithm that, while robust to user preferences, is able to integrate global changes of the time-dependent metric faster than previous approaches and allows queries in the order of milliseconds.作者: 濃縮 時(shí)間: 2025-3-30 08:18
Lempel-Ziv Decoding in External Memory, for LZ77 decoding, prove that their I/O complexity is optimal, and demonstrate that they are very fast in practice, only about three times slower than in-memory decoding (when reading input and writing output is included in the time).作者: Melanocytes 時(shí)間: 2025-3-30 16:03 作者: ETHER 時(shí)間: 2025-3-30 16:54 作者: Intuitive 時(shí)間: 2025-3-30 22:51 作者: hedonic 時(shí)間: 2025-3-31 04:14
Fabian Fr?hlich,Carolin Loos,Jan Hasenauer isochrones, based on which, (2) we provide several easy-to-parallelize, scalable algorithmic approaches for faster computation. By extensive experimental analysis, we demonstrate that our techniques enable fast isochrone computation within milliseconds even on continental networks, significantly faster than the state-of-the-art.作者: chandel 時(shí)間: 2025-3-31 05:05 作者: 變化無(wú)常 時(shí)間: 2025-3-31 13:07
Cells as carriers of gene therapy, our new compression algorithm, our new Hybrid DenseZDDs run in reasonable time using little working memory. Experimental results on the frequent itemset mining problem show that our algorithm uses 33?% of memory compared with a standard ZDD at the cost of 40?% increase in running time.作者: 微生物 時(shí)間: 2025-3-31 14:35
Fast Exact Computation of Isochrones in Road Networks, isochrones, based on which, (2) we provide several easy-to-parallelize, scalable algorithmic approaches for faster computation. By extensive experimental analysis, we demonstrate that our techniques enable fast isochrone computation within milliseconds even on continental networks, significantly faster than the state-of-the-art.作者: Sad570 時(shí)間: 2025-3-31 18:44
