標題: Titlebook: Experimental and Efficient Algorithms; Second International Klaus Jansen,Marian Margraf,José D. P. Rolim Conference proceedings 2003 Spring [打印本頁] 作者: 忠誠 時間: 2025-3-21 18:27
書目名稱Experimental and Efficient Algorithms影響因子(影響力)
書目名稱Experimental and Efficient Algorithms影響因子(影響力)學科排名
書目名稱Experimental and Efficient Algorithms網絡公開度
書目名稱Experimental and Efficient Algorithms網絡公開度學科排名
書目名稱Experimental and Efficient Algorithms被引頻次
書目名稱Experimental and Efficient Algorithms被引頻次學科排名
書目名稱Experimental and Efficient Algorithms年度引用
書目名稱Experimental and Efficient Algorithms年度引用學科排名
書目名稱Experimental and Efficient Algorithms讀者反饋
書目名稱Experimental and Efficient Algorithms讀者反饋學科排名
作者: 錫箔紙 時間: 2025-3-21 21:33
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/e/image/318969.jpg作者: 一大群 時間: 2025-3-22 00:27
https://doi.org/10.1007/978-3-662-55540-8We present two theoretically interesting and empirically successful techniques for improving the linear programming approaches, namely graph transformation and local cuts, in the context of the Steiner problem. We show the impact of these techniques on the solution of the largest benchmark instances ever solved.作者: Synovial-Fluid 時間: 2025-3-22 06:16
https://doi.org/10.1007/978-3-319-55769-4In this paper an on-line algorithm for the Rectangle Packing Problem is presented. The method is designed to be able to accept or reject incoming boxes to maximize efficiency. We provide a wide computational analysis showing the behavior of the proposed algorithm as well as a comparison with existing off-line heuristics.作者: 發(fā)電機 時間: 2025-3-22 11:54
,Theoretische Analyse der positiven S?ule,The problem to decide whether a graph is 3-colorable is NP-complete. We show that if . is a locally connected graph (neighborhood of each vertex induces a connected graph), then there exists a linear algorithm which either finds a 3-coloring of ., or indicates that such coloring does not exist.作者: SHRIK 時間: 2025-3-22 15:13
Improving Linear Programming Approaches for the Steiner Tree Problem,We present two theoretically interesting and empirically successful techniques for improving the linear programming approaches, namely graph transformation and local cuts, in the context of the Steiner problem. We show the impact of these techniques on the solution of the largest benchmark instances ever solved.作者: SHRIK 時間: 2025-3-22 18:48 作者: ABASH 時間: 2025-3-22 21:15
Linear Algorithm for 3-Coloring of Locally Connected Graphs,The problem to decide whether a graph is 3-colorable is NP-complete. We show that if . is a locally connected graph (neighborhood of each vertex induces a connected graph), then there exists a linear algorithm which either finds a 3-coloring of ., or indicates that such coloring does not exist.作者: 盟軍 時間: 2025-3-23 04:28
Schlussbetrachtungen und Zusammenfassungen, .. We have also implemented and experimentally evaluated the performance of most of the known approximation colouring algorithms for SQPG [., ., ., .]. We compare the quality of the colourings achieved by these algorithms, with the colourings obtained by our algorithms and with the results obtained作者: stressors 時間: 2025-3-23 05:43
https://doi.org/10.1007/978-88-470-1100-7uling problem. In such a setting, jobs are characterized by a processing time and a memory size. Every job must be scheduled on one of the . processors so as to minimize the time makespan and the maximum memory occupation per processor simultaneously. We consider four fundamental classes of algorith作者: 起皺紋 時間: 2025-3-23 13:20 作者: 共同給與 時間: 2025-3-23 15:20
Pranita Kaphle,Li Yao,Joshua Kehler solve many basic optimization problems in polynomial time when the treewidth is bounded. So, given an arbitrary graph, its decomposition and its treewidth have to be determined, but computing the treewidth of a graph is NP-Hard. Hence, several papers present heuristics with computational experiment作者: POINT 時間: 2025-3-23 22:02
Alejandro D. Roth,Marco T. Nú?ezed (random) strings. For instance, this is the case of URL addresses, IP addresses, or XML path strings, all representing paths in some hierarchical order. As strings sharing a portion of the path have a quite long common prefix, we need to avoid the time-consuming repeated examination of these comm作者: Serenity 時間: 2025-3-23 23:15
https://doi.org/10.1007/978-1-4020-7937-5. We provide experimental evidence of the basic parameters and of the performance of the distributed protocols described and analyzed under assymptotic assumptions in [.] for relatively small random networks (1000 to 15000 sensors).作者: 闖入 時間: 2025-3-24 05:56 作者: aerobic 時間: 2025-3-24 09:56 作者: avenge 時間: 2025-3-24 14:14
https://doi.org/10.1007/978-981-16-9077-8 an O(log .)-factor approximation by solving its dually related maximum concurrent flow problem. We formulate the minimum ratio-cut as a certain nondifferentiable optimization problem, and show that the global minimum of the optimization problem is equal to the minimum ratio-cut. Moreover, we provid作者: 內疚 時間: 2025-3-24 16:13 作者: Narrative 時間: 2025-3-24 21:27 作者: Accolade 時間: 2025-3-24 23:15 作者: 是剝皮 時間: 2025-3-25 04:17 作者: 神圣在玷污 時間: 2025-3-25 08:58 作者: 護身符 時間: 2025-3-25 11:52 作者: Mirage 時間: 2025-3-25 19:36
https://doi.org/10.1007/978-1-4939-7659-1p, i.e. with unlimited capacity buffer, and job shop problems with blocking and no-wait. The proposed algorithm family is a simple randomized greedy family based on a general formulation of the job shop problem. We report on an extensive study of the proposed algorithms, and comparisons with other g作者: 冥界三河 時間: 2025-3-25 23:26 作者: extrovert 時間: 2025-3-26 00:21 作者: 疲憊的老馬 時間: 2025-3-26 04:57 作者: 虛弱 時間: 2025-3-26 09:15
https://doi.org/10.1007/978-1-4020-7937-5. We provide experimental evidence of the basic parameters and of the performance of the distributed protocols described and analyzed under assymptotic assumptions in [.] for relatively small random networks (1000 to 15000 sensors).作者: 不可救藥 時間: 2025-3-26 15:27 作者: Negotiate 時間: 2025-3-26 19:57
: A New Efficient Variant of the Boyer-Moore String Matching Algorithm,h the Horspool, Quick Search, Tuned Boyer-Moore, and Reverse Factor algorithms, which are among the fastest string matching algorithms for practical uses. It turns out that our algorithm achieve very good results in terms of both time efficiency and number of character inspections, especially in the cases in which the patterns are very short.作者: 古老 時間: 2025-3-26 21:37
Evaluation of Basic Protocols for Optical Smart Dust Networks,. We provide experimental evidence of the basic parameters and of the performance of the distributed protocols described and analyzed under assymptotic assumptions in [.] for relatively small random networks (1000 to 15000 sensors).作者: stress-response 時間: 2025-3-27 04:24
A New Class of Greedy Heuristics for Job Shop Scheduling Problems,p, i.e. with unlimited capacity buffer, and job shop problems with blocking and no-wait. The proposed algorithm family is a simple randomized greedy family based on a general formulation of the job shop problem. We report on an extensive study of the proposed algorithms, and comparisons with other greedy algorithms are presented.作者: 性上癮 時間: 2025-3-27 06:42
Conference proceedings 2003na, Switzerland in May 2003...The 19 revised full papers presented together with 3 invited contributions were carefully reviewed and selected from 40 submissions. The focus of the volume is on applications of efficient algorithms for combinatorial problems..作者: 客觀 時間: 2025-3-27 11:02 作者: Palter 時間: 2025-3-27 15:21 作者: Hemoptysis 時間: 2025-3-27 21:15
Juhee Haam,Zhiying Jiang,Jeffrey G. Taskertio but in practice produces reasonably good results. We compare the quality of the algorithms on a test set of weighted graphs and study the improvement achieved by our local improvement operations. We also do a comparison of the runtimes of all algorithms.作者: 執(zhí)拗 時間: 2025-3-27 22:07 作者: AFFIX 時間: 2025-3-28 03:26 作者: Inferior 時間: 2025-3-28 07:00
Linear Time Local Improvements for Weighted Matchings in Graphs,tio but in practice produces reasonably good results. We compare the quality of the algorithms on a test set of weighted graphs and study the improvement achieved by our local improvement operations. We also do a comparison of the runtimes of all algorithms.作者: 外面 時間: 2025-3-28 10:40 作者: 聯想記憶 時間: 2025-3-28 15:59
Algorithms and Experiments on Colouring Squares of Planar Graphs, .. We have also implemented and experimentally evaluated the performance of most of the known approximation colouring algorithms for SQPG [., ., ., .]. We compare the quality of the colourings achieved by these algorithms, with the colourings obtained by our algorithms and with the results obtained作者: Nutrient 時間: 2025-3-28 19:12 作者: homocysteine 時間: 2025-3-28 23:03 作者: 安慰 時間: 2025-3-29 03:53 作者: 蠟燭 時間: 2025-3-29 08:03
Search Data Structures for Skewed Strings,ed (random) strings. For instance, this is the case of URL addresses, IP addresses, or XML path strings, all representing paths in some hierarchical order. As strings sharing a portion of the path have a quite long common prefix, we need to avoid the time-consuming repeated examination of these comm作者: badinage 時間: 2025-3-29 11:55
Evaluation of Basic Protocols for Optical Smart Dust Networks,. We provide experimental evidence of the basic parameters and of the performance of the distributed protocols described and analyzed under assymptotic assumptions in [.] for relatively small random networks (1000 to 15000 sensors).作者: 慢跑 時間: 2025-3-29 16:45 作者: narcotic 時間: 2025-3-29 23:46 作者: intimate 時間: 2025-3-30 01:15 作者: ABASH 時間: 2025-3-30 07:51
Comparing Push- and Pull-Based Broadcasting, algorithms. It comprises many helpful data-structures, a graphical interface with several components and a library with implementations of selected scheduling algorithms. Every scheduling problem covered by the classification-scheme originally proposed by Graham et al. [.] can easily be integrated 作者: 諷刺滑稽戲劇 時間: 2025-3-30 08:25
Experimental Comparison of Heuristic and Approximation Algorithms for Uncapacitated Facility Locatieterministic and heuristic approximation algorithms have evolved. In this paper, we consider five of these approaches — the JMS- and the MYZ-approximation algorithms, a version of Local Search, a Tabu Search algorithm as well as a version of the Volume algorithm with randomized rounding. We compare 作者: dialect 時間: 2025-3-30 15:46
,A Lazy Version of Eppstein’s , Shortest Paths Algorithm, . nodes and . arcs. To solve this problem, Eppstein’s algorithm first computes the shortest path tree and then builds a graph .(.) representing all possible deviations from the shortest path. Building .(.) takes .(.+. log .) time in the basic version of the algorithm. Once it has been built, the . 作者: CANON 時間: 2025-3-30 17:24
A Clustering Algorithm for Interval Graph Test on Noisy Data,search, that is, to reassemble the clones to determine the relative position of fragments of DNA along the genome. The linear time algorithm by Booth and Lueker (1976) for this problem has a serious drawback: the data must be error-free. However, laboratory work is never flawless. We devised a new i作者: Goblet-Cells 時間: 2025-3-30 22:52 作者: mydriatic 時間: 2025-3-31 01:30
The Reliable Algorithmic Software Challenge RASC,eloped part of theoretical computer science [.]..In comparison, algorithmic software is in its infancy. For many fundamental algorithmic tasks no reliable implementations are available due to a lack of understanding of the principles underlying reliable algorithmic software, some examples are given 作者: figure 時間: 2025-3-31 05:42
A New Class of Greedy Heuristics for Job Shop Scheduling Problems,p, i.e. with unlimited capacity buffer, and job shop problems with blocking and no-wait. The proposed algorithm family is a simple randomized greedy family based on a general formulation of the job shop problem. We report on an extensive study of the proposed algorithms, and comparisons with other g作者: cartilage 時間: 2025-3-31 11:44
A Clustering Algorithm for Interval Graph Test on Noisy Data,and Lueker (1976) for this problem has a serious drawback: the data must be error-free. However, laboratory work is never flawless. We devised a new iterative clustering algorithm for this problem, which can accommodate noisy data and produce a likely interval model realizing the original graph.作者: LIMN 時間: 2025-3-31 13:21 作者: 原來 時間: 2025-3-31 17:33 作者: Sputum 時間: 2025-4-1 01:19 作者: Antigen 時間: 2025-4-1 04:38
