標題: Titlebook: Experimental Algorithms; 6th International Wo Camil Demetrescu Conference proceedings 2007 Springer-Verlag Berlin Heidelberg 2007 Simulatio [打印本頁] 作者: 揭發(fā) 時間: 2025-3-21 16:06
書目名稱Experimental Algorithms影響因子(影響力)
書目名稱Experimental Algorithms影響因子(影響力)學科排名
書目名稱Experimental Algorithms網(wǎng)絡公開度
書目名稱Experimental Algorithms網(wǎng)絡公開度學科排名
書目名稱Experimental Algorithms被引頻次
書目名稱Experimental Algorithms被引頻次學科排名
書目名稱Experimental Algorithms年度引用
書目名稱Experimental Algorithms年度引用學科排名
書目名稱Experimental Algorithms讀者反饋
書目名稱Experimental Algorithms讀者反饋學科排名
作者: exostosis 時間: 2025-3-21 23:22 作者: 煩人 時間: 2025-3-22 01:53 作者: corporate 時間: 2025-3-22 05:44 作者: 合適 時間: 2025-3-22 12:49
The Revival of the Minority-Alliance,ts. Our preprocessing and side computation costs are the same as for AESA. We propose several improvements, achieving e.g. .(..) construction cost for some 0?
作者: 離開就切除 時間: 2025-3-22 15:27
An Alternative Ranking Problem for Search Enginess of experiments comparing these algorithms on several datasets and contrast them with those obtained using an AUC-maximization algorithm. We also compare training times and performance results for the on-line and batch versions, demonstrating that our on-line algorithm scales to relatively large da作者: 離開就切除 時間: 2025-3-22 20:00
Random Models for Geometric Graphs (Abstract)irectional radio frequency and optical networks, is the ., a generalization of the random geometric graph introduced in [1]. In the setting under consideration, each node has a fixed angle . (0?
作者: 植物茂盛 時間: 2025-3-22 22:37 作者: Bureaucracy 時間: 2025-3-23 03:44 作者: 膽汁 時間: 2025-3-23 07:33
Simple Space-Time Trade-Offs for AESAts. Our preprocessing and side computation costs are the same as for AESA. We propose several improvements, achieving e.g. .(..) construction cost for some 0?
作者: Vsd168 時間: 2025-3-23 09:56 作者: 純樸 時間: 2025-3-23 14:19
,Israel — ein Staat wie jeder andere?,ably fast for graphs of small diameter, and that worst-case and randomized data structures are best when queries are very frequent. The best overall performance, however, is achieved by self-adjusting ST-trees.作者: 改變立場 時間: 2025-3-23 20:16 作者: PRE 時間: 2025-3-24 00:50 作者: 圓錐體 時間: 2025-3-24 04:21 作者: 輕彈 時間: 2025-3-24 09:27
Cache-, Hash- and Space-Efficient Bloom Filtersilters and the proposed replacements in detail, in terms of the false positive rate, the number of expected cache-misses, and the number of required hash bits. We also describe and experimentally evaluate the performance of highly-tuned implementations. For many settings, our alternatives perform better than the methods proposed so far.作者: Adornment 時間: 2025-3-24 14:07
0302-9743 n Rome, Italy, in June 2007...The 30 revised full papers presented together with 3 invited talks were carefully reviewed and selected from 121 submissions. Fostering and disseminating high quality research results focused on the experimental analysis of algorithms the papers are devoted to the desig作者: 過分自信 時間: 2025-3-24 16:12
Robert A. Kenedy,Uzi Rebhun,Carl S. Ehrlichwe make preprocessing and queries faster while reducing the overall space requirements. On the road networks of the USA or Europe, the shortest path between two random vertices can be found in about one millisecond after one or two hours of preprocessing. The algorithm is also effective on two-dimensional grids.作者: 薄膜 時間: 2025-3-24 19:19 作者: considerable 時間: 2025-3-25 00:21
Israelische Charedim und politische Moderneat most 2.?+?.(.) bits of space, where .?=?. (..(.)?+?1), and ..(.) is the zeroth-order empirical entropy of .. We discuss a number of improvements and trade-offs over the basic method. The new method is applied to text compression. We also propose average case optimal string matching algorithms.作者: pester 時間: 2025-3-25 05:14 作者: 車床 時間: 2025-3-25 11:21
On the Cost of Persistence and Authentication in Skip Listsand analyze the impact of garbage collection and virtual memory paging, as well. Our empirical study confirms the efficiency of authenticated skip lists and offers guidelines for incorporating them in various applications.作者: brother 時間: 2025-3-25 13:52 作者: 使成波狀 時間: 2025-3-25 17:49
Conference proceedings 2007vanced algorithmic techniques, such as combinatorial optimization, approximation, graph theory, discrete mathematics, data mining, simulation, cryptography and security, scheduling, searching, sorting, string matching, coding, networking, etc..作者: Living-Will 時間: 2025-3-25 20:15
0302-9743 pplying advanced algorithmic techniques, such as combinatorial optimization, approximation, graph theory, discrete mathematics, data mining, simulation, cryptography and security, scheduling, searching, sorting, string matching, coding, networking, etc..978-3-540-72844-3978-3-540-72845-0Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: intuition 時間: 2025-3-26 00:37 作者: Tartar 時間: 2025-3-26 06:03
Israel: National Security and Securitizational problem within a constant approximation ratio of 3. In addition we provide appropriate generalizations of some common heuristics usually employed for the unweighted case and compare their performances.作者: BADGE 時間: 2025-3-26 10:52 作者: Acetaminophen 時間: 2025-3-26 14:27 作者: 狗窩 時間: 2025-3-26 20:37 作者: 護身符 時間: 2025-3-27 00:57
Simple and Efficient Geographic Routing Around Obstacles for Wireless Sensor Networks large convex obstacles, finds short paths to the destination, resists link failure and is fairly simple to implement. The case of hard concave obstacles is also studied; such obstacles are hard instances for which performance diminishes.作者: Canopy 時間: 2025-3-27 03:03
Conference proceedings 2007aly, in June 2007...The 30 revised full papers presented together with 3 invited talks were carefully reviewed and selected from 121 submissions. Fostering and disseminating high quality research results focused on the experimental analysis of algorithms the papers are devoted to the design, analysi作者: 參考書目 時間: 2025-3-27 07:27 作者: Judicious 時間: 2025-3-27 12:30 作者: GLOOM 時間: 2025-3-27 15:22 作者: indifferent 時間: 2025-3-27 21:18 作者: harbinger 時間: 2025-3-28 01:44
A Robust Branch-Cut-and-Price Algorithm for the Heterogeneous Fleet Vehicle Routing Problem. Those cuts do not increase the complexity of the pricing subproblem. Experiments are reported where instances up to 75 vertices were solved to optimality, a major improvement with respect to previous algorithms.作者: mastoid-bone 時間: 2025-3-28 05:57
A Distributed Primal-Dual Heuristic for Steiner Problems in Networksl-dual heuristic (known as Dual Ascent), known for its remarkable good practical results, lower and upper bounds, in both undirected and directed Steiner problems. Experimental results and complexity analysis are also presented, showing the efficiency of the proposed algorithm when compared with the best distributed algorithms in the literature.作者: 饑荒 時間: 2025-3-28 07:39 作者: 滔滔不絕地說 時間: 2025-3-28 13:03
Engineering Fast Route Planning Algorithmsmes faster than Dijkstra’s algorithm. We outline ideas, algorithms, implementations, and experimental methods behind this development. We also explain why the story is not over yet because dynamically changing networks, flexible objective functions, and new applications pose a lot of interesting cha作者: 不可救藥 時間: 2025-3-28 15:30
Random Models for Geometric Graphs (Abstract)pattern in wireless ad-hoc networks. The different communication ways or protocol implementations have directed the interest of the commnity to study and use different intersection graph families as basic models of communication. In this talk we review those models when the graph nodes are placed at作者: ANTI 時間: 2025-3-28 19:01
Better Landmarks Within Reachdmark-based lower bounds, and reach-based pruning. Through reach-aware landmarks, better use of cache, and improved algorithms for reach computation, we make preprocessing and queries faster while reducing the overall space requirements. On the road networks of the USA or Europe, the shortest path b作者: amplitude 時間: 2025-3-29 02:59
Landmark-Based Routing in Dynamic Graphscessed information, which has to be updated whenever the graph is changed. However, goal directed search based on landmarks (.) still performs correct queries as long as an edge weight does not drop below its initial value. In this work, we evaluate the robustness of . with respect to traffic jams. 作者: 和平主義者 時間: 2025-3-29 03:34
Dynamic Highway-Node Routingrios that arise in present-day navigation systems: When an edge weight changes (e.g., due to a traffic jam), we can update the preprocessed information in 2–40 ms allowing subsequent fast queries in about one millisecond on average. When we want to perform only a single query, we can skip the compar作者: Guileless 時間: 2025-3-29 10:59 作者: HEW 時間: 2025-3-29 13:33 作者: 新星 時間: 2025-3-29 15:42
Cache-, Hash- and Space-Efficient Bloom Filtersw variants of Bloom filters and replacements with similar functionality. All of them have a better cache-efficiency and need less hash bits than regular Bloom filters. Some use SIMD functionality, while the others provide an even better space efficiency. As a consequence, we get a more flexible trad作者: 使人入神 時間: 2025-3-29 21:18
Crossing Minimization in Weighted Bipartite Graphse number of crossings has received much attention in literature. The problem is NP-complete in general and several practically efficient heuristics and polynomial-time algorithms with a constant approximation ratio have been suggested. We generalize the problem and consider the version where the edg作者: hardheaded 時間: 2025-3-30 01:08
Fast Minimum-Weight Double-Tree Shortcutting for Metric TSPexponential-sized space of TSP tours, each of which is a 2-approximation to the exact solution. We consider the problem of ., for which Burkard et al. gave an algorithm running in time .(2...) and memory .(2...), where . is the maximum node degree in the rooted minimum spanning tree (e.g. in the non作者: UTTER 時間: 2025-3-30 04:25 作者: 馬賽克 時間: 2025-3-30 11:45
Simple and Efficient Geographic Routing Around Obstacles for Wireless Sensor Networksithms are very efficient, however they require a preliminary planarization of the communication graph. Planarization induces overhead and is thus not realistic for some scenarios such as the case of highly dynamic network topologies. On the other hand, georouting algorithms which do not rely on plan作者: 好開玩笑 時間: 2025-3-30 13:35
A Distributed Primal-Dual Heuristic for Steiner Problems in Networks where most of the traffic has a single source. Sequential Steiner heuristics are not convenient in that context, since one cannot assume that a central node has complete information about the topology and the state of a large wide area network. This paper introduces a distributed version of a prima作者: 微生物 時間: 2025-3-30 18:05
An Experimental Study of Stability in Heterogeneous Networkside variety of . are simultaneously running over different network hosts. A fundamental question that naturally poses itself for such common settings of heterogeneous networks concerns their ability to preserve the number of packets in the system upper bounded at all times. This property is well-kno作者: gratify 時間: 2025-3-30 21:43 作者: 鬧劇 時間: 2025-3-31 03:01
Engineering a Compressed Suffix Tree Implementationenting those algorithms and applying them to real genomic sequences, often the main memory size becomes the bottleneck. This is easily explained by the fact that while a DNA sequence of length . from alphabet .?=?{.,.,.,.} can be stored in . log|.|?=?2. bits, its suffix tree occupies .(.log.) bits. 作者: Consequence 時間: 2025-3-31 06:58 作者: GULF 時間: 2025-3-31 11:23 作者: Dungeon 時間: 2025-3-31 17:05
The Politics of Political Despairmes faster than Dijkstra’s algorithm. We outline ideas, algorithms, implementations, and experimental methods behind this development. We also explain why the story is not over yet because dynamically changing networks, flexible objective functions, and new applications pose a lot of interesting challenges.作者: Gastric 時間: 2025-3-31 17:51 作者: 熱情贊揚 時間: 2025-3-31 22:27
