標(biāo)題: Titlebook: Genetic Programming; First European Works Wolfgang Banzhaf,Riccardo Poli,Terence C. Fogarty Conference proceedings 1998 Springer-Verlag Ber [打印本頁] 作者: Sinuate 時(shí)間: 2025-3-21 17:15
書目名稱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é)科排名
作者: 蓋他為秘密 時(shí)間: 2025-3-21 21:01
Where does the good stuff go, and why? how contextual semantics influences program structure in simty of genetic program trees during the evolutionary process. We show that contextual semantics influence the composition, location and flows of operative code in a program. In detail we analyze these dynamics and discuss the impact of our findings on micro-level descriptions of genetic programming.作者: 變化無常 時(shí)間: 2025-3-22 04:16 作者: 凹槽 時(shí)間: 2025-3-22 06:22
Concepts of inductive genetic programming,g tasks. We review the components of the method, and propose new approaches to some open issues such as: the sensitivity of the operators to the topology of the genetic program trees, the coordination of the operators, and the investigation of their performance. The genetic operators are examined by作者: Campaign 時(shí)間: 2025-3-22 12:12
Immediate transfer of global improvements to all individuals in a population compared to automatica, an improvement in a part of a program (an ADF or a main body) can only be transferred via crossover. In this article, we consider whether it is a good idea to transfer immediately improvements found by a single individual to the whole population. A system that implements this idea has been propose作者: GULF 時(shí)間: 2025-3-22 13:26
Non-destructive depth-dependent crossover for genetic programming,rmal crossover, i.e., building blocks are broken unexpectedly. In the depth-dependent crossover, the depth selection ratio was varied according to the depth of a node. However, the depth-dependent crossover did not work very effectively as generated programs became larger. To overcome this, we intro作者: GULF 時(shí)間: 2025-3-22 18:57
Grammatical evolution: Evolving programs for an arbitrary language,nition is mapped to a program, expressions and programs of arbitrary complexity may be evolved. Other automatic programming methods are described, before our system, ., is applied to a symbolic regression problem.作者: 結(jié)構(gòu) 時(shí)間: 2025-3-22 22:48 作者: 喚醒 時(shí)間: 2025-3-23 05:16
Speech sound discrimination with genetic programming, data of human speech. We examine whether a genetic programming algorithm can find programs that are able to discriminate certain spoken vowels and consonants. We present evidence that this can indeed be achieved with a surprisingly simple approach that does not need preprocessing. The data we have 作者: 漂泊 時(shí)間: 2025-3-23 05:36
Efficient evolution of asymmetric recurrent neural networks using a PDGP-inspired two-dimensional rent architectures have been hindered by the fact that available training algorithms are considerably more complex than those for feedforward networks. In this paper, we present a new method to build recurrent neural networks based on evolutionary computation, which combines a linear chromosome with 作者: intoxicate 時(shí)間: 2025-3-23 09:41
A cellular-programming approach to pattern classification,rn classification. More precisely, after an introduction to the evolutionary cellular automata model, we describe a general approach suitable for designing cellular classifiers. The approach is based on a set of non-uniform cellular automata performing specific classification tasks, which have been 作者: Amplify 時(shí)間: 2025-3-23 16:05
Genetic programming for automatic design of self-adaptive robots,t learning. We define a behavior-based system relying on automatic design process using artificial evolution to synthesize high level behaviors for autonomous agents. Behavioral strategies are described by tree-based structures, and manipulated by genetic evolving processes. Each strategy is dynamic作者: Orchiectomy 時(shí)間: 2025-3-23 21:26 作者: 大氣層 時(shí)間: 2025-3-23 23:02 作者: 修改 時(shí)間: 2025-3-24 05:40 作者: 植物學(xué) 時(shí)間: 2025-3-24 08:59 作者: 說明 時(shí)間: 2025-3-24 13:44 作者: 油氈 時(shí)間: 2025-3-24 15:45
https://doi.org/10.1007/BFb0055923Algorithms; Augmented Reality; Automat; classification; design patterns; evolution; evolutionary computati作者: 上漲 時(shí)間: 2025-3-24 22:37
Das deutsche Drama von Gottsched bis Lessingbeen produced recently to extend the GA schema theory to Genetic Programming (GP). In this paper we review the main results available to date in the theory of schemata for GP and some recent experimental work on schemata.作者: 縱欲 時(shí)間: 2025-3-25 02:50 作者: dragon 時(shí)間: 2025-3-25 04:24 作者: sparse 時(shí)間: 2025-3-25 11:29 作者: 自負(fù)的人 時(shí)間: 2025-3-25 12:53 作者: ORBIT 時(shí)間: 2025-3-25 18:29 作者: 殘暴 時(shí)間: 2025-3-25 23:56
https://doi.org/10.1007/978-3-476-03155-6nition is mapped to a program, expressions and programs of arbitrary complexity may be evolved. Other automatic programming methods are described, before our system, ., is applied to a symbolic regression problem.作者: FEIGN 時(shí)間: 2025-3-26 03:18 作者: 刺耳的聲音 時(shí)間: 2025-3-26 05:11 作者: Axon895 時(shí)間: 2025-3-26 10:19 作者: Landlocked 時(shí)間: 2025-3-26 14:53 作者: 隱士 時(shí)間: 2025-3-26 20:01 作者: 可耕種 時(shí)間: 2025-3-26 23:45 作者: 楓樹 時(shí)間: 2025-3-27 01:27 作者: 大溝 時(shí)間: 2025-3-27 05:37 作者: legislate 時(shí)間: 2025-3-27 12:34
Einleitung: Das doppelt geteilte Land,that evolutionary learning systems are adopting increasingly sophisticated variation mechanisms. In this paper, we draw parallels between the adaptation mechanisms in nature and those in evolutionary learning systems. Extrapolating this trend, we indicate an interesting new direction for future work作者: Connotation 時(shí)間: 2025-3-27 14:42 作者: PATHY 時(shí)間: 2025-3-27 19:42 作者: 冷漠 時(shí)間: 2025-3-28 00:27
Genetic Programming978-3-540-69758-9Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 訓(xùn)誡 時(shí)間: 2025-3-28 03:07
Das deutsche Drama von Gottsched bis Lessingbeen produced recently to extend the GA schema theory to Genetic Programming (GP). In this paper we review the main results available to date in the theory of schemata for GP and some recent experimental work on schemata.作者: 刺激 時(shí)間: 2025-3-28 09:12
das Gattungsbewusstsein der Epigrammatiker,ty of genetic program trees during the evolutionary process. We show that contextual semantics influence the composition, location and flows of operative code in a program. In detail we analyze these dynamics and discuss the impact of our findings on micro-level descriptions of genetic programming.作者: Indigence 時(shí)間: 2025-3-28 14:15 作者: 反應(yīng) 時(shí)間: 2025-3-28 18:12
Definitions- und Integrationsdimensionbines Genetic Algorithms and Scatter Search coupled with a decomposition-into-petals procedure for solving a class of Vehicle Routing and Scheduling Problems. Its performance is evaluated for a heterogeneous fleet model, which is considered a problem much harder to solve than the homogeneous vehicle routing problem.作者: 遵循的規(guī)范 時(shí)間: 2025-3-28 21:00
Einleitung: Das doppelt geteilte Land,that evolutionary learning systems are adopting increasingly sophisticated variation mechanisms. In this paper, we draw parallels between the adaptation mechanisms in nature and those in evolutionary learning systems. Extrapolating this trend, we indicate an interesting new direction for future work on evolutionary learning systems.作者: Indicative 時(shí)間: 2025-3-29 01:26
A review of theoretical and experimental results on schemata in genetic programming,been produced recently to extend the GA schema theory to Genetic Programming (GP). In this paper we review the main results available to date in the theory of schemata for GP and some recent experimental work on schemata.作者: 愉快么 時(shí)間: 2025-3-29 05:13 作者: Benign 時(shí)間: 2025-3-29 11:15 作者: 火車車輪 時(shí)間: 2025-3-29 15:21
An evolutionary hybrid metaheuristic for solving the vehicle routing problem with heterogeneous flebines Genetic Algorithms and Scatter Search coupled with a decomposition-into-petals procedure for solving a class of Vehicle Routing and Scheduling Problems. Its performance is evaluated for a heterogeneous fleet model, which is considered a problem much harder to solve than the homogeneous vehicle routing problem.作者: Intellectual 時(shí)間: 2025-3-29 16:14
,Evolutionary computation and the tinkerer’s evolving toolbox,that evolutionary learning systems are adopting increasingly sophisticated variation mechanisms. In this paper, we draw parallels between the adaptation mechanisms in nature and those in evolutionary learning systems. Extrapolating this trend, we indicate an interesting new direction for future work on evolutionary learning systems.作者: 持續(xù) 時(shí)間: 2025-3-29 23:07 作者: 雄偉 時(shí)間: 2025-3-30 03:09
Evolving coupled map lattices for computation,Genetic programming is used to evolve coupled map lattices for density classification. The most successful evolved rules depending only on nearest neighbors (. = 1) show better performance than existing . = 3 cellular automaton rules on this task.作者: Gustatory 時(shí)間: 2025-3-30 04:39 作者: HERTZ 時(shí)間: 2025-3-30 10:24 作者: 側(cè)面左右 時(shí)間: 2025-3-30 14:08 作者: 不透明 時(shí)間: 2025-3-30 17:30 作者: cornucopia 時(shí)間: 2025-3-31 00:07
Conference proceedings 1998t presentations carefully selected for inclusion in the book. The papers are organized in topical sections on experimental and theoretical studies; algorithms, representations and operators; and applications.作者: 疲憊的老馬 時(shí)間: 2025-3-31 04:30
0302-9743 nd 10 short presentations carefully selected for inclusion in the book. The papers are organized in topical sections on experimental and theoretical studies; algorithms, representations and operators; and applications.978-3-540-64360-9978-3-540-69758-9Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: amyloid 時(shí)間: 2025-3-31 07:20 作者: obsolete 時(shí)間: 2025-3-31 09:46
Fitness causes bloat: Mutation,e fitness as existing trial solutions. In general variable length allows many more long representations of a given solution than short ones. Thus in search (without a length bias) we expect longer representations to occur more often and so representation length to tend to increase. I.e. fitness based selection leads to bloat.作者: Collar 時(shí)間: 2025-3-31 15:05
0302-9743 pril 1998, under the sponsorship of EvoNet, the European Network of Excellence in Evolutionary Computing..The volume presents 12 revised full papers and 10 short presentations carefully selected for inclusion in the book. The papers are organized in topical sections on experimental and theoretical s作者: 神經(jīng) 時(shí)間: 2025-3-31 18:46 作者: 大都市 時(shí)間: 2025-3-31 23:14
https://doi.org/10.1007/978-3-322-96282-9nsonants. We present evidence that this can indeed be achieved with a surprisingly simple approach that does not need preprocessing. The data we have collected on the system’s behavior show that even speaker-independent discrimination is possible with GP.作者: 靈敏 時(shí)間: 2025-4-1 02:28
Labor law and tax law in China and Germany,gning cellular classifiers. The approach is based on a set of non-uniform cellular automata performing specific classification tasks, which have been designed by means of a cellular evolutionary algorithm..The proposed approach is discussed together with some preliminary results obtained on a benchmark data set consisting of car-plate digits.作者: 取之不竭 時(shí)間: 2025-4-1 06:58
https://doi.org/10.1007/978-3-531-19817-0r the overall behavior of the evolutionary process. This paper addresses the construction of a object-oriented Genetic Programming framework using on design patterns to increase its flexibility and reusability.作者: 有節(jié)制 時(shí)間: 2025-4-1 13:55
