標(biāo)題: Titlebook: Genetic Programming; 13th European Confer Anna Isabel Esparcia-Alcázar,Anikó Ekárt,A. ?ima U Conference proceedings 2010 Springer-Verlag Be [打印本頁] 作者: 信賴 時間: 2025-3-21 17:25
書目名稱Genetic Programming影響因子(影響力)
書目名稱Genetic Programming影響因子(影響力)學(xué)科排名
書目名稱Genetic Programming網(wǎng)絡(luò)公開度
書目名稱Genetic Programming網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Genetic Programming被引頻次
書目名稱Genetic Programming被引頻次學(xué)科排名
書目名稱Genetic Programming年度引用
書目名稱Genetic Programming年度引用學(xué)科排名
書目名稱Genetic Programming讀者反饋
書目名稱Genetic Programming讀者反饋學(xué)科排名
作者: 邊緣 時間: 2025-3-21 22:02
An Analysis of the Behaviour of Mutation in Grammatical Evolution, those that are structural in nature and those that are nodal. A structural event can alter the length of the phenotype whereas a nodal event simply alters the value at any terminal (leaf or internal node) of a derivation tree. We analyse the behaviour of standard mutation and compare it to the beh作者: 清楚 時間: 2025-3-22 02:53
Positional Effect of Crossover and Mutation in Grammatical Evolutioneaning of all of the following genes. This paper analyses the crossover and mutation operations in GE, in particular examining the constructive or destructive nature of these operations when occurring at points throughout a genotype. The results we present show some strong support for the idea that 作者: 不可知論 時間: 2025-3-22 08:24
Sub-tree Swapping Crossover and Arity Histogram Distributionsct fixed point for trees with internal nodes of identical arity. However, only an approximate model (based on the notion of average arity) for the mixed-arity case has been proposed. This leaves a particularly important gap in our knowledge because multi-arity function sets are commonplace in GP and作者: 和平主義 時間: 2025-3-22 09:31
Novelty-Based Fitness: An Evaluation under the Santa Fe Trail respect to training, test and generalization performance. Three novelty-based approaches are considered: novelty comparison against a finite archive of behavioral archetypes, novelty comparison against all previously seen behaviors, and a simple linear combination of the first method with a standar作者: synchronous 時間: 2025-3-22 15:38 作者: synchronous 時間: 2025-3-22 20:07
Handling Different Categories of Concept Drifts in Data Streams Using Distributed GP, the availability of cheaper and better-performing distributed and parallel architectures make it possible to deal with complex problems previously hardly solved owing to the large amount of time necessary. This work presents a general framework based on a distributed GP ensemble algorithm for copi作者: ATP861 時間: 2025-3-23 00:19
An Indirect Approach to the Three-Dimensional Multi-pipe Routing Probleml robot called a turtle navigate through space, leaving pipe segments along its route. The turtle senses its environment and acts in accordance with commands received from heuristics currently under evaluation. The heuristics are evolved by a Gene Expression Programming based Learning Classifier Sys作者: 冬眠 時間: 2025-3-23 03:16 作者: Vital-Signs 時間: 2025-3-23 09:25
A Relaxed Approach to Simplification in Genetic Programmingseparate proposal of simplifications from an acceptance criterion that checks the effect of proposed simplifications on the evaluation of training examples, looking several levels up the tree. We test our simplification method on three classification datasets and conclude that the success of linear 作者: Conclave 時間: 2025-3-23 11:46 作者: Aviary 時間: 2025-3-23 14:13
GP-Fileprints: File Types Detection Using Genetic Programming use of meta data). GP evolves programs with multiple components. One component analyses statistical features extracted from the raw byte-series to divide the data into blocks. These blocks are then analysed via another component to obtain a signature for each file in a training set. These signature作者: 我不重要 時間: 2025-3-23 20:18 作者: organic-matrix 時間: 2025-3-23 22:21
Controlling Complex Dynamics with Artificial Biochemical Networkscal organisms. This paper shows how evolved ABNs may be used to control chaotic dynamics in both discrete and continuous dynamical systems, illustrating that ABNs can be used to represent complex computational behaviours within evolutionary algorithms. Our results also show that performance is sensi作者: Estimable 時間: 2025-3-24 03:28 作者: NOCT 時間: 2025-3-24 08:17 作者: CHECK 時間: 2025-3-24 10:49 作者: Cumbersome 時間: 2025-3-24 17:35 作者: emulsify 時間: 2025-3-24 21:30
Enabling Object Reuse on Genetic Programming-Based Approaches to Object-Oriented Evolutionary Testin evolving test data. However, standard typed Genetic Programming approaches do not allow Object Reuse; this paper proposes a novel methodology to overcome this limitation. Object Reuse means that one instance can be passed to multiple methods as an argument, or multiple times to the same method as a作者: scrutiny 時間: 2025-3-25 03:02 作者: Adornment 時間: 2025-3-25 04:19 作者: 上漲 時間: 2025-3-25 08:40
https://doi.org/10.1007/978-3-322-98992-5, those that are structural in nature and those that are nodal. A structural event can alter the length of the phenotype whereas a nodal event simply alters the value at any terminal (leaf or internal node) of a derivation tree. We analyse the behaviour of standard mutation and compare it to the beh作者: Detain 時間: 2025-3-25 12:36 作者: intercede 時間: 2025-3-25 18:58 作者: 結(jié)合 時間: 2025-3-25 20:54 作者: JADED 時間: 2025-3-26 00:30
https://doi.org/10.1007/3-540-30049-Xon-terminal symbols during the derivation sequence. Earlier studies have indicated that allowing the path of the expansion to be under the guidance of evolution as opposed to a deterministic process produced significant performance gains on all of the benchmark problems analysed. In this study we ex作者: 騙子 時間: 2025-3-26 04:47 作者: N防腐劑 時間: 2025-3-26 11:25 作者: entreat 時間: 2025-3-26 16:04 作者: Pseudoephedrine 時間: 2025-3-26 20:34
https://doi.org/10.1007/978-3-662-30228-6separate proposal of simplifications from an acceptance criterion that checks the effect of proposed simplifications on the evaluation of training examples, looking several levels up the tree. We test our simplification method on three classification datasets and conclude that the success of linear 作者: 荒唐 時間: 2025-3-26 22:05 作者: AMITY 時間: 2025-3-27 02:18 作者: 解脫 時間: 2025-3-27 07:51 作者: 機(jī)械 時間: 2025-3-27 11:49
https://doi.org/10.1007/978-3-662-30230-9cal organisms. This paper shows how evolved ABNs may be used to control chaotic dynamics in both discrete and continuous dynamical systems, illustrating that ABNs can be used to represent complex computational behaviours within evolutionary algorithms. Our results also show that performance is sensi作者: Filibuster 時間: 2025-3-27 14:46 作者: 憎惡 時間: 2025-3-27 21:21
https://doi.org/10.1007/978-3-662-21751-1emantic Similarity based Crossover - SSC). The use of validation sets is also investigated for both standard crossover and SSC. All GP systems are tested on a number of real-valued symbolic regression problems. The experimental results show that while using validation sets barely improve generalisat作者: Haphazard 時間: 2025-3-27 23:08 作者: 拉開這車床 時間: 2025-3-28 05:59
https://doi.org/10.1007/978-3-662-29208-2ging may represent with good resolution GP’s behaviour in the early stages of a run, it blurs later components of the dynamics. We propose two techniques to improve the situation: solution-locked averaging and solution-time binning. Results indicate that there are significant benefits in adopting th作者: 努力趕上 時間: 2025-3-28 08:18 作者: Cognizance 時間: 2025-3-28 13:14
Anna Isabel Esparcia-Alcázar,Anikó Ekárt,A. ?ima UFast track conference proceeding.Unique visibility.State of the art research作者: Engulf 時間: 2025-3-28 16:37 作者: 焦慮 時間: 2025-3-28 19:56 作者: MILL 時間: 2025-3-29 02:25
https://doi.org/10.1007/978-3-662-29208-2ging may represent with good resolution GP’s behaviour in the early stages of a run, it blurs later components of the dynamics. We propose two techniques to improve the situation: solution-locked averaging and solution-time binning. Results indicate that there are significant benefits in adopting these techniques.作者: CRUC 時間: 2025-3-29 06:14 作者: 不遵守 時間: 2025-3-29 10:00
Evolving Genes to Balance a PoleThe network is a modified version of an Artificial Regulatory Network proposed a few years ago, and the task could be solved only by finding a proper way of connecting inputs and outputs to the network. We show that the representation is able to generalize well over the problem domain, and discuss the performance of different models of this kind.作者: 啞巴 時間: 2025-3-29 14:44
Solution-Locked Averages and Solution-Time Binning in Genetic Programmingging may represent with good resolution GP’s behaviour in the early stages of a run, it blurs later components of the dynamics. We propose two techniques to improve the situation: solution-locked averaging and solution-time binning. Results indicate that there are significant benefits in adopting these techniques.作者: 逢迎春日 時間: 2025-3-29 17:44
978-3-642-12147-0Springer-Verlag Berlin Heidelberg 2010作者: Observe 時間: 2025-3-29 22:09 作者: TAG 時間: 2025-3-30 01:44 作者: Cubicle 時間: 2025-3-30 06:05
Phenotypic Diversity in Initial Genetic Programming Populations method for measuring phenotypic diversity in terms of the run-time behaviour of programs. We describe how this is applicable to a range of problem domains and show how the promotion of such diversity in initial genetic programming populations can have a substantial impact on solution-finding performance.作者: Painstaking 時間: 2025-3-30 09:40
Controlling Complex Dynamics with Artificial Biochemical Networksng that ABNs can be used to represent complex computational behaviours within evolutionary algorithms. Our results also show that performance is sensitive to model choice, and suggest that conservation laws play an important role in guiding search.作者: exhibit 時間: 2025-3-30 15:11
Geometric Differential Evolution on the Space of Genetic Programsss representations. In this paper, we derive formally a specific GDE for the space of genetic programs. The result is a Differential Evolution algorithm searching the space of genetic programs by acting directly on their tree representation. We present experimental results for the new algorithm.作者: Complement 時間: 2025-3-30 17:30
https://doi.org/10.1007/978-3-322-98992-5aviour of its nodal and structural components. These results are then compared with standard GP operators to see how they differ. This study increases our understanding of how the search operators of an evolutionary algorithm behave.作者: 負(fù)擔(dān) 時間: 2025-3-31 00:30
Das letzte Jahr der Sowjetunionevents occurring at the first positions of a genotype are indeed more destructive, but also indicate that they may be the most constructive crossover and mutation points too. We also demonstrate the sensitivity of this work to the precise definition of what is constructive/destructive.作者: 煩擾 時間: 2025-3-31 03:30
https://doi.org/10.1007/978-3-662-30228-6regression is dataset dependent, that looking further up the tree can catch ineffective simplifications, and that CPU time can be significantly reduced while maintaining classification accuracy on unseen examples.作者: 挫敗 時間: 2025-3-31 05:25 作者: 多骨 時間: 2025-3-31 12:22 作者: 萬靈丹 時間: 2025-3-31 14:46
A Relaxed Approach to Simplification in Genetic Programmingregression is dataset dependent, that looking further up the tree can catch ineffective simplifications, and that CPU time can be significantly reduced while maintaining classification accuracy on unseen examples.作者: 兇兆 時間: 2025-3-31 18:00 作者: Processes 時間: 2025-3-31 21:46
https://doi.org/10.1007/978-3-662-26497-3ved it can be used on unseen data without requiring any further evolution. Experimental results show that GP compares very well with established file classification algorithms (i.e., Neural Networks, Bayes Networks and J48 Decision Trees).作者: 顛簸下上 時間: 2025-4-1 05:45
An Indirect Approach to the Three-Dimensional Multi-pipe Routing Problemand the search space is more complex. The best evolved heuristic is short and simple, builds modular solutions, exhibits some degree of generalization and demonstrates good scalability on test cases similar to the training case.作者: Preserve 時間: 2025-4-1 08:30 作者: Osteoarthritis 時間: 2025-4-1 13:26 作者: Insulin 時間: 2025-4-1 15:30 作者: 制度 時間: 2025-4-1 22:31
https://doi.org/10.1007/3-540-30049-Xof recent results on alternative grammar representations with this new evidence. We conclude that it is possible to improve the performance of grammar-based Genetic Programming by the manner in which a genotype-phenotype map is performed.
