作者: interrupt 時(shí)間: 2025-3-21 21:42
https://doi.org/10.1007/978-3-319-78133-4artificial intelligence; assignment problems; combinatorial mathematics; combinatorial optimization; evo作者: 夾死提手勢(shì) 時(shí)間: 2025-3-22 04:24 作者: Obstacle 時(shí)間: 2025-3-22 08:35 作者: 障礙 時(shí)間: 2025-3-22 12:42
S. Ruhl,G. C. Begley,M. Bickel,H. Pluzniksolution or it is discarded. One of the most studied local search algorithms is simulated annealing. It often uses the Metropolis condition as acceptance criterion, which always accepts equal or better quality solutions and worse ones with a probability that depends on the amount of worsening and a 作者: 窒息 時(shí)間: 2025-3-22 14:07 作者: Emasculate 時(shí)間: 2025-3-22 18:59
S. Ruhl,G. C. Begley,M. Bickel,H. Pluznikch. We particularly focus on establishing links between the structure of optimization problems and the efficiency of such local search algorithms. In our experiments we compare partial neighborhood local searches to state-of-the-art tabu search and iterated local search and perform a parameter sensi作者: 勤勉 時(shí)間: 2025-3-22 22:58 作者: neuron 時(shí)間: 2025-3-23 02:03 作者: 加強(qiáng)防衛(wèi) 時(shí)間: 2025-3-23 06:39
S. Ruhl,G. C. Begley,M. Bickel,H. PluznikMSA, for ., coded using the EASEA platform. This approach evolves individual sub-alignments called “patches” that are used to create a new kind of Multiple Sequence Alignment where alternative solutions are computed simultaneously using different fitness functions. Solutions are generated by combini作者: 現(xiàn)任者 時(shí)間: 2025-3-23 10:17 作者: commute 時(shí)間: 2025-3-23 16:00
Metabolic Zonation of the Liver of this kind of hybridization to tackle black-box optimization problems. Indeed, without any knowledge about the nature of the problem to optimize, combining the strengths of different algorithms, belonging to different classes of metaheuristics, may increase the probability of success of the optim作者: 談判 時(shí)間: 2025-3-23 21:19 作者: interrupt 時(shí)間: 2025-3-24 00:08
Metabolic Zonation of the Livern ACO focuses on homogeneous ants although animal behaviour research suggests that heterogeneity in behaviour improves the overall efficiency of ant colonies. This paper introduces and analyses the effects of heterogeneity of behavioural traits in ACO to solve hard optimisation problems by introduci作者: Mediocre 時(shí)間: 2025-3-24 04:51 作者: 闡釋 時(shí)間: 2025-3-24 08:20 作者: 低三下四之人 時(shí)間: 2025-3-24 12:14
Giorgio Maria Di Nunzio,Federica Vezzaniuctured, or simply not enough to elucidate complex structures: human choices have thus a major impact at various levels. LIDeOGraM is an interactive modelling framework adapted to cases where numerical data and expert knowledge have to be combined for building an efficient model. Exploiting both sta作者: INERT 時(shí)間: 2025-3-24 17:51 作者: 使絕緣 時(shí)間: 2025-3-24 22:57
Messaoud Chaa,Omar Nouali,Patrice Bellotrticular problem domain. In this work, a simple selection hyper-heuristic is executed on a number of computationally hard benchmark optimisation problems, and the resulting sequences of low level heuristic selections and objective function values are used to construct an offline learning database. A作者: 公豬 時(shí)間: 2025-3-24 23:40
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/b/image/162018.jpg作者: 折磨 時(shí)間: 2025-3-25 07:00 作者: deviate 時(shí)間: 2025-3-25 09:23 作者: graphy 時(shí)間: 2025-3-25 13:43 作者: 頂點(diǎn) 時(shí)間: 2025-3-25 18:58
Conference proceedings 2018 in Paris, France, in October 2017...?The 16 revised papers were carefully reviewed and selected from 33?submissions. The papers cover a wide range of topics in the field of artificial evolution, such as evolutionary computation, evolutionary optimization, co-evolution, artificial life, population d作者: hauteur 時(shí)間: 2025-3-25 21:25
Conference proceedings 2018er biologically-inspired paradigms (swarm, artificial ants, artificial immune systems, cultural algorithms...), memetic algorithms, multi-objective optimisation, constraint handling, parallel algorithms,, dynamic optimization, machine learning and hybridization with?other soft computing techniques..作者: FUSE 時(shí)間: 2025-3-26 03:04 作者: 經(jīng)典 時(shí)間: 2025-3-26 06:39
S. Ruhl,G. C. Begley,M. Bickel,H. Pluzniknd, we also use the Kendall Tau Distance (KTD) approach, which quantifies pairwise dissimilarities among two lists of fitness values. KTD aims to capture the degree of a change in DOPs and we use this to promote structural diversity. Results on eight symbolic regression functions indicate that both approaches are highly beneficial in GP.作者: Opponent 時(shí)間: 2025-3-26 11:23 作者: infelicitous 時(shí)間: 2025-3-26 15:41
Metabolic Zonation of the Liverroblem (TSP) instances particularly for larger instances. The diversity preservation introduced by this algorithm helps balance exploration-exploitation, increases robustness with respect to parameter settings and reduces the number of algorithm parameters that need to be set.作者: 玉米 時(shí)間: 2025-3-26 19:34
Metabolic Zonation of the Liverrithms, i.e., we just try to learn successful strategies for different constants?. and have a look at the outcome. We investigate the variant of protecting a highway with still unknown threshold and found interesting strategic paradigms.作者: 煩人 時(shí)間: 2025-3-26 21:30
Endothelin and Experimental Hypertension,ing operator and the Tone Mapped Image Quality Index as the objective to be maximized in a much lower dimensional solution space. We show that the evolutionary approach results in significantly reduced computational effort.作者: Gerontology 時(shí)間: 2025-3-27 04:37
Giorgio Maria Di Nunzio,Federica Vezzani from food science: the production and stabilisation of lactic acid bacteria, which has several important practical applications, ranging from assessing the efficacy of new industrial methods, to proposing alternative sustainable systems of food production.作者: cravat 時(shí)間: 2025-3-27 08:18
Semantics-Based Crossover for Program Synthesis in Genetic Programming, Similarity-based Crossover in the program synthesis domain and to study the effects of using semantic locality. The results show that semantic crossover produces more semantically different children as well as more children that are better than their parents compared to subtree crossover.作者: TIGER 時(shí)間: 2025-3-27 11:42 作者: COWER 時(shí)間: 2025-3-27 16:19
A New High-Level Relay Hybrid Metaheuristic for Black-Box Optimization Problems,esented, i.e. the Black-Box Optimization Benchmarking (BBOB) 2015 and the Black Box optimization Competition (BBComp). The proposed algorithm obtains promising results on both benchmarks. The ones obtained at BBComp show the relevance of the proposed hybridization.作者: 歡騰 時(shí)間: 2025-3-27 20:17 作者: conformity 時(shí)間: 2025-3-28 00:02 作者: 易改變 時(shí)間: 2025-3-28 05:18
Evolutionary Optimization of Tone Mapped Image Quality Index,ing operator and the Tone Mapped Image Quality Index as the objective to be maximized in a much lower dimensional solution space. We show that the evolutionary approach results in significantly reduced computational effort.作者: 優(yōu)雅 時(shí)間: 2025-3-28 06:43 作者: parasite 時(shí)間: 2025-3-28 10:50
A Fitness Landscape View on the Tuning of an Asynchronous Master-Worker EA for Nuclear Reactor DesiOne main issue is the tuning of the algorithm parameters. A fitness landscape analysis is conducted on this expensive real-world problem to show that it would be possible to tune the mutation parameters according to the low-cost estimation of the fitness landscape features.作者: 贊成你 時(shí)間: 2025-3-28 15:07 作者: 蹣跚 時(shí)間: 2025-3-28 19:15
MEMSA: A Robust , for Multidimensional Multiple Sequence Alignment,ng coherent sets of high-scoring individuals that are used to reconstruct multi-dimensional multiple sequence alignments. The alignments of this prototype version show a quality comparable to ClustalW (one of the most widely used existing methods) on the 218 samples of the BAliBASE benchmark in reasonable time.作者: 潛伏期 時(shí)間: 2025-3-29 02:29 作者: cocoon 時(shí)間: 2025-3-29 06:09
S. Ruhl,G. C. Begley,M. Bickel,H. Pluzniktivity analysis by observing the efficiency of partial neighborhood local searches with different size of neighborhood sample. In order to facilitate the extraction of links between instances structure and search algorithm behavior we restrain the scope to binary fitness landscapes, such as NK landscapes and landscapes derived from UBQP.作者: 迅速飛過(guò) 時(shí)間: 2025-3-29 07:23
S. Ruhl,G. C. Begley,M. Bickel,H. Pluznikng coherent sets of high-scoring individuals that are used to reconstruct multi-dimensional multiple sequence alignments. The alignments of this prototype version show a quality comparable to ClustalW (one of the most widely used existing methods) on the 218 samples of the BAliBASE benchmark in reasonable time.作者: charisma 時(shí)間: 2025-3-29 11:55 作者: seruting 時(shí)間: 2025-3-29 17:52 作者: 巧思 時(shí)間: 2025-3-29 19:44
S. Ruhl,G. C. Begley,M. Bickel,H. Pluznik the quadratic assignment problem and a permutation flowshop problem. Our experimental results show that, while results may differ depending on the specific problem, the Metropolis condition and the late acceptance hill climbing rule are among the choices that obtain the best results.作者: Champion 時(shí)間: 2025-3-30 01:37 作者: Abbreviate 時(shí)間: 2025-3-30 06:25 作者: pulmonary-edema 時(shí)間: 2025-3-30 09:51 作者: 顯微鏡 時(shí)間: 2025-3-30 13:15
On the Design of a Master-Worker Adaptive Algorithm Selection Framework,ently proposed benchmark family for adaptive algorithm selection, reveals the accuracy of the proposed framework while providing new insights on the performance of distributed adaptive optimization algorithms.作者: Awning 時(shí)間: 2025-3-30 19:38
Comparison of Acceptance Criteria in Randomized Local Searches, the quadratic assignment problem and a permutation flowshop problem. Our experimental results show that, while results may differ depending on the specific problem, the Metropolis condition and the late acceptance hill climbing rule are among the choices that obtain the best results.作者: 清晰 時(shí)間: 2025-3-30 23:01
Basic, Dual, Adaptive, and Directed Mutation Operators in the Fly Algorithm,progressively reduced to refine the results. Another approach is the use of adaptive operators. However, very little research on adaptive operators in Fly algorithm has been conducted. We address this deficiency and propose 4 different fully adaptive mutation operators in the Fly algorithm: Basic Mu作者: 非實(shí)體 時(shí)間: 2025-3-31 04:19 作者: bypass 時(shí)間: 2025-3-31 06:52
Offline Learning for Selection Hyper-heuristics with Elman Networks,rning and generalisation with 99% confidence and produces better results than the training sequences in many cases. When the network was trained using an inter-domain training set, the Elman network did not exhibit generalisation indicating that inter-domain generalisation is a harder problem and th作者: Callus 時(shí)間: 2025-3-31 11:14
On the Design of a Master-Worker Adaptive Algorithm Selection Framework,iven portfolio a set of operators to be executed in parallel, and consequently (ii) take full advantage of the compute power offered by the underlying distributed environment. In fact, it is still an open issue to design online distributed strategies that are able to optimally assign operators to pa作者: 伸展 時(shí)間: 2025-3-31 16:05 作者: Abduct 時(shí)間: 2025-3-31 21:05
