作者: candle 時(shí)間: 2025-3-21 20:20
Das Wichtigste zu WORD 5.5 unter MS-DOS 5.0e neighbourhood search (VNS) framework. In particular two components are generated; constructive heuristics to create initial solutions and neighbourhood move operators to change the state of a given solution. The proposed method is tested on standard benchmark instances of two common VRP variants.作者: Alienated 時(shí)間: 2025-3-22 03:52 作者: 易彎曲 時(shí)間: 2025-3-22 05:20 作者: 四海為家的人 時(shí)間: 2025-3-22 12:27 作者: 不出名 時(shí)間: 2025-3-22 14:20 作者: 不出名 時(shí)間: 2025-3-22 19:52
Searching for Novel Classifiersmance from two different perspectives. Experimental results show that NS-based search can be used to derive effective classifiers. In particular, NS is best suited to solve difficult problems, where exploration needs to be encouraged and maintained.作者: Oligarchy 時(shí)間: 2025-3-22 21:55 作者: 挑剔為人 時(shí)間: 2025-3-23 05:10 作者: 蹣跚 時(shí)間: 2025-3-23 08:02
A Grammar-Guided Genetic Programming Algorithm for Multi-Label Classificationmpared to other multi-label classification techniques in different application domains. Computational experiments show that G3P-ML often obtains better results than other algorithms while achieving a lower number of rules than the other methods.作者: 反應(yīng) 時(shí)間: 2025-3-23 13:26
Conference proceedings 2013r papers were carefully reviewed and selected from 47 submissions. The wide range of topics in this volume reflects the current state of research in the field, including different genres of GP (tree-based, linear, grammar-based, Cartesian), theory, novel operators, and applications.作者: peak-flow 時(shí)間: 2025-3-23 16:50
https://doi.org/10.1007/978-3-663-06804-4goal is to find the best order from simple building-blocks programs. If the fitness remains stalled during the run, new building-blocks programs are generated. PGP seems to compare fairly well with canonical GP.作者: Adrenal-Glands 時(shí)間: 2025-3-23 19:46 作者: hypnotic 時(shí)間: 2025-3-24 00:55
Schriftenreihe Besteuerung der Unternehmungrimental results reveal the excellent behaviour of this algorithm, discovering comprehensible subgroups and behaving better than the other algorithms. The conclusions obtained were reinforced through a series of non-parametric tests.作者: constellation 時(shí)間: 2025-3-24 03:30
https://doi.org/10.1007/978-3-658-42521-0eduling rules that can be reused to initialise populations of an evolutionary multi-objective optimisation (EMO) method. The computational results show that 2SLO is more effective than the pure EMO method. Regarding maximising the total revenue, 2SLO is also competitive as compared to other optimisation methods in the literature.作者: 控訴 時(shí)間: 2025-3-24 08:33
Kaufm?nnischer Dienstleistungsverkehr) Exploration of the conformational space through a multi-objective evolutionary algorithm. The performance of the proposed model was evaluated and validated over a set of well known complexes. The method showed a promising performance when predicting ligands with high number of rotatable bonds.作者: 拘留 時(shí)間: 2025-3-24 10:48
PhenoGP: Combining Programs to Avoid Code Disruptiongoal is to find the best order from simple building-blocks programs. If the fitness remains stalled during the run, new building-blocks programs are generated. PGP seems to compare fairly well with canonical GP.作者: 得意人 時(shí)間: 2025-3-24 18:48
On the Evolvability of a Hybrid Ant Colony-Cartesian Genetic Programming Methodologymethod effectively reveals how evolution proceeds under different parameter settings. The proposed hybrid architecture shows high evolvability in a dynamic environment by maintaining a pheromone model that elicits high genotype diversity.作者: 助記 時(shí)間: 2025-3-24 21:44
Discovering Subgroups by Means of Genetic Programmingrimental results reveal the excellent behaviour of this algorithm, discovering comprehensible subgroups and behaving better than the other algorithms. The conclusions obtained were reinforced through a series of non-parametric tests.作者: bronchiole 時(shí)間: 2025-3-25 00:52
Learning Reusable Initial Solutions for Multi-objective Order Acceptance and Scheduling Problems witeduling rules that can be reused to initialise populations of an evolutionary multi-objective optimisation (EMO) method. The computational results show that 2SLO is more effective than the pure EMO method. Regarding maximising the total revenue, 2SLO is also competitive as compared to other optimisation methods in the literature.作者: 圍巾 時(shí)間: 2025-3-25 07:15
A Multi-objective Optimization Energy Approach to Predict the Ligand Conformation in a Docking Proce) Exploration of the conformational space through a multi-objective evolutionary algorithm. The performance of the proposed model was evaluated and validated over a set of well known complexes. The method showed a promising performance when predicting ligands with high number of rotatable bonds.作者: paragon 時(shí)間: 2025-3-25 11:23
0302-9743 Programming, EuroGP 2013, held in Vienna, Austria, in April 2013 co-located with the Evo* 2013 events, EvoMUSART, EvoCOP, EvoBIO, and EvoApplications. .The 18 revised full papers presented together with 5 poster papers were carefully reviewed and selected from 47 submissions. The wide range of topi作者: CODE 時(shí)間: 2025-3-25 14:13
Statische und kinetische Kostenfunktion, using a genome, supplied by a genetic algorithm, in place of the output of its random number generator. The method is demonstrated with generative heuristics in the domains of 3D design and communications network design. It is also used in novel approaches to genetic programming.作者: 熱心 時(shí)間: 2025-3-25 18:27 作者: Cholecystokinin 時(shí)間: 2025-3-25 23:30 作者: 整體 時(shí)間: 2025-3-26 00:42
https://doi.org/10.1007/978-3-322-83674-8oduction of smaller programs in the presence of equal fitness. This paper introduces a modified SS+E approach in which replacement is done under a lexicographic parsimony scheme. The proposed model, . (SS+LPE), exhibits an improvement in bloat reduction and, in some cases, more effectively searches for fitter solutions.作者: 沉默 時(shí)間: 2025-3-26 07:04
https://doi.org/10.1007/978-3-662-29188-7 the median number of evaluations to solve four benchmark problems, as well as reducing CGP’s sensitivity to the mutation rate. The similarity of results across the problem set in combination with the theoretical conclusions supports the general need for avoiding these unnecessary evaluations.作者: induct 時(shí)間: 2025-3-26 12:15 作者: frugal 時(shí)間: 2025-3-26 14:59 作者: 劇本 時(shí)間: 2025-3-26 19:57 作者: 慢慢啃 時(shí)間: 2025-3-27 00:03
Automated Problem Decomposition for the Boolean Domain with Genetic Programmingginal problem. In this paper we propose a problem decomposition strategy that allows the use of a GP search to find solutions for subproblems and combine the individual solutions into the complete solution to the problem.作者: 冬眠 時(shí)間: 2025-3-27 03:42
0302-9743 cs in this volume reflects the current state of research in the field, including different genres of GP (tree-based, linear, grammar-based, Cartesian), theory, novel operators, and applications.978-3-642-37206-3978-3-642-37207-0Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: Bridle 時(shí)間: 2025-3-27 07:35
https://doi.org/10.1007/978-3-642-37207-0evolutionary algorithms; machine learning; multi-objective optimization; scheduling problems; semantic g作者: 血統(tǒng) 時(shí)間: 2025-3-27 11:33 作者: MINT 時(shí)間: 2025-3-27 15:06 作者: Blemish 時(shí)間: 2025-3-27 20:40 作者: Carbon-Monoxide 時(shí)間: 2025-3-27 23:04 作者: Juvenile 時(shí)間: 2025-3-28 02:41 作者: obnoxious 時(shí)間: 2025-3-28 08:53 作者: 陳列 時(shí)間: 2025-3-28 13:02 作者: BUDGE 時(shí)間: 2025-3-28 16:26
Das Wildschongesetz vom 14. Juli 1904an, Cauchy, and the Lévy distributions. We automatically design mutation operators (probability distributions) using Genetic Programming. This is done by using a standard Gaussian random number generator as the terminal set and and basic arithmetic operators as the function set. In other words, an a作者: 圖表證明 時(shí)間: 2025-3-28 20:45 作者: 媽媽不開(kāi)心 時(shí)間: 2025-3-28 23:48
,Geldzusammenh?nge und Mittelaufbringung,blem solutions are encoded using a CGP representation. Ants generate problem solutions guided by pheromone traces of entities and nodes of the CGP representation. The pheromone values are updated based on the paths followed by the best ants, as suggested in the Rank-Based Ant System (..). To assess 作者: 大氣層 時(shí)間: 2025-3-29 05:57 作者: overrule 時(shí)間: 2025-3-29 10:35
Statische und kinetische Kostenfunktion,ed here, allows such a heuristic to be placed under evolutionary control, allowing search for the optimum. Essentially, the heuristic is “fooled” into using a genome, supplied by a genetic algorithm, in place of the output of its random number generator. The method is demonstrated with generative he作者: 填滿 時(shí)間: 2025-3-29 15:23
https://doi.org/10.1007/978-3-531-91648-4orithms (EAs) rely on a clear and quantitative objective. The Novelty Search algorithm (NS) substitutes fitness-based selection with a . criteria; i.e., individuals are chosen based on their uniqueness. To do so, individuals are described by the behaviors they exhibit, instead of their phenotype or 作者: Dislocation 時(shí)間: 2025-3-29 16:41 作者: Solace 時(shí)間: 2025-3-29 23:20
Wirtschafts-, Geld- und W?hrungspolitiksing the original problem into several smaller subproblems. The main motivation is to allow GP to deal with more complex problems. Most previous works on modularity in GP emphasise the structure of modules used to encapsulate code and/or promote code reuse, instead of in the decomposition of the ori作者: Peristalsis 時(shí)間: 2025-3-30 02:25
Kaufm?nnischer Dienstleistungsverkehrnd complexes by considering energy contributions of molecular interactions. The proposed approach is an improvement over others in the field, where the principle insight is that a Pareto front helps to understand the tradeoffs in the actual problem. The method is based on three main features: (.) Re作者: 駕駛 時(shí)間: 2025-3-30 04:23
Die Auslandsgesch?fte der Kreditinstitutected GP problems and the Game of Tag, a historical pursuit and evasion task. The effects of semantic bias on the occurence of pathologies and consequences for performance are examined in a coevolutionary context. We present findings correlating disengagement with semantic locality of the genotype to作者: misanthrope 時(shí)間: 2025-3-30 10:31 作者: arboretum 時(shí)間: 2025-3-30 14:33
Gerhard Lippe,J?rn Esemann,Thomas T?nzermming algorithm for solving multi-label classification problems using IF-THEN classification rules. This algorithm, called G3P-ML, is evaluated and compared to other multi-label classification techniques in different application domains. Computational experiments show that G3P-ML often obtains bette作者: choleretic 時(shí)間: 2025-3-30 17:41
978-3-642-37206-3Springer-Verlag Berlin Heidelberg 2013作者: 緯度 時(shí)間: 2025-3-30 23:24 作者: Budget 時(shí)間: 2025-3-31 01:57 作者: Synchronism 時(shí)間: 2025-3-31 05:49
Adaptive Distance Metrics for Nearest Neighbour Classification Based on Genetic Programminge neighbourhood along the directions for which the class conditional probabilities don’t change much. Initial empirical results on a set of real-world classification datasets showed that the proposed method enhances the generalisation performance of standard NN algorithm, and that it is a competent 作者: 專橫 時(shí)間: 2025-3-31 11:43 作者: Type-1-Diabetes 時(shí)間: 2025-3-31 14:08
Automated Design of Probability Distributions as Mutation Operators for Evolutionary Programming Usiy distribution over a set of functions). The mutation probability distribution is trained on a set of function instances drawn from a given function class. It is then tested on a separate independent test set of function instances to confirm that the evolved probability distribution has indeed gener作者: Diluge 時(shí)間: 2025-3-31 19:04
Robustness and Evolvability of Recombination in Linear Genetic Programmingerties. Utilizing a population evolution experiment, we demonstrate that recombination significantly accelerates the evolutionary search process and particularly promotes robust phenotypes that innovative phenotypic explorations.作者: 凝視 時(shí)間: 2025-3-31 22:47
A New Implementation of Geometric Semantic GP and Its Application to Problems in Pharmacokineticslications, like the two problems in pharmacokinetics that we address here. Our results confirm the excellent evolvability of geometric semantic operators, demonstrated by the good results obtained on training data. Furthermore, we have also achieved a surprisingly good generalization ability, a fact
