標題: Titlebook: Experimental Algorithms; 8th International Sy Jan Vahrenhold Conference proceedings 2009 Springer-Verlag Berlin Heidelberg 2009 algorithm.a [打印本頁] 作者: SPIR 時間: 2025-3-21 19:36
書目名稱Experimental Algorithms影響因子(影響力)
書目名稱Experimental Algorithms影響因子(影響力)學科排名
書目名稱Experimental Algorithms網(wǎng)絡公開度
書目名稱Experimental Algorithms網(wǎng)絡公開度學科排名
書目名稱Experimental Algorithms被引頻次
書目名稱Experimental Algorithms被引頻次學科排名
書目名稱Experimental Algorithms年度引用
書目名稱Experimental Algorithms年度引用學科排名
書目名稱Experimental Algorithms讀者反饋
書目名稱Experimental Algorithms讀者反饋學科排名
作者: chronicle 時間: 2025-3-21 23:11 作者: Ledger 時間: 2025-3-22 01:20 作者: 正式通知 時間: 2025-3-22 08:17
Eleonore Kofman,Parvati Raghuram. Existing two-level memory hierarchy models fail to realize the full potential of flash-based storage devices. We propose two new computation models, the general flash model and the unit-cost model, for memory hierarchies involving these devices. Our models are simple enough for meaningful algorith作者: mechanism 時間: 2025-3-22 09:57
https://doi.org/10.1007/978-1-137-09944-0packets that request transmission arrive over time. Any packet has an intrinsic value . and we have to decide whether to accept or reject it. In each time-step, the first packet in the buffer (if any) is transmitted and our benefit of it is equal to its intrinsic value minus the time it spent in the作者: 配偶 時間: 2025-3-22 14:40
Charlotte Holgersson,Britt ?stlundon computing a feasible solution of the linear program that is as far as possible from satisfying an inequality at equality. To realize such an approach, we have to detect the set of inequalities that can only be satisfied at equality..Compared to previous approaches for this problem our algorithm h作者: 配偶 時間: 2025-3-22 20:48 作者: GUEER 時間: 2025-3-23 00:22
Comparable Worth as Social Problem-Solvingesign and maintenance of networks. To address the issue of resource placement, we analyze and implement a semidefinite programming-based heuristic for solving a known NP-complete graph optimization problem called .. Experimental results for our heuristic demonstrate promising performance on both syn作者: Decline 時間: 2025-3-23 04:19
Change in Dewey’s and Aristotle’s Selfithm can be terrible (essentially the cost of running a DFS-based internal-memory algorithm on the entire graph), our experiments confirm that the algorithm performs remarkably well in practice. The strongest competitor is the algorithm by Sibeyn et al.?[17], which is based on a semi-external DFS al作者: 阻止 時間: 2025-3-23 09:15
https://doi.org/10.1057/9781137122803etwork. However, the quickest route is often not the best one. A user might be willing to accept slightly longer travel times if the cost of the journey is less. A common approach to cope with such a situation is to find . (concerning other metrics than travel times) routes. Such routes have the pro作者: 范例 時間: 2025-3-23 10:26
https://doi.org/10.1007/978-3-030-66234-9heeler transform (BWT), which is the basis of many state-of-the-art general purpose compressors applies a compression algorithm to a permuted version of the original text. List update algorithms are a common choice for this second stage of BWT-based compression. In this paper we perform an experimen作者: Armory 時間: 2025-3-23 15:56
Helen Peterson,Birgitta Jordanssonay of the trains into account. Typically, this can be a very laborious task involving detailed simulations. We propose to predict the risk of a planned train using a series of linear regression models on the basis of extensive real world delay data of trains. We show how to integrate these models in作者: Increment 時間: 2025-3-23 21:49
Anders Breidlid,Halldis Breidlidular index can be used to solve many problems in sequence analysis. In practice, one limitation of this data structure is its size of . log. bits, while the size of the text is . log|.| bits. For this reason compressed suffix arrays (CSAs) were introduced. The size of these CSAs is asymptotically le作者: 徹底明白 時間: 2025-3-24 01:54 作者: Absenteeism 時間: 2025-3-24 05:28 作者: 打算 時間: 2025-3-24 08:48 作者: diskitis 時間: 2025-3-24 14:31 作者: 有發(fā)明天才 時間: 2025-3-24 15:04 作者: Gratulate 時間: 2025-3-24 22:00 作者: Chemotherapy 時間: 2025-3-25 02:23
Hannelore Güntner,Sabine WieningerWhat does it mean for two geometric graphs to be similar? We propose a distance for geometric graphs that we show to be a metric, and that can be computed by solving an integer linear program. We also present experiments using a heuristic distance function.作者: 夾死提手勢 時間: 2025-3-25 03:45
Rotated-Box Trees: A Lightweight ,-Oriented Bounding-Volume Hierarchy ,We introduce a new type of bounding-volume hierarchy, the ., or .-.-tree for short. A .-.-tree uses boxes as bounding volumes, whose orientations come from a fixed set of predefined box orientations. We theoretically and experimentally compare our new .-.-tree to two existing bounding-volumes hierarchies, namely .-.-tree and box-trees.作者: 推測 時間: 2025-3-25 11:17 作者: 商店街 時間: 2025-3-25 15:33
Measuring the Similarity of Geometric Graphs,What does it mean for two geometric graphs to be similar? We propose a distance for geometric graphs that we show to be a metric, and that can be computed by solving an integer linear program. We also present experiments using a heuristic distance function.作者: 容易懂得 時間: 2025-3-25 17:04
Charlotte Holgersson,Britt ?stlundon computing a feasible solution of the linear program that is as far as possible from satisfying an inequality at equality. To realize such an approach, we have to detect the set of inequalities that can only be satisfied at equality..Compared to previous approaches for this problem our algorithm has a much higher rate of success.作者: 河潭 時間: 2025-3-25 20:06 作者: neoplasm 時間: 2025-3-26 00:17 作者: BRAVE 時間: 2025-3-26 08:19 作者: 顯而易見 時間: 2025-3-26 08:36 作者: Classify 時間: 2025-3-26 16:31 作者: CEDE 時間: 2025-3-26 16:47
Nguyen Phong Nguyen,Emmanuel Mogajint tuned variants of the already existing .-algorithm being up to 15 times faster than .. A surprising outcome of the paper is the astonishing level of data dependency of the algorithms. More detailed descriptions and further experimental results of this work can be found in [1].作者: Angiogenesis 時間: 2025-3-26 22:57 作者: Binge-Drinking 時間: 2025-3-27 03:23 作者: 虛弱 時間: 2025-3-27 07:28 作者: enhance 時間: 2025-3-27 13:17 作者: 貪婪性 時間: 2025-3-27 17:18
Eleonore Kofman,Parvati Raghuramigm can be adapted efficiently into the unit-cost model. Our experiments show that the theoretical analysis of algorithms on our models corresponds to the empirical behavior of algorithms when using solid-state disks as external memory.作者: 偽書 時間: 2025-3-27 19:34 作者: 絕食 時間: 2025-3-28 01:20
Change in Dewey’s and Aristotle’s Selfever performs worse. It thus demonstrates that graph contraction, which is the most important technique for solving connectivity problems on . graphs I/O-efficiently, can be used to solve such problems also on . graphs, at least as a heuristic.作者: 撤退 時間: 2025-3-28 03:37
https://doi.org/10.1057/9781137122803anges. In this work, we study multi-criteria search in road networks. On the one hand, we focus on the problem of limiting the number of Pareto paths. On the other hand, we present a multi-criteria variant of our recent SHARC algorithm.作者: ARY 時間: 2025-3-28 08:52
Helen Peterson,Birgitta Jordanssonences of different model choices and notions of risk with respect to the algorithmic complexity of the resulting combinatorial problems. Finally, we demonstrate the quality of our models on real world data of Swiss Federal Railways.作者: Incommensurate 時間: 2025-3-28 10:59
Geschlechtliche und sexuelle Vielfaltbria in network congestion games. Our approaches.In comparison to an implementation of the selfish-step algorithm using Dijkstra’s algorithm we improve the total running time by a factor of 4 up to 9 on highway networks and grids.作者: DEMN 時間: 2025-3-28 17:15
On Computational Models for Flash Memory Devices,igm can be adapted efficiently into the unit-cost model. Our experiments show that the theoretical analysis of algorithms on our models corresponds to the empirical behavior of algorithms when using solid-state disks as external memory.作者: Cougar 時間: 2025-3-28 21:15
A Heuristic for Fair Correlation-Aware Resource Placement,ield a resource placement scheme that exploits correlations between network resources. Our experimental results show that the resulting placement scheme achieves a significant savings in communication overhead.作者: 諷刺 時間: 2025-3-28 23:49
A Heuristic Strong Connectivity Algorithm for Large Graphs,ever performs worse. It thus demonstrates that graph contraction, which is the most important technique for solving connectivity problems on . graphs I/O-efficiently, can be used to solve such problems also on . graphs, at least as a heuristic.作者: 豎琴 時間: 2025-3-29 04:20 作者: 夸張 時間: 2025-3-29 08:53
Scheduling Additional Trains on Dense Corridors,ences of different model choices and notions of risk with respect to the algorithmic complexity of the resulting combinatorial problems. Finally, we demonstrate the quality of our models on real world data of Swiss Federal Railways.作者: 輕信 時間: 2025-3-29 11:41
Speed-Up Techniques for the Selfish Step Algorithm in Network Congestion Games,bria in network congestion games. Our approaches.In comparison to an implementation of the selfish-step algorithm using Dijkstra’s algorithm we improve the total running time by a factor of 4 up to 9 on highway networks and grids.作者: anatomical 時間: 2025-3-29 19:27 作者: 完成才會征服 時間: 2025-3-29 22:21 作者: 圣人 時間: 2025-3-30 00:37
Empirical Evaluation of Graph Partitioning Using Spectral Embeddings and Flow,ifferent parameter settings interpolate between a more spectral and a more flow-based approach, and we have compared results of this algorithm to results from previously known and optimized algorithms such as ..作者: Collar 時間: 2025-3-30 06:36
,Parallelism in Current and Future Processors – Challenges and Support for Designing Optimal Algoritons, and non-uniform memory access. Intel actively looks for new parallel programming models to tackle these challenges including CT, Software Transactional Memory and Concurrent Collections for .. While these models might make it into future program development environments, there are multiple deve作者: tic-douloureux 時間: 2025-3-30 10:25 作者: beta-cells 時間: 2025-3-30 14:31 作者: Omnipotent 時間: 2025-3-30 16:32
Broadword Computing and Fibonacci Code Speed Up Compressed Suffix Arrays,ur second contribution are two new broadword methods that support the decoding of Fibonacci encoded numbers on 64 bit architectures. Furthermore, our experiments show that the use of known broadword methods speed up the decoding of Elias . code for strings that are high compressible, like XML. Final作者: 剛毅 時間: 2025-3-30 22:38
Experimental Study of Non-oblivious Greedy and Randomized Rounding Algorithms for Hypergraph ,-Matcomized rounding and non-oblivious greedy. Experiments on random and real-world instances suggest that the hybrid can, in terms of approximation, outperform the known techniques. The non-oblivious greedy also shows a better approximation in many cases than the oblivious one and is accessible to theor作者: 漸強 時間: 2025-3-31 03:56 作者: 值得 時間: 2025-3-31 08:51
https://doi.org/10.1007/978-1-137-09944-0 view. In the analytical part, we assume Poisson arrivals and compute a threshold for this algorithm depending on the arrival rate . and the value . of the packets. This also yields bounds on the (expected) competitive ratio of the algorithm. We discover the phenomenon that the ratio converges to on作者: 疲勞 時間: 2025-3-31 12:17
https://doi.org/10.1007/978-3-030-66234-9d difference in the cost models, good list update algorithms may be far from optimal for BWT compression and construct an explicit example of this phenomena. This is a fact that had yet to be supported theoretically in the literature.作者: Hyperlipidemia 時間: 2025-3-31 16:34
Anders Breidlid,Halldis Breidlidur second contribution are two new broadword methods that support the decoding of Fibonacci encoded numbers on 64 bit architectures. Furthermore, our experiments show that the use of known broadword methods speed up the decoding of Elias . code for strings that are high compressible, like XML. Final作者: Original 時間: 2025-3-31 18:53
https://doi.org/10.1007/978-3-658-05378-9omized rounding and non-oblivious greedy. Experiments on random and real-world instances suggest that the hybrid can, in terms of approximation, outperform the known techniques. The non-oblivious greedy also shows a better approximation in many cases than the oblivious one and is accessible to theor作者: Isometric 時間: 2025-3-31 21:49
,Parallelism in Current and Future Processors – Challenges and Support for Designing Optimal Algoritystems accessible to only a few developers. In recent years, however, parallelism on all levels has found its way into even the cheapest desktop and notebook system and thus every algorithm being developed today should reflect this change to optimally exploit theses additional resources..This sessio作者: geometrician 時間: 2025-4-1 05:21 作者: 廚房里面 時間: 2025-4-1 08:58 作者: 古文字學 時間: 2025-4-1 13:13
