標題: Titlebook: Experimental Algorithms; 14th International S Evripidis Bampis Conference proceedings 2015 Springer International Publishing Switzerland 20 [打印本頁] 作者: Embolism 時間: 2025-3-21 16:30
書目名稱Experimental Algorithms影響因子(影響力)
書目名稱Experimental Algorithms影響因子(影響力)學科排名
書目名稱Experimental Algorithms網絡公開度
書目名稱Experimental Algorithms網絡公開度學科排名
書目名稱Experimental Algorithms被引頻次
書目名稱Experimental Algorithms被引頻次學科排名
書目名稱Experimental Algorithms年度引用
書目名稱Experimental Algorithms年度引用學科排名
書目名稱Experimental Algorithms讀者反饋
書目名稱Experimental Algorithms讀者反饋學科排名
作者: magnate 時間: 2025-3-22 00:09 作者: TIGER 時間: 2025-3-22 04:19
Palgrave Studies in Pacific Historysocial networks. We implement a branch and bound algorithm and tune it for efficiency on sparse real-world graphs for the case .. Central issues for the implementation are the choice of branching candidates, two new upper bounding procedures, and several data reduction and early termination rules.作者: nascent 時間: 2025-3-22 04:39
Jeffrey Henry,Michel Boivin,George Tarabulsye. In experiments using up to 64 cores and on inputs of different sizes, our algorithm achieved good parallel speed-up. We also present an algorithm that takes . time to construct the balanced parenthesis representation of the input tree required by our succinct tree construction algorithm.作者: 遭遇 時間: 2025-3-22 12:45 作者: MOAT 時間: 2025-3-22 15:06
Narrative Jamming in the Family Saga, cover inequalities for the max clique and knapsack problems. They show that, with respect to standard algorithms, the bound-optimal cutting plane method allows for a substantial reduction in the number of cuts and iterations needed to achieve either a given bound or an optimal solution.作者: MOAT 時間: 2025-3-22 17:13
Inverse Methods for Ocean Circulation,hm. Along the way, we developed a new feature which we incorporated into the global-optimization solver . and made accessible via the modeling language ., for handling piecewise-smooth univariate functions that are globally concave.作者: 打包 時間: 2025-3-23 00:36 作者: 上釉彩 時間: 2025-3-23 03:37 作者: 舊石器 時間: 2025-3-23 06:31 作者: Biofeedback 時間: 2025-3-23 10:44 作者: Intrepid 時間: 2025-3-23 16:19
On a Nonconvex MINLP Formulation of the Euclidean Steiner Tree Problem in ,-Spacehm. Along the way, we developed a new feature which we incorporated into the global-optimization solver . and made accessible via the modeling language ., for handling piecewise-smooth univariate functions that are globally concave.作者: Gudgeon 時間: 2025-3-23 21:14
Reoptimization Techniques for MIP Solvers based on the idea to “warmstart” using the final search frontier of the preceding solver run. We extend the academic MIP solver . by these techniques to obtain a reoptimizing branch-and-bound solver and report computational results which show the effectiveness of the approach.作者: 公社 時間: 2025-3-24 01:24
Conference proceedings 2015ne/July 2015..The 30 revised full papers presented were carefully reviewed and selected from 76 submissions. The main theme of the symposium is the role of experimentation and of algorithm engineering techniques in the design and evaluation of algorithms and data structures. The papers are grouped i作者: 漂白 時間: 2025-3-24 06:12 作者: 積云 時間: 2025-3-24 07:57 作者: Countermand 時間: 2025-3-24 14:31
Conference proceedings 2015le of experimentation and of algorithm engineering techniques in the design and evaluation of algorithms and data structures. The papers are grouped in topical sections on data structures, graph problems, combinatorial optimization, scheduling and allocation, and transportation networks..作者: RENAL 時間: 2025-3-24 16:31
Patrick H. Tolan,Bennett L. Leventhalan in-memory representation that supports basic navigation operations in worst-case logarithmic time without decompression. We also show a much improved worst-case bound on the size of the output of top-tree compression (answering an open question posed in a talk on this algorithm by Weimann in 2012).作者: recede 時間: 2025-3-24 19:49 作者: 反省 時間: 2025-3-25 01:47
Conclusion: the Politics of Genealogyets. To enhance newly computed offsprings we combine our operators with a local search algorithm. Our experimental evaluation indicates that we are able to outperform state-of-the-art algorithms on a variety of instances.作者: SOBER 時間: 2025-3-25 05:26
Tree Compression with Top Trees Revisitedan in-memory representation that supports basic navigation operations in worst-case logarithmic time without decompression. We also show a much improved worst-case bound on the size of the output of top-tree compression (answering an open question posed in a talk on this algorithm by Weimann in 2012).作者: GRAZE 時間: 2025-3-25 07:47
Greedily Improving Our Own Centrality in A Networkal-time approximation scheme (unless .), and we then propose a simple greedy approximation algorithm (with an almost tight approximation ratio), whose performance is then tested on synthetic graphs and real-world networks.作者: 并排上下 時間: 2025-3-25 15:12
Graph Partitioning for Independent Setsets. To enhance newly computed offsprings we combine our operators with a local search algorithm. Our experimental evaluation indicates that we are able to outperform state-of-the-art algorithms on a variety of instances.作者: Tremor 時間: 2025-3-25 18:04
0302-9743 grouped in topical sections on data structures, graph problems, combinatorial optimization, scheduling and allocation, and transportation networks..978-3-319-20085-9978-3-319-20086-6Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: CAPE 時間: 2025-3-25 23:54 作者: interior 時間: 2025-3-26 00:19 作者: cochlea 時間: 2025-3-26 07:21 作者: GULF 時間: 2025-3-26 10:15 作者: flutter 時間: 2025-3-26 12:45
Jeffrey Henry,Michel Boivin,George Tarabulsystant time. However, their construction time remains a bottleneck. We introduce a practical parallel algorithm that improves the state of the art in succinct tree construction. Given a tree on . nodes stored as a sequence of balanced parentheses, our algorithm builds a succinct tree representation i作者: aerial 時間: 2025-3-26 20:03
Patrick H. Tolan,Bennett L. Leventhaleducing the amount of information stored and guiding the compression step using a RePair-inspired heuristic, we obtain a fast compressor achieving good compression ratios, addressing an open problem posed by [.]. We show how, with relatively small overhead, the compressed file can be converted into 作者: ADORN 時間: 2025-3-27 00:52 作者: hazard 時間: 2025-3-27 03:03 作者: Modify 時間: 2025-3-27 08:46
Cultivating Genius in a Bolshevik Country,d for general directed graphs, i.e., it does not assume that given graphs are undirected or strongly connected. Experimental results on large real graphs show that the proposed algorithm is several orders of magnitude faster than the naive approach, and it reveals the exact diameters of large real d作者: MURKY 時間: 2025-3-27 09:34 作者: Nucleate 時間: 2025-3-27 16:14 作者: 粗鄙的人 時間: 2025-3-27 19:32 作者: agitate 時間: 2025-3-28 00:34 作者: figurine 時間: 2025-3-28 03:06 作者: 食料 時間: 2025-3-28 07:21
General Cost Structure Analysisive scheduling in MapReduce systems. Our results concern the minimization of the total weighted completion time of a set of MapReduce jobs on unrelated processors and improve substantially on the model proposed by Moseley et al. (SPAA 2011) in two directions: (i) we consider jobs consisting of multi作者: goodwill 時間: 2025-3-28 11:38 作者: 虛構的東西 時間: 2025-3-28 17:39
Global Analysis in Economic Theory,f the knapsack. We refer to this problem as the online . problem. Any algorithm must provide a strategy for ordering the items that are inserted in the knapsack in an online fashion, until the actual capacity of the knapsack is revealed and the last inserted item might not fit in. Apart from the int作者: 籠子 時間: 2025-3-28 18:54 作者: Atmosphere 時間: 2025-3-29 01:11 作者: prick-test 時間: 2025-3-29 06:45
Experimental Algorithms978-3-319-20086-6Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 拱墻 時間: 2025-3-29 07:16
https://doi.org/10.1007/978-3-319-20086-6Approximation algorithms; Character classes; Combinatorial optimization; Computational complexity; Compu作者: 過份 時間: 2025-3-29 11:25 作者: 坦白 時間: 2025-3-29 17:35 作者: Harrowing 時間: 2025-3-29 21:45
Global Analysis in Economic Theory,ap with the provided bound of ., the inverse of the golden number. We then conduct experimental analysis for the competitive ratio guaranteed algorithms compared to the optimum and to various heuristics.作者: 叢林 時間: 2025-3-30 03:06
Separation of Generic Cutting Planes in Branch-and-Price Using a Basisider additional valid inequalities strengthening the original LP relaxation before separation. Our full implementation, which is the first of its kind, is done within the . framework. We evaluate the effects on several problem classes. Our experiments show that the separated cuts strengthen the form作者: FAZE 時間: 2025-3-30 06:59
Online Knapsack of Unknown Capacity:ap with the provided bound of ., the inverse of the golden number. We then conduct experimental analysis for the competitive ratio guaranteed algorithms compared to the optimum and to various heuristics.作者: Nostalgia 時間: 2025-3-30 08:26
Parallel Construction of Succinct Treesstant time. However, their construction time remains a bottleneck. We introduce a practical parallel algorithm that improves the state of the art in succinct tree construction. Given a tree on . nodes stored as a sequence of balanced parentheses, our algorithm builds a succinct tree representation i作者: 輕快來事 時間: 2025-3-30 13:48 作者: 只有 時間: 2025-3-30 18:11 作者: 悅耳 時間: 2025-3-31 00:35
Greedily Improving Our Own Centrality in A Networkness or betweenness centrality can have positive impact on the vertex itself: hence, in this paper we consider the problem of determining how much a vertex can increase its centrality by creating a limited amount of new edges incident to it. We first prove that this problem does not admit a polynomi作者: Encephalitis 時間: 2025-3-31 01:41
An Exact Algorithm for Diameters of Large Real Directed Graphsd for general directed graphs, i.e., it does not assume that given graphs are undirected or strongly connected. Experimental results on large real graphs show that the proposed algorithm is several orders of magnitude faster than the naive approach, and it reveals the exact diameters of large real d作者: Cultivate 時間: 2025-3-31 08:27
Graph Partitioning for Independent Setse the problem. The core innovations of the algorithm are very natural combine operations based on graph partitioning and local search algorithms. More precisely, we employ a state-of-the-art graph partitioner to derive operations that enable us to quickly exchange whole blocks of given independent s
