標題: Titlebook: Algorithm Engineering; 3rd International Wo Jeffrey S. Vitter,Christos D. Zaroliagis Conference proceedings 1999 Springer-Verlag Berlin Hei [打印本頁] 作者: GALL 時間: 2025-3-21 17:41
書目名稱Algorithm Engineering影響因子(影響力)
書目名稱Algorithm Engineering影響因子(影響力)學科排名
書目名稱Algorithm Engineering網(wǎng)絡公開度
書目名稱Algorithm Engineering網(wǎng)絡公開度學科排名
書目名稱Algorithm Engineering被引頻次
書目名稱Algorithm Engineering被引頻次學科排名
書目名稱Algorithm Engineering年度引用
書目名稱Algorithm Engineering年度引用學科排名
書目名稱Algorithm Engineering讀者反饋
書目名稱Algorithm Engineering讀者反饋學科排名
作者: gain631 時間: 2025-3-21 22:25
Counting in Mobile Networks: Theory and Experimentationich permit the researcher and the protocol designer to work under a familiar graphical and algorithmic environment. The use of DSP gave us considerable input and permitted us to experimentally test the two tier principle for the counting problem of mobile hosts. Moreover it helped us to design new d作者: LUCY 時間: 2025-3-22 00:25 作者: Callus 時間: 2025-3-22 07:25
https://doi.org/10.1007/978-3-531-92464-9uced in our SPAA’98 paper. Building on some key ideas of parallel computing, XMT covers the spectrum from algorithms through architecture to implementation; the main implementation related innovation in XMT was through the incorporation of low-overhead hardware and software mechanisms (for more effe作者: ungainly 時間: 2025-3-22 12:46
https://doi.org/10.1007/978-3-8350-9561-8ich permit the researcher and the protocol designer to work under a familiar graphical and algorithmic environment. The use of DSP gave us considerable input and permitted us to experimentally test the two tier principle for the counting problem of mobile hosts. Moreover it helped us to design new d作者: Macronutrients 時間: 2025-3-22 13:13 作者: AMPLE 時間: 2025-3-22 19:43 作者: 周興旺 時間: 2025-3-22 21:33
Efficient Implementation of Lazy Suffix Treesore it is traversed for the first time. Our experiments show that for the problem of searching many exact patterns in a fixed input string, the lazy top-down construction is often faster and more space efficient than other methods.作者: 拾落穗 時間: 2025-3-23 03:28 作者: Endemic 時間: 2025-3-23 09:31
Analysing Cache Effects in Distribution Sortinge present a cache analysis of these algorithms which predicts the cache miss rate of these algorithms quite well. We have also shown that the integer sorting algorithm MSB radix sort can be used very effectively on floating point data. The algorithm is very fast due to fast integer operations and relatively good cache utilisation.作者: GIBE 時間: 2025-3-23 13:20
https://doi.org/10.1007/978-3-8350-9561-8-preserving speed-up techniques for Dijkstra’s algorithm were analyzed empirically. This analysis was based on the timetable data of all German trains and on a “snapshot” of half a million customer queries..作者: Range-Of-Motion 時間: 2025-3-23 15:48 作者: 松果 時間: 2025-3-23 19:14 作者: 粗語 時間: 2025-3-23 23:28 作者: 嫻熟 時間: 2025-3-24 04:33
Antje Sch?nwald,Olaf Kühne,Anna Currinng that our combined heuristic clearly outperforms well-known TSP construction methods and proves significantly more robust in obtaining high quality solutions over a wide range of problems. We also provide a short overview of recent results in domination analysis of TSP construction heuristics.作者: EXTOL 時間: 2025-3-24 06:58
Construction Heuristics and Domination Analysis for the Asymmetric TSPng that our combined heuristic clearly outperforms well-known TSP construction methods and proves significantly more robust in obtaining high quality solutions over a wide range of problems. We also provide a short overview of recent results in domination analysis of TSP construction heuristics.作者: GROSS 時間: 2025-3-24 12:11 作者: alcoholism 時間: 2025-3-24 18:20 作者: 昏迷狀態(tài) 時間: 2025-3-24 22:10 作者: Delirium 時間: 2025-3-25 01:40
Perspektiven und Schlussfolgerungen,tions. In this paper we describe a generic implementation of efficient random linear perturbations within C. and discuss the practicality of using it examining the convex hull problem, line segment intersection and Delaunay triangulation.作者: Alopecia-Areata 時間: 2025-3-25 05:51
https://doi.org/10.1007/978-3-8350-9561-8s accepted, and use it to skip text characters as done for exact string matching in previous work. As we show experimentally, the resulting algorithm is fast, the fastest one in many cases of interest.作者: 放牧 時間: 2025-3-25 09:04
https://doi.org/10.1007/978-3-642-59351-2or floating-point keys. Among other things we demonstrate clear speedups over library implementations of search trees, both for predecessor queries and updates. Our implementations use very little extra memory compared to search trees, and are also quite generic.作者: 笨重 時間: 2025-3-25 12:23 作者: 急性 時間: 2025-3-25 18:16
Finding Minimum Congestion Spanning Treesorithm’s complexity is quadratic in .. We also present two heuristics with complexity linear in .. In an experimental study we show that these heuristics are much faster than the exact algorithm also in practice, and that their solutions are around 1% of optimal for small values of . and much better for large ..作者: 溫和女孩 時間: 2025-3-25 23:03 作者: 淺灘 時間: 2025-3-26 02:54 作者: d-limonene 時間: 2025-3-26 08:16 作者: maroon 時間: 2025-3-26 10:07
An Experimental Evaluation of Hybrid Data Structures for Searchingor floating-point keys. Among other things we demonstrate clear speedups over library implementations of search trees, both for predecessor queries and updates. Our implementations use very little extra memory compared to search trees, and are also quite generic.作者: avulsion 時間: 2025-3-26 15:08
,Das Modell zur Bev?lkerungsverteilung, finds the . shortest paths in .(.+ . log(.)) time. Experimental results presented in this paper show that the algorithm outperforms in practice the algorithms by Eppstein [.],[.] and by Martins and Santos [.] for different kinds of random generated graphs.作者: 咯咯笑 時間: 2025-3-26 18:04
Volker Kreibich,Rolf Junker,Roland Schneiderore it is traversed for the first time. Our experiments show that for the problem of searching many exact patterns in a fixed input string, the lazy top-down construction is often faster and more space efficient than other methods.作者: 圖表證明 時間: 2025-3-27 00:40 作者: allergy 時間: 2025-3-27 02:05 作者: 消瘦 時間: 2025-3-27 05:52
https://doi.org/10.1007/978-3-322-93347-8ne processor. Scalable systems will come in all shapes and sizes, from cheap PC servers and Linux clusters with a small number of processors, up to large, expensive supercomputers with hundreds or thousands of symmetric multiprocessor (SMP) nodes. An important challenge for the research community is作者: Celiac-Plexus 時間: 2025-3-27 12:19 作者: 幼兒 時間: 2025-3-27 14:11
Volker Kreibich,Rolf Junker,Roland Schneiderpresentation of suffix trees which requires only 12 bytes per input character in the worst case, and 8.5 bytes per input character on average for a collection of files of different type. We show how to efficiently implement the lazy evaluation of suffix trees such that a subtree is evaluated not bef作者: GRIEF 時間: 2025-3-27 19:35 作者: 壁畫 時間: 2025-3-28 01:06 作者: LANCE 時間: 2025-3-28 03:25
Demographischer Wandel in Unternehmeneredges are all minimal hitting sets of the given one. This problem turns out to be central in various fields of Computer Science. We present and experimentally evaluate a heuristic algorithm for the problem, which seems able to handle large instances and also possesses some nice features especially作者: AUGER 時間: 2025-3-28 10:15
Antje Sch?nwald,Olaf Kühne,Anna Currinwith the extensive efforts devoted to studying Euclidean TSP construction heuristics. Motivation for remedying this gap in the study of construction approaches is increased by the fact that such methods are a great deal faster than other TSP heuristics, which can be important for real time problems 作者: CERE 時間: 2025-3-28 12:12
https://doi.org/10.1007/978-3-8350-9561-8ivity to users regardless of their location. Host mobility introduces a number of new features and requirements for the distributed algorithms. In this case, the use of conventional distributed algorithms from mobile hosts results in a number of serious drawbacks. The two tier principle has been pro作者: LUT 時間: 2025-3-28 16:46 作者: 小鹿 時間: 2025-3-28 20:51
Perspektiven und Schlussfolgerungen, of efficient data types and algorithms [.,.]. Moreover, we provide experimental evaluations of the implemented algorithms and we compare their performance to other graph connectivity algorithms currently implemented in LEDA..The first algorithm is the Karp and Tarjan algorithm [.] for finding the c作者: Guaff豪情痛飲 時間: 2025-3-29 00:21 作者: Chameleon 時間: 2025-3-29 04:17 作者: separate 時間: 2025-3-29 09:42 作者: Occlusion 時間: 2025-3-29 14:22 作者: 煩擾 時間: 2025-3-29 16:23 作者: START 時間: 2025-3-29 21:02
https://doi.org/10.1007/978-3-642-59351-2 bounds. We perform an experimental evaluation of hybrid data structures in the context of maintaining a dynamic ordered set whose items have integer or floating-point keys. Among other things we demonstrate clear speedups over library implementations of search trees, both for predecessor queries an作者: CUR 時間: 2025-3-30 03:22
https://doi.org/10.1007/978-3-642-59351-2ed in an . setting. We introduce LEDA-SM that extends the LEDA-library [.] towards secondary memory computation. LEDA-SM uses I/O-efficient algorithms and data structures that do not suffer from the so called .. LEDA is used for in-core computation. We explain the design of LEDA-SM and report on per作者: 發(fā)展 時間: 2025-3-30 05:32 作者: 效果 時間: 2025-3-30 11:36
0302-9743 Overview: Includes supplementary material: 978-3-540-66427-7978-3-540-48318-2Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: micronutrients 時間: 2025-3-30 15:07
https://doi.org/10.1007/978-3-642-59351-2ed in an . setting. We introduce LEDA-SM that extends the LEDA-library [.] towards secondary memory computation. LEDA-SM uses I/O-efficient algorithms and data structures that do not suffer from the so called .. LEDA is used for in-core computation. We explain the design of LEDA-SM and report on performance results.作者: 一美元 時間: 2025-3-30 20:04
LEDA-SM: Extending LEDA to Secondary Memoryed in an . setting. We introduce LEDA-SM that extends the LEDA-library [.] towards secondary memory computation. LEDA-SM uses I/O-efficient algorithms and data structures that do not suffer from the so called .. LEDA is used for in-core computation. We explain the design of LEDA-SM and report on performance results.作者: 樹上結蜜糖 時間: 2025-3-30 21:02
https://doi.org/10.1007/978-3-7091-8559-9In this paper we address the issue of developing test sets for computational evaluation of algorithms. We discuss both test families for comparing several algorithms and selecting one to use in an application, and test families for predicting algorithm performance in practice.作者: HARP 時間: 2025-3-31 02:34
https://doi.org/10.1007/978-3-322-93347-8Stefan N?her and I started the work on LEDA [.] in the spring on 1989. Many collegues and students have contributed to the project since then. A first publication appeared in the fall of the same year [.]. The LEDAbook [.] will appear in the fall of 1999 and should be available at WAE99. ..作者: Retrieval 時間: 2025-3-31 05:25 作者: 瘋狂 時間: 2025-3-31 11:17 作者: 朝圣者 時間: 2025-3-31 17:04
https://doi.org/10.1007/3-540-48318-7Algorithm Engineering; Algorithms; Algorithms Implementation; Computational Discrete Mathematics; Graph 作者: obstinate 時間: 2025-3-31 19:00 作者: sebaceous-gland 時間: 2025-4-1 00:54 作者: 說不出 時間: 2025-4-1 03:07 作者: 妨礙議事 時間: 2025-4-1 08:20 作者: 溺愛 時間: 2025-4-1 12:49 作者: subordinate 時間: 2025-4-1 14:28
Efficient Implementation of Lazy Suffix Treespresentation of suffix trees which requires only 12 bytes per input character in the worst case, and 8.5 bytes per input character on average for a collection of files of different type. We show how to efficiently implement the lazy evaluation of suffix trees such that a subtree is evaluated not bef作者: 抓住他投降 時間: 2025-4-1 19:24
Experiments with List Ranking for Explicit Multi-Threaded (XMT) Instruction Parallelismrallelism (ILP). The main goal of this study is to understand the differences between XMT and more traditional parallel computing implementation platforms/models as they pertain to the well studied list ranking problem. The main two findings are: (i) Good speedups for much smaller inputs are possibl
