作者: flourish 時(shí)間: 2025-3-21 21:23 作者: 雕鏤 時(shí)間: 2025-3-22 01:35
Pierrick Legrand,Marc-Michel Corsini,Marc SchoenauIncludes supplementary material: 作者: harbinger 時(shí)間: 2025-3-22 07:51 作者: endure 時(shí)間: 2025-3-22 10:07
Linear Convergence of Evolution Strategies with Derandomized Sampling Beyond Quasi-Convex Functionson on the sampling performed by the evolutionary algorithm (supposed to cover efficiently the neighborhood of the current search point), the conditioning of the objective function (so that the probability of improvement is not too low at each time step, given a correct step size), and the unicity of the optimum.作者: 亞當(dāng)心理陰影 時(shí)間: 2025-3-22 13:02 作者: 頑固 時(shí)間: 2025-3-22 19:17 作者: 繁榮中國(guó) 時(shí)間: 2025-3-22 23:30 作者: A保存的 時(shí)間: 2025-3-23 01:59 作者: Confidential 時(shí)間: 2025-3-23 08:01 作者: Constituent 時(shí)間: 2025-3-23 12:22
Bingyan J. Wang,Hina W. Chaudhrye optimality of the solution. Interval-based techniques, on the other hand, yield a numerical proof of optimality of the solution. However, they may fail to converge within a reasonable time due to their exponential complexity and their inability to quickly compute a good approximation of the global作者: shrill 時(shí)間: 2025-3-23 17:21
Seun Imani,Roslyn Wallace,Yassine Sassintations, namely, swap and insertion, are incorporated into the network landscape model. The performance of a heuristic search algorithm on this problem is also analyzed. In particular, we study the correlation between local optima network features and the performance of an iterated local search heu作者: 廚房里面 時(shí)間: 2025-3-23 18:38
Anichavezhi Devendran,Clifford Liuon on the sampling performed by the evolutionary algorithm (supposed to cover efficiently the neighborhood of the current search point), the conditioning of the objective function (so that the probability of improvement is not too low at each time step, given a correct step size), and the unicity of作者: 蛛絲 時(shí)間: 2025-3-24 01:38 作者: Confound 時(shí)間: 2025-3-24 02:40
Silvia Mazzotta,Adam T. Lynch,Stefan Hoppler Given two input sequences . and . over a finite alphabet ., this problem concerns to find a longest common subsequence of . and . in which no letter is repeated. Beam-ACO algorithms are combinations between the metaheuristic ant colony optimization and a deterministic tree search technique called b作者: 厚臉皮 時(shí)間: 2025-3-24 07:42 作者: biopsy 時(shí)間: 2025-3-24 14:03
Jelena Pla?ki?,Jens Kocksk?mpermmonly, a Single Nucleotide Polymorphism (SNP) is considered as it is the most common form of genetic variations. In the literature, several statistical and data mining methods have been applied to GWA data analysis. In this article, we present a preliminary study where we examine the possibilities 作者: 無(wú)價(jià)值 時(shí)間: 2025-3-24 18:31 作者: 分離 時(shí)間: 2025-3-24 20:01 作者: semble 時(shí)間: 2025-3-25 00:35 作者: 蜿蜒而流 時(shí)間: 2025-3-25 05:43
Chronic Infections of C-Type RNA Virusesmplementary neighborhoods designed respectively for intensification and diversification. To escape deep local optima, TSX_WDP employs a backbone-based recombination operator to generate new starting points for tabu search and to displace the search into unexplored promising regions. The recombinatio作者: Jingoism 時(shí)間: 2025-3-25 10:17 作者: Simulate 時(shí)間: 2025-3-25 13:25
0302-9743 cused to theory, ant colony optimization, applications, combinatorial and discrete optimization, memetic algorithms, genetic programming, interactive evolution, parallel evolutionary algorithms, and swarm intelligence.978-3-319-11682-2978-3-319-11683-9Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: Observe 時(shí)間: 2025-3-25 16:59
Silvia Mazzotta,Adam T. Lynch,Stefan Hoppleream search. The algorithm that we present is an adaptation of a previously published Beam-ACO algorithm for the classical longest common subsequence problem. The results of the proposed algorithm outperform existing heuristics from the literature.作者: 反復(fù)拉緊 時(shí)間: 2025-3-25 23:40
Jelena Pla?ki?,Jens Kocksk?mperof applying biclustering approaches to detect association between SNP markers and phenotype traits. Therefore, we propose a multiobjective model for biclustering problems in GWA context. Furthermore, we propose an adapted heuristic and metaheuristic to solve it. The performance of our algorithms are assessed using synthetic data sets.作者: 建筑師 時(shí)間: 2025-3-26 02:45
Przemek A. Gorski,Changwon Kho,Jae Gyun Ohe function. Experiments were conducted on real and artificial data in order to assess the approach efficiency for different set of parameters. The results showed that it is likely that the method performs better when the loss is important. The approach produces satisfying results on both real and artificial data for the set of tested parameters.作者: connoisseur 時(shí)間: 2025-3-26 07:17 作者: 恃強(qiáng)凌弱 時(shí)間: 2025-3-26 10:25 作者: 鞏固 時(shí)間: 2025-3-26 14:20 作者: 枕墊 時(shí)間: 2025-3-26 19:34 作者: Pcos971 時(shí)間: 2025-3-27 00:12
Chronic Infections of C-Type RNA Virusesthm proposed in this paper generalizes the Louvain algorithm by including a uncoarsening phase, leading to a full multi-level method. Experiments on a set of popular complex networks show the benefits induced by the proposed Louvain+ algorithm.作者: initiate 時(shí)間: 2025-3-27 03:32
Local Optima Networks of the Permutation Flow-Shop Problemem is also analyzed. In particular, we study the correlation between local optima network features and the performance of an iterated local search heuristic. Our analysis reveals that network features can explain and predict problem difficulty. The evidence confirms the superiority of the insertion operator for this problem.作者: esculent 時(shí)間: 2025-3-27 08:40
Effective Multi-caste Ant Colony System for Large Dynamic Traveling Salesperson Problemstained with large and highly dynamic traveling salesperson instances confirm the effectiveness and robustness of the approach. A detailed analysis reveals that one of the castes should adopt a clearly exploratory behavior, as this minimizes the recovery time after an environmental change.作者: 織物 時(shí)間: 2025-3-27 13:19
Improving the Louvain Algorithm for Community Detection with Modularity Maximizationthm proposed in this paper generalizes the Louvain algorithm by including a uncoarsening phase, leading to a full multi-level method. Experiments on a set of popular complex networks show the benefits induced by the proposed Louvain+ algorithm.作者: maverick 時(shí)間: 2025-3-27 14:02 作者: Acquired 時(shí)間: 2025-3-27 20:33
Jelena Pla?ki?,Jens Kocksk?mper). The results on two sets of instances show that this approach finds very good results in relatively short computing time compared with a multistart iterated local search which works directly on the mt-CCVRP solution space.作者: 不在灌木叢中 時(shí)間: 2025-3-27 22:20 作者: 急急忙忙 時(shí)間: 2025-3-28 02:35 作者: Diuretic 時(shí)間: 2025-3-28 10:05
Multistart Evolutionary Local Search for a Disaster Relief Problem). The results on two sets of instances show that this approach finds very good results in relatively short computing time compared with a multistart iterated local search which works directly on the mt-CCVRP solution space.作者: 極小 時(shí)間: 2025-3-28 10:35 作者: PATRI 時(shí)間: 2025-3-28 15:36 作者: Optic-Disk 時(shí)間: 2025-3-28 20:13
Preliminary Studies on Biclustering of GWA: A Multiobjective Approachof applying biclustering approaches to detect association between SNP markers and phenotype traits. Therefore, we propose a multiobjective model for biclustering problems in GWA context. Furthermore, we propose an adapted heuristic and metaheuristic to solve it. The performance of our algorithms are assessed using synthetic data sets.作者: Nuance 時(shí)間: 2025-3-29 02:19
An Evolutionary Approach to Contrast Compensation for Dichromat Userse function. Experiments were conducted on real and artificial data in order to assess the approach efficiency for different set of parameters. The results showed that it is likely that the method performs better when the loss is important. The approach produces satisfying results on both real and artificial data for the set of tested parameters.作者: Inexorable 時(shí)間: 2025-3-29 04:25
A Recombination-Based Tabu Search Algorithm for the Winner Determination Problemn operator operates on elite solutions previously found which are recorded in an global archive. The performance of our algorithm is assessed on a set of 500 well-known WDP benchmark instances. Comparisons with five state of the art algorithms demonstrate the effectiveness of our approach.作者: 招待 時(shí)間: 2025-3-29 10:13
Conference proceedings 2014ober 2013. The 20 revised paperswere carefully reviewed and selected from 39 submissions. The papers are focused to theory, ant colony optimization, applications, combinatorial and discrete optimization, memetic algorithms, genetic programming, interactive evolution, parallel evolutionary algorithms作者: Allergic 時(shí)間: 2025-3-29 12:20
Bingyan J. Wang,Hina W. Chaudhrywith both deterministic and stochastic existing approaches. We demonstrate its efficiency on a benchmark of highly multimodal problems, for which we provide previously unknown global minima and certification of optimality.作者: FLASK 時(shí)間: 2025-3-29 18:07 作者: dominant 時(shí)間: 2025-3-29 21:38
Log-log Convergence for Noisy Optimization .-. convergence for evolution strategies (which were not covered by existing results) in the case of objective functions with quadratic expectations and constant noise, (ii) .-. rates also for objective functions with expectation ., where . represents the optimum (iii) experiments with different pa作者: 編輯才信任 時(shí)間: 2025-3-30 00:40
Medium-Voltage Distribution Network Expansion Planning with Gene-pool Optimal Mixing Evolutionary Althat the favorable performance of GOMEA instances over traditional GAs extends to the real-world problem at hand. Moreover, the use of linkage learning is shown to further increase the algorithm’s effectiveness in converging toward optimal solutions.作者: COLON 時(shí)間: 2025-3-30 04:32
Rengarajan Sriram,Gopalan Jagadeesh .-. convergence for evolution strategies (which were not covered by existing results) in the case of objective functions with quadratic expectations and constant noise, (ii) .-. rates also for objective functions with expectation ., where . represents the optimum (iii) experiments with different pa作者: 誤傳 時(shí)間: 2025-3-30 10:22
Jelena Pla?ki?,Jens Kocksk?mperthat the favorable performance of GOMEA instances over traditional GAs extends to the real-world problem at hand. Moreover, the use of linkage learning is shown to further increase the algorithm’s effectiveness in converging toward optimal solutions.作者: 深淵 時(shí)間: 2025-3-30 12:32 作者: 空氣傳播 時(shí)間: 2025-3-30 20:02 作者: 膝蓋 時(shí)間: 2025-3-30 22:52 作者: 串通 時(shí)間: 2025-3-31 02:47
Local Optima Networks of the Permutation Flow-Shop Problemntations, namely, swap and insertion, are incorporated into the network landscape model. The performance of a heuristic search algorithm on this problem is also analyzed. In particular, we study the correlation between local optima network features and the performance of an iterated local search heu
