標(biāo)題: Titlebook: Experimental and Efficient Algorithms; Third International Celso C. Ribeiro,Simone L. Martins Conference proceedings 2004 Springer-Verlag [打印本頁] 作者: Malicious 時間: 2025-3-21 18:10
書目名稱Experimental and Efficient Algorithms影響因子(影響力)
書目名稱Experimental and Efficient Algorithms影響因子(影響力)學(xué)科排名
書目名稱Experimental and Efficient Algorithms網(wǎng)絡(luò)公開度
書目名稱Experimental and Efficient Algorithms網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Experimental and Efficient Algorithms被引頻次
書目名稱Experimental and Efficient Algorithms被引頻次學(xué)科排名
書目名稱Experimental and Efficient Algorithms年度引用
書目名稱Experimental and Efficient Algorithms年度引用學(xué)科排名
書目名稱Experimental and Efficient Algorithms讀者反饋
書目名稱Experimental and Efficient Algorithms讀者反饋學(xué)科排名
作者: 美食家 時間: 2025-3-21 20:41 作者: Itinerant 時間: 2025-3-22 02:19 作者: Ingenuity 時間: 2025-3-22 05:36 作者: 精美食品 時間: 2025-3-22 09:14
Cooperation between Branch and Bound and Evolutionary Approaches to Solve a Bi-objective Flow Shop e instances, so we propose an original cooperation between this exact method and a Genetic Algorithm to obtain good results on large instances. Results obtained are promising and show that cooperation between antagonist optimization methods could be very efficient.作者: 鄙視 時間: 2025-3-22 16:16 作者: 鄙視 時間: 2025-3-22 17:08 作者: Fibrillation 時間: 2025-3-22 22:58
Implementing Approximation Algorithms for the Single-Source Unsplittable Flow Problem, of Skutella [19] for congestion and cost, which is the best known bicriteria approximation. We study experimentally the quality of approximation achieved by the algorithms and the effect of heuristics on their performance. We also compare these algorithms against the previous best ones by Kolliopoulos and Stein [15].作者: Employee 時間: 2025-3-23 01:33
Efficient Edge-Swapping Heuristics for Finding Minimum Fundamental Cycle Bases,operties that make the heuristics efficient are established. We also present a mixed integer programming formulation of the problem whose linear relaxation yields tighter lower bounds than known formulations. Computational results obtained with our algorithms are compared with those from existing constructive heuristics on several types of graphs.作者: Frenetic 時間: 2025-3-23 09:36
Solving Chance-Constrained Programs Combining Tabu Search and Simulation,obust solutions. However, the efficiency of algorithms based on Local Search, such as Tabu Search, suffers from the complexity of evaluating the objective function after each move..In this paper, we propose alternative methods of dealing with uncertainties which are suitable to be implemented within a Tabu Search framework.作者: MIRE 時間: 2025-3-23 09:45 作者: Bravura 時間: 2025-3-23 15:00
Kirsten Hattermann,Rolf Mentleinoperties that make the heuristics efficient are established. We also present a mixed integer programming formulation of the problem whose linear relaxation yields tighter lower bounds than known formulations. Computational results obtained with our algorithms are compared with those from existing constructive heuristics on several types of graphs.作者: Narcissist 時間: 2025-3-23 22:00
Raymond Y. Huang,Patrick Y. Wenobust solutions. However, the efficiency of algorithms based on Local Search, such as Tabu Search, suffers from the complexity of evaluating the objective function after each move..In this paper, we propose alternative methods of dealing with uncertainties which are suitable to be implemented within a Tabu Search framework.作者: Vo2-Max 時間: 2025-3-24 01:40 作者: 凝乳 時間: 2025-3-24 06:02
Recent Results in Cancer Researchan have a huge negative impact on the clustering quality. In this paper, we apply a clustering method that does not require a priori knowledge. We demonstrate the effectiveness and efficiency of the method on real and synthetic data sets emulating solutions in Multimodal Optimisation problems.作者: helper-T-cells 時間: 2025-3-24 08:29 作者: Texture 時間: 2025-3-24 14:05 作者: flex336 時間: 2025-3-24 17:04
https://doi.org/10.1007/978-3-031-35295-9ruction algorithm is proposed to build feasible solutions to the problem. Two neighborhood structures and a local search procedure for solution improvement are also proposed. Computational results are presented and discussed, illustrating the effectiveness of the combined approach involving randomized construction and local search.作者: daredevil 時間: 2025-3-24 20:40 作者: 聯(lián)想記憶 時間: 2025-3-25 02:33
An Algorithm to Identify Clusters of Solutions in Multimodal Optimisation,an have a huge negative impact on the clustering quality. In this paper, we apply a clustering method that does not require a priori knowledge. We demonstrate the effectiveness and efficiency of the method on real and synthetic data sets emulating solutions in Multimodal Optimisation problems.作者: AVID 時間: 2025-3-25 05:18 作者: insidious 時間: 2025-3-25 08:40
,Simple Max-Cut for Split-Indifference Graphs and Graphs with Few ,,’s,w that the . problem can be solved in linear time for a graph that is both split and indifference. Moreover, we also show that for each constant ., the . problem can be solved in polynomial time for (.,.-4)-graphs. These are graphs for which no set of at most . vertices induces more than .-4 distinct . .’s.作者: BRINK 時間: 2025-3-25 15:35 作者: Debark 時間: 2025-3-25 17:23 作者: PON 時間: 2025-3-25 22:40
Organizing for the 21st century,ances with the new algorithm and two others LP-based approximation algorithms. For these instances our algorithm present a considerable gain of computational time and the error ratio, when possible to compare, was less than 2% from the optimum.作者: amnesia 時間: 2025-3-26 01:14 作者: Alveoli 時間: 2025-3-26 07:52 作者: 創(chuàng)造性 時間: 2025-3-26 11:15
Efficient Implementation of the BSP/CGM Parallel Vertex Cover FPT Algorithm,eriments. For two of these graphs, the times we obtained were approximately 115 times better, for one of them 16 times better, and, for the remaining graphs, the obtained times were slightly better. We must also emphasize that we used a computational environment that is inferior than that used in th作者: interior 時間: 2025-3-26 15:46
Edoardo Chiti,Bernardo Giorgio Mattarellaoptimization heuristic that uses many particles that independently search the space of all possible solutions. By gathering statistics, we compare the combinatorial characteristics of the different neighborhoods and we show that there are certain features that make a neighborhood better than another作者: 反叛者 時間: 2025-3-26 18:53 作者: 愚笨 時間: 2025-3-27 00:37 作者: Encephalitis 時間: 2025-3-27 03:39 作者: otic-capsule 時間: 2025-3-27 08:16
The World Adapting to Climate Change,terplay between theory and practice in engineering a simple variant of Dijkstra’s shortest path algorithm. In this context, we show that studying heuristics that are efficient in practice can yield interesting clues to the combinatorial properties of the problem, and eventually lead to new theoretically efficient algorithms.作者: epicardium 時間: 2025-3-27 11:49 作者: Myocyte 時間: 2025-3-27 13:55
A Hybrid Bin-Packing Heuristic to Multiprocessor Scheduling,nimize their makespan, i.e., the maximum processing time over all processors. We propose a new heuristic for solving the multiprocessor scheduling problem, based on a hybrid heuristic to the bin packing problem. Computational results illustrating the effectiveness of this approach are reported and compared with those obtained by other heuristics.作者: 公式 時間: 2025-3-27 18:39
Lempel, Even, and Cederbaum Planarity Method, linear-time implementation of LEC method using the PC-tree data structure of Shih and Hsu is provided and described in details. We report on an experimental study involving this implementation and other available linear-time implementations of planarity algorithms.作者: AMEND 時間: 2025-3-27 23:24 作者: MIR 時間: 2025-3-28 05:02 作者: 人工制品 時間: 2025-3-28 08:48
https://doi.org/10.1007/b97914Alphabet; Navigation; STATISTICA; algorithmic mathematics; algorithmics; algorithms; coding algorithms; com作者: 閑逛 時間: 2025-3-28 13:54
Celso C. Ribeiro,Simone L. MartinsIncludes supplementary material: 作者: agglomerate 時間: 2025-3-28 15:50 作者: 抗體 時間: 2025-3-28 19:23 作者: 共同給與 時間: 2025-3-29 00:44
Experimental and Efficient Algorithms978-3-540-24838-5Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: GROSS 時間: 2025-3-29 04:35
0302-9743 Overview: Includes supplementary material: 978-3-540-22067-1978-3-540-24838-5Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 踉蹌 時間: 2025-3-29 10:38
Tomotoshi Marumoto,Hideyuki Sayanimize their makespan, i.e., the maximum processing time over all processors. We propose a new heuristic for solving the multiprocessor scheduling problem, based on a hybrid heuristic to the bin packing problem. Computational results illustrating the effectiveness of this approach are reported and c作者: BIDE 時間: 2025-3-29 12:20
Kirsten Hattermann,Rolf Mentleinees, we propose new heuristics (local search and metaheuristics) in which edge swaps are iteratively applied to a current spanning tree. Structural properties that make the heuristics efficient are established. We also present a mixed integer programming formulation of the problem whose linear relax作者: ADAGE 時間: 2025-3-29 15:41
Raymond Y. Huang,Patrick Y. Wen.Several approaches for solving stochastic problems are reported in the literature. Metaheuristics seem to be a powerful tool for computing good and robust solutions. However, the efficiency of algorithms based on Local Search, such as Tabu Search, suffers from the complexity of evaluating the objec作者: semble 時間: 2025-3-29 21:54
Recent Results in Cancer Researchhis application. The vast majority of clustering methods in literature operate by resorting to a priori assumptions about the data, such as the number of cluster or cluster radius. Clusters are forced to conform to these assumptions, which may not be valid for the considered population. The latter c作者: Fibrinogen 時間: 2025-3-30 01:06 作者: Discrete 時間: 2025-3-30 05:53
Astrid Weyerbrock,Josef Zentnerre efficient on several types of problems or instances. We can distinguish exact methods dedicated to solve small instances, from heuristics – and particularly metaheuristics – that approximate best solutions on large instances. In this article, we firstly present an efficient exact method, called t作者: 案發(fā)地點 時間: 2025-3-30 09:03 作者: 晚間 時間: 2025-3-30 14:32 作者: BIBLE 時間: 2025-3-30 20:03 作者: 聽寫 時間: 2025-3-30 22:18 作者: capsaicin 時間: 2025-3-31 03:26
Organizing for the 21st century,occur in many applications which consider the assignment of objects into labels, in a way that is consistent with some observed data that includes the relationship between the objects..The known approximation algorithms are based on solutions of large linear programs and are impractical for moderate作者: Antimicrobial 時間: 2025-3-31 06:13
Matthew Breay Bolton,Elizabeth Minorventually the robots form a circle. In the model we study, the robots are anonymous and oblivious, in the sense that they cannot be distinguished by their appearance and do not have a common x-y coordinate system, while they are unable to remember past actions..We propose a new distributed algorithm作者: 歡樂東方 時間: 2025-3-31 11:52
https://doi.org/10.1057/9781137341402 the . (GCV) that uses the recurrence formula proposed by Beasley and the discretization points defined by Herz. We show that if the items are not so small compared to the dimension of the bin, this algorithm requires polynomial time. Using this algorithm we solved all instances of GCV found at the 作者: Folklore 時間: 2025-3-31 13:33
The World Adapting to Climate Change,terplay between theory and practice in engineering a simple variant of Dijkstra’s shortest path algorithm. In this context, we show that studying heuristics that are efficient in practice can yield interesting clues to the combinatorial properties of the problem, and eventually lead to new theoretic作者: ciliary-body 時間: 2025-3-31 19:05
Edoardo Chiti,Bernardo Giorgio Mattarellaed, and if not, what changes are to be made to the way new solutions are examined so that the algorithm performs nicely. In this work we develop a methodology for differentiating good neighborhoods from bad ones. As a case study we consider the structure of the space of assignments for random 3-SAT 作者: 粗野 時間: 2025-4-1 01:39
Airborne Radio CNS Systems and Networks,mand of each commodity must be routed along a single path so that the total flow through any edge is at most its capacity. This problem was introduced by Kleinberg [12] and generalizes several NP-complete problems. A cost value per unit of flow may also be defined for every edge. In this paper, we i作者: 易受騙 時間: 2025-4-1 01:50 作者: GEON 時間: 2025-4-1 09:24
