標(biāo)題: Titlebook: Analysis of Experimental Algorithms; Special Event, SEA2 Ilias Kotsireas,Panos Pardalos,Arsenis Tsokas Conference proceedings 2019 Springe [打印本頁] 作者: 解毒藥 時(shí)間: 2025-3-21 18:54
書目名稱Analysis of Experimental Algorithms影響因子(影響力)
書目名稱Analysis of Experimental Algorithms影響因子(影響力)學(xué)科排名
書目名稱Analysis of Experimental Algorithms網(wǎng)絡(luò)公開度
書目名稱Analysis of Experimental Algorithms網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Analysis of Experimental Algorithms被引頻次
書目名稱Analysis of Experimental Algorithms被引頻次學(xué)科排名
書目名稱Analysis of Experimental Algorithms年度引用
書目名稱Analysis of Experimental Algorithms年度引用學(xué)科排名
書目名稱Analysis of Experimental Algorithms讀者反饋
書目名稱Analysis of Experimental Algorithms讀者反饋學(xué)科排名
作者: BRAND 時(shí)間: 2025-3-22 00:09
Markus Bodemann,Wiebke Fellner,Vanessa Just scaling to extend the matching via judicious hyperedge selections. Experiments on random, synthetic and real-life hypergraphs show that this new heuristic is highly practical and superior to the others on finding a matching with large cardinality.作者: athlete’s-foot 時(shí)間: 2025-3-22 02:16 作者: Stricture 時(shí)間: 2025-3-22 06:24 作者: Expediency 時(shí)間: 2025-3-22 09:53
https://doi.org/10.1007/978-3-658-32773-6sign methods that construct ZDDs representing the sets of chordal and interval subgraphs from an input graph. Computer experiments show that the proposed methods run faster than reverse search based algorithms.作者: CRANK 時(shí)間: 2025-3-22 14:31
Benjamin N?lting,Nadine Dembskind of . on ., setting . to be some, hopefully rich, set of such minimal separators. Combining this algorithm with new algorithms for exact and heuristic listing of minimal separators, we obtain exact algorithms for treewidth which overwhelmingly outperform previously implemented algorithms.作者: placebo 時(shí)間: 2025-3-22 17:10
Computing a Minimum Color Path in Edge-Colored Graphs, set of synthetic and real world datasets. From our experiments, we found that our heuristics perform significantly better than the best previous heuristic algorithm for the problem on all datasets, both in terms of path quality and the running time.作者: GRATE 時(shí)間: 2025-3-22 23:49 作者: avulsion 時(shí)間: 2025-3-23 02:16 作者: resistant 時(shí)間: 2025-3-23 08:01 作者: Ambiguous 時(shí)間: 2025-3-23 09:55
Improved Contraction Hierarchy Queries via Perfect Stalling,called ., response times still decrease by more than 33% on average. While faster speed-up schemes like hub labels incur a serious space overhead, our precomputed auxiliary information takes less space than the graph representation itself.作者: 牌帶來 時(shí)間: 2025-3-23 15:36 作者: 培養(yǎng) 時(shí)間: 2025-3-23 20:59
Conference proceedings 2019amata, Greece, in June 2019..The 35 revised full papers presented were carefully reviewed and selected from 45 submissions.?The papers cover a wide range of topics in both computer science and operations research/mathematical programming. They focus on?the role of experimentation and engineering tec作者: extemporaneous 時(shí)間: 2025-3-24 01:50 作者: Fulminate 時(shí)間: 2025-3-24 06:21 作者: 思想上升 時(shí)間: 2025-3-24 09:21
Digitalisierung und Kommunikation This work reports the development of a branch and bound approach to solve the Minimum Spanning Tree problem under a min-max regret criterion in the discrete scenario case. The approach is tested in a wide range of test instances and compared with a generic pseudo-polynomial algorithm.作者: Hyperlipidemia 時(shí)間: 2025-3-24 14:40 作者: Proclaim 時(shí)間: 2025-3-24 17:27 作者: 斜谷 時(shí)間: 2025-3-24 19:22 作者: 包租車船 時(shí)間: 2025-3-24 23:52 作者: OMIT 時(shí)間: 2025-3-25 04:14
Daten der Digitalisierung und der KI, faster than the previous best flow-based MILP algorithm on random generated instances, which suggests that a constraint generation approach might be also useful for other optimization problems dealing with connectivity constraints. At last, we present the results of an enumeration algorithm for the problem.作者: 我不重要 時(shí)間: 2025-3-25 08:10
https://doi.org/10.1007/978-3-658-33963-0icle restrictions under the MMAS algorithm. To perform the benchmark analysis instances from TSBLIB were selected. The dynamism was emulated by means of changes in traffic factors. The results indicate that for ADTSP the MMAS-US is the best algorithm while for ADTSPMV the MMAS-3opt is the most suitable.作者: ETCH 時(shí)間: 2025-3-25 12:07 作者: 分離 時(shí)間: 2025-3-25 16:38 作者: 支架 時(shí)間: 2025-3-25 23:44 作者: 軟膏 時(shí)間: 2025-3-26 02:28
Analysis of Max-Min Ant System with Local Search Applied to the Asymmetric and Dynamic Travelling Sicle restrictions under the MMAS algorithm. To perform the benchmark analysis instances from TSBLIB were selected. The dynamism was emulated by means of changes in traffic factors. The results indicate that for ADTSP the MMAS-US is the best algorithm while for ADTSPMV the MMAS-3opt is the most suitable.作者: 闖入 時(shí)間: 2025-3-26 05:14
Voronoi Diagram of Orthogonal Polyhedra in Two and Three Dimensions,ll size for the subdivision to stop, and . bounds vertex cardinality per facet. We also provide a numerically stable, open-source implementation in Julia, illustrating the practical nature of our algorithm.作者: 察覺 時(shí)間: 2025-3-26 11:02
The Complexity of Subtree Intersection Representation of Chordal Graphs and Linear Time Chordal Graey are sufficient to generate every chordal graph. Furthermore, the sum of the sizes of the subtrees in such a representation is at most .. We use this result to derive the first linear time random chordal graph generator. In addition to these theoretical results, we conduct experiments to study the作者: 嫻熟 時(shí)間: 2025-3-26 15:38 作者: 廚師 時(shí)間: 2025-3-26 18:43 作者: 丑惡 時(shí)間: 2025-3-26 22:37 作者: 歌曲 時(shí)間: 2025-3-27 02:33
Efficient Split-Radix and Radix-4 DCT Algorithms and Applications,roposed algorithms is presented while verifying the connection to the order of the arithmetic complexity. Moreover, we will show that the execution time of the proposed split-radix and radix-4 algorithms are more efficient than the radix-2 DCT algorithms. Finally, the implementations of the proposed作者: spinal-stenosis 時(shí)間: 2025-3-27 06:18 作者: Maximizer 時(shí)間: 2025-3-27 11:50 作者: organism 時(shí)間: 2025-3-27 16:40
Friederike Müller-Friemauth,Rainer Kühnll size for the subdivision to stop, and . bounds vertex cardinality per facet. We also provide a numerically stable, open-source implementation in Julia, illustrating the practical nature of our algorithm.作者: engrave 時(shí)間: 2025-3-27 18:51
Digitalisierung und Kommunikationey are sufficient to generate every chordal graph. Furthermore, the sum of the sizes of the subtrees in such a representation is at most .. We use this result to derive the first linear time random chordal graph generator. In addition to these theoretical results, we conduct experiments to study the作者: cocoon 時(shí)間: 2025-3-27 23:31
Melanie Malczok,Sabine Kirchhoffwe propose a new metric called the Mean Effective Average Rank (MEAR), which quantifies the goodness of allotment from the side of the students or the courses. We empirically evaluate two many-to-one matching algorithms with synthetic data modeled on real-world instances and present the evaluation o作者: 極微小 時(shí)間: 2025-3-28 03:42 作者: 背心 時(shí)間: 2025-3-28 07:14
https://doi.org/10.1007/978-3-658-31795-9dification retain advantage by 30% in terms of running time on ordered trees. On red-black trees, the advantage of the new algorithm is significant. This especially applies to the asynchronous version of the algorithm.作者: 遠(yuǎn)地點(diǎn) 時(shí)間: 2025-3-28 10:37 作者: BATE 時(shí)間: 2025-3-28 15:04
Voronoi Diagram of Orthogonal Polyhedra in Two and Three Dimensions,hedra in two and three-dimensional space under the max-norm, which is a particularly useful scenario in certain application domains. We construct the exact Voronoi diagram inside an orthogonal polyhedron with holes defined by such polyhedra. Our approach avoids creating full-dimensional elements on 作者: 飾帶 時(shí)間: 2025-3-28 20:12
The Complexity of Subtree Intersection Representation of Chordal Graphs and Linear Time Chordal Graused in [.] to generate random chordal graphs on . vertices by generating . subtrees of a tree on . nodes. It follows that the space (and thus time) complexity of such an algorithm is at least the sum of the sizes of the generated subtrees assuming that a tree is given by a set of nodes. In [.], thi作者: 音樂等 時(shí)間: 2025-3-29 01:42 作者: 沉積物 時(shí)間: 2025-3-29 05:35 作者: cancellous-bone 時(shí)間: 2025-3-29 10:19
A Combinatorial Branch and Bound for the Min-Max Regret Spanning Tree Problem,em. The min-max regret criterion aims at obtaining a solution minimizing the maximum deviation, over all possible scenarios, from the optimal value of each scenario. Well-known problems, such as the shortest path problem and the minimum spanning tree, become NP-hard under a min-max regret criterion.作者: 油氈 時(shí)間: 2025-3-29 14:27
Navigating a Shortest Path with High Probability in Massive Complex Networks,ntaining millions of vertices may cost a few seconds and it can not meet the demands of real-time applications. Some existing landmark-based methods have been proposed to solve this problem in sacrifice of precision. However, their query precision and efficiency is not high enough. We first present 作者: Expostulate 時(shí)間: 2025-3-29 16:58
Engineering a PTAS for Minimum Feedback Vertex Set in Planar Graphs,-time approximation schemes (PTASes) for problems in planar graphs were based on balanced separators, wherein graphs are recursively decomposed into small enough pieces in which optimal solutions can be found by brute force or other methods. However, this technique was supplanted by the more modern 作者: COKE 時(shí)間: 2025-3-29 20:45 作者: 不可磨滅 時(shí)間: 2025-3-30 01:36
Colorful Frontier-Based Search: Implicit Enumeration of Chordal and Interval Subgraphs,D). A ZDD can represent the set of solutions quite compactly. Recent studies have demonstrated that a technique generically called frontier-based search (FBS) is a powerful framework for using ZDDs to enumerate various yet rather simple types of subgraphs. We in this paper, propose colorful FBS, an 作者: 空洞 時(shí)間: 2025-3-30 06:28 作者: Monolithic 時(shí)間: 2025-3-30 10:46
Improved Contraction Hierarchy Queries via Perfect Stalling,r the CH query routine and devise an additional preprocessing step which gathers auxiliary information such that CH queries can be answered even faster than before. Compared to the standard CH query, response times decrease by more than 70%; compared to a well-known refined CH query routine with so-作者: Sedative 時(shí)間: 2025-3-30 13:25
Constraint Generation Algorithm for the Minimum Connectivity Inference Problem,ery hyperedge of . is connected. This problem has received a lot of attention these recent years, both from a theoretical and practical perspective, leading to several implemented approximation, greedy and heuristic algorithms. Concerning exact algorithms, only Mixed Integer Linear Programming (MILP作者: 可轉(zhuǎn)變 時(shí)間: 2025-3-30 18:46
Efficient Split-Radix and Radix-4 DCT Algorithms and Applications,dix-4 algorithms extend the previous work on the lowest multiplication complexity, self-recursive, radix-2 DCT II/III algorithms. The paper also addresses the self-recursive and stable aspects of split-radix and radix-4 DCT II/III algorithms having simple, sparse, and scaled orthogonal factors. More作者: 吞下 時(shí)間: 2025-3-30 21:58
Analysis of Max-Min Ant System with Local Search Applied to the Asymmetric and Dynamic Travelling S Max-Min Ant System (MMAS) combined with local search applied to the Asymmetric and Dynamic Travelling Salesman Problem with Moving Vehicle (ADTSPMV). Different from the well known ADTSP, in the moving vehicle scenario the optimization algorithm continues to improve the TSP solution while the vehicl作者: 譏諷 時(shí)間: 2025-3-31 01:15
Computing Treewidth via Exact and Heuristic Lists of Minimal Separators,m which, given a graph ., a positive integer ., and a set . of minimal separators of ., decides if . has a tree-decomposition of width at most . of a certain canonical form that uses minimal separators only from ., in the sense that the intersection of every pair of adjacent bags belongs to .. This 作者: Tdd526 時(shí)間: 2025-3-31 05:52
Fast Public Transit Routing with Unrestricted Walking Through Hub Labeling,es of queries: earliest arrival time, Pareto-optimal journeys regarding arrival time, number of transfers and walking time, and profile, i.e. finding all Pareto-optimal journeys regarding travel time and arrival time in a given time interval. Our techniques uses hub labeling to represent unlimited f作者: 謙虛的人 時(shí)間: 2025-3-31 11:20 作者: 鞏固 時(shí)間: 2025-3-31 16:05
Analysis of Experimental Algorithms978-3-030-34029-2Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: fleeting 時(shí)間: 2025-3-31 18:59 作者: 壯觀的游行 時(shí)間: 2025-3-31 22:29 作者: 啞巴 時(shí)間: 2025-4-1 02:03 作者: extemporaneous 時(shí)間: 2025-4-1 09:53 作者: 隱士 時(shí)間: 2025-4-1 11:06
Melanie Malczok,Sabine Kirchhoffedit limits, time-slot constraints for courses, basket constraints (say, at most one humanities elective for a student), in addition to the preferences of students over courses and vice versa, and class capacities. We model this problem as a many-to-many bipartite matching problem where both student作者: MITE 時(shí)間: 2025-4-1 14:26
