標(biāo)題: Titlebook: Genetic Programming; Second European Work Riccardo Poli,Peter Nordin,Terence C. Fogarty Conference proceedings 1999 Springer-Verlag Berlin [打印本頁(yè)] 作者: Monroe 時(shí)間: 2025-3-21 19:36
書目名稱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é)科排名
作者: indemnify 時(shí)間: 2025-3-21 20:18 作者: 易于交談 時(shí)間: 2025-3-22 00:36 作者: 揉雜 時(shí)間: 2025-3-22 06:21
Evolving Fuzzy Rule Based Classifiers with GA-P: A Grammatical Approach functional parts, one for the Fuzzy Rule Base (GP Part), and the other for the constants that define the shapes of the fuzzy sets involved in the Fuzzy Rule Base (GA Part). We have applied this method to some classical benchmarks taken from the collection of test data at the UCI Repository of Machine Learning Databases [9].作者: 剛毅 時(shí)間: 2025-3-22 09:04
Jürgen Friedrichs,Ulrich Schwingesn operators (the meta level) which are recombining a pool of recombination operators, even self-recombination on the additional level becomes feasible.We show that the overall performance of this system is better than in other variants of graph GP. As a test problem we use speaker recognition.作者: angiography 時(shí)間: 2025-3-22 14:10
Galaxienhaufen, Galaxien und Gas,lation without explicit synchronization beyond that provided by the locking mechanism of the ODBMS. This paper describes a design pattern for a genetic programming environment that allows combining existing techniques with persistent population storage and management.作者: angiography 時(shí)間: 2025-3-22 19:56
https://doi.org/10.1007/978-3-7091-0567-2the evolved function. Arithmetic, trigonometric functions and a conditional statement are used as primitive functions. Using this representation we evolved an inverse function to localize a robot in a simulated office environment. Finally, we analyze the accuracy of the resulting function.作者: buoyant 時(shí)間: 2025-3-22 23:43 作者: HEED 時(shí)間: 2025-3-23 03:39 作者: 使長(zhǎng)胖 時(shí)間: 2025-3-23 07:14 作者: 統(tǒng)治人類 時(shí)間: 2025-3-23 13:37 作者: Bouquet 時(shí)間: 2025-3-23 16:05
Genetic Reasoning: Evolutionary Induction of Mathematical Proofse genetic programming as the general technique for automated programming. We show that such a system can be used to evolve mathematical proofs in complex domains, i.e. arithmetics. We extend our previous research by the implementation of an efficient and stable C-language system in contrast to earlier work in Prolog.作者: 肥料 時(shí)間: 2025-3-23 19:09
0302-9743 PG ‘99, held in G?teborg, Sweden in May 1999..The 12 revised full papers and 11 posters presented have been carefully reviewed and selected for inclusion in the book. All the relevant aspects of genetic programming are addressed ranging from traditional and foundational issues to applications in a v作者: Aggrandize 時(shí)間: 2025-3-24 00:46 作者: 節(jié)省 時(shí)間: 2025-3-24 05:42
https://doi.org/10.1007/978-3-476-03638-4terpreting Turing Machines, designed to take advantage of the existence of sets of equivalent Turing Machines. The experimental results show that these alternatives provide improvement over the “standard” genetic codification.作者: 友好關(guān)系 時(shí)間: 2025-3-24 08:33 作者: Arthropathy 時(shí)間: 2025-3-24 13:13
https://doi.org/10.1007/978-3-658-21605-4 applications. This paper describes a Strongly Typed Genetic Programming (STGP) approach to the automatic generation and evolution of 2D affine IFS, and affine maps in general. We explain the nature of the encoding used in conjunction with STGP, and demonstrate with examples its application to the inverse problem for IFS.作者: PLE 時(shí)間: 2025-3-24 17:23 作者: Reservation 時(shí)間: 2025-3-24 20:00
Conference proceedings 19999..The 12 revised full papers and 11 posters presented have been carefully reviewed and selected for inclusion in the book. All the relevant aspects of genetic programming are addressed ranging from traditional and foundational issues to applications in a variety of fields.作者: cavity 時(shí)間: 2025-3-25 01:13 作者: interrupt 時(shí)間: 2025-3-25 03:19 作者: GUILE 時(shí)間: 2025-3-25 09:07 作者: Debility 時(shí)間: 2025-3-25 15:20 作者: 易于出錯(cuò) 時(shí)間: 2025-3-25 16:32
Sub-machine-code GP: New Results and Extensions to process multiple fitness cases per program execution in continuous symbolic regression problems where inputs and outputs are real-valued numbers, reporting experimental results on a quartic polynomial approximation task.作者: dyspareunia 時(shí)間: 2025-3-25 20:06 作者: 偉大 時(shí)間: 2025-3-26 01:33
Genetic Programming of a Goal-Keeper Control Strategy for the RoboCup Middle Size Competitionng only a small sub-set of the situations that the goalkeeper is required to tackle, it is possible to evolve a complex behavior that permits the goalkeeper to perform well also in more challenging real-world conditions.作者: 刀鋒 時(shí)間: 2025-3-26 05:05
Adapting the Fitness Function in GP for Data Mininga sets. The results indicate that extending the . with the .-ing feature increases its performance when different types of misclassifications are not weighted differently, but leads to worse results when they are.作者: 冒煙 時(shí)間: 2025-3-26 12:30 作者: 潛伏期 時(shí)間: 2025-3-26 13:31
Busy Beaver - The Influence of Representationterpreting Turing Machines, designed to take advantage of the existence of sets of equivalent Turing Machines. The experimental results show that these alternatives provide improvement over the “standard” genetic codification.作者: UNT 時(shí)間: 2025-3-26 19:06 作者: 慎重 時(shí)間: 2025-3-26 21:38
Automatic Generation of Affine IFS and Strongly Typed Genetic Programming applications. This paper describes a Strongly Typed Genetic Programming (STGP) approach to the automatic generation and evolution of 2D affine IFS, and affine maps in general. We explain the nature of the encoding used in conjunction with STGP, and demonstrate with examples its application to the inverse problem for IFS.作者: 高興一回 時(shí)間: 2025-3-27 01:45
Reactive and Memory-Based Genetic Programming for Robot Controldict reward based on state and action, which reduces the complexity of the evolved mappings. The work is motivated by applications to the control of autonomous robots. Preliminary results in software simulations indicate an enhanced learning speed and quality.作者: humectant 時(shí)間: 2025-3-27 09:02 作者: 腐蝕 時(shí)間: 2025-3-27 12:52
Riccardo Poli,Peter Nordin,Terence C. FogartyIncludes supplementary material: 作者: Callus 時(shí)間: 2025-3-27 14:03 作者: tattle 時(shí)間: 2025-3-27 18:12 作者: venous-leak 時(shí)間: 2025-3-27 22:09
https://doi.org/10.1007/978-3-476-03638-4aper we propose an evolutionary approach to this problem. We will focus on the representational issues, proposing alternative ways of codifying and interpreting Turing Machines, designed to take advantage of the existence of sets of equivalent Turing Machines. The experimental results show that thes作者: 性別 時(shí)間: 2025-3-28 03:36
,Tipps für den Kinderschockraum,resent a novel representation of function nodes, designed to allow the search operators to make smaller movements around the solution space. Using this representation, performance on the even-6-parity problem is improved by three orders of magnitude relative to the estimate given for standard GP in 作者: NEEDY 時(shí)間: 2025-3-28 09:41 作者: 傳授知識(shí) 時(shí)間: 2025-3-28 13:04
Die Zahlengerade unter dem Mikroskop,arallelism of sequential CPUs. In previous work [20] we have shown examples of applications of this technique to the evolution of parallel programs and to the parallel evaluation of 32 or 64 fitness cases per program execution in Boolean classification problems. After recalling the basic features of作者: 不適 時(shí)間: 2025-3-28 18:01
https://doi.org/10.1007/978-3-662-54411-2nary genome determines which production rules in a Backus Naur Form grammar definition are used in a genotype to phenotype mapping process to a program. Expressions and programs of arbitrary complexity may be evolved using this system..Since first describing this system, GE has been applied to other作者: neutralize 時(shí)間: 2025-3-28 19:34 作者: noxious 時(shí)間: 2025-3-28 23:34 作者: Acumen 時(shí)間: 2025-3-29 05:03
Vorbemerkung: Thematischer Horizont,ning algorithm suffers from several problems such as sensitivity to the initial conditions and very slow convergence. The aim of this work is to use Genetic Programming (GP) to discover new supervised learning algorithms which can overcome some of these problems. In previous research a new learning 作者: RECUR 時(shí)間: 2025-3-29 07:15
Michael Sch?fer,Sven-Joachim Ottospection of the SAR images taken by satellites. The scheme: (1) affords practical evolution times, (2) is structured to discover fast automatic detectors, (3) can produce small detectors that shed light into the nature of the detection. Detectors compare favorably in accuracy to those obtained using作者: 顯示 時(shí)間: 2025-3-29 12:55
https://doi.org/10.1007/978-3-658-21605-4nted as arrays of floating point constants or, as shown in this paper, hierarchical data structures and therefore are good candidates for evolutionary applications. This paper describes a Strongly Typed Genetic Programming (STGP) approach to the automatic generation and evolution of 2D affine IFS, a作者: Microaneurysm 時(shí)間: 2025-3-29 19:02
Einberufungspatent vom 13.5.1848increase the probability of modelling the most relevant parts of memory space. We evolve maps directly from state to action, rather than maps that predict reward based on state and action, which reduces the complexity of the evolved mappings. The work is motivated by applications to the control of a作者: Mumble 時(shí)間: 2025-3-29 20:42
Galaxienhaufen, Galaxien und Gas,provements in terms of both robustness and flexibility. Populations of evolvable individuals can be made persistent across several evolutionary runs, making it possible to devise . strategies. Moreover, virtually any number of evolutionary processes may be run in parallel on the same underlying popu作者: Intend 時(shí)間: 2025-3-30 01:08 作者: Binge-Drinking 時(shí)間: 2025-3-30 04:44 作者: DAFT 時(shí)間: 2025-3-30 11:36 作者: 怪物 時(shí)間: 2025-3-30 14:51
Grenzfragen des Nerven- und Seelenlebensight settings. Our approach combines evolutionary algorithms and genetic programming techniques and is based on a new network encoding schema where instead of a string like encoding the graph representation of neural nets is used. This way of “encoding” reduces the computational expense and leads to作者: 挖掘 時(shí)間: 2025-3-30 18:42 作者: 辮子帶來(lái)幫助 時(shí)間: 2025-3-30 20:42 作者: brother 時(shí)間: 2025-3-31 03:21
Genetic Programming978-3-540-48885-9Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 畢業(yè)典禮 時(shí)間: 2025-3-31 07:16 作者: Trabeculoplasty 時(shí)間: 2025-3-31 12:38 作者: GRATE 時(shí)間: 2025-3-31 13:42
Grenzfragen des Nerven- und Seelenlebensight settings. Our approach combines evolutionary algorithms and genetic programming techniques and is based on a new network encoding schema where instead of a string like encoding the graph representation of neural nets is used. This way of “encoding” reduces the computational expense and leads to a greater variety of network topologies.作者: 畏縮 時(shí)間: 2025-3-31 18:33
Mutation in Genetic Programming: A Preliminary Studyresent a novel representation of function nodes, designed to allow the search operators to make smaller movements around the solution space. Using this representation, performance on the even-6-parity problem is improved by three orders of magnitude relative to the estimate given for standard GP in [5].作者: Agility 時(shí)間: 2025-3-31 22:02
Evolution of Ship Detectors for Satellite SAR Imageryspection of the SAR images taken by satellites. The scheme: (1) affords practical evolution times, (2) is structured to discover fast automatic detectors, (3) can produce small detectors that shed light into the nature of the detection. Detectors compare favorably in accuracy to those obtained using a SOM neural network.作者: 揭穿真相 時(shí)間: 2025-4-1 05:41
Evolving Neural Network Structures by Means of Genetic Programmingight settings. Our approach combines evolutionary algorithms and genetic programming techniques and is based on a new network encoding schema where instead of a string like encoding the graph representation of neural nets is used. This way of “encoding” reduces the computational expense and leads to a greater variety of network topologies.作者: indices 時(shí)間: 2025-4-1 08:58
Conference proceedings 19999..The 12 revised full papers and 11 posters presented have been carefully reviewed and selected for inclusion in the book. All the relevant aspects of genetic programming are addressed ranging from traditional and foundational issues to applications in a variety of fields.作者: 影響帶來(lái) 時(shí)間: 2025-4-1 13:11
https://doi.org/10.1007/3-540-48885-5Adaptive Systems; Augmented Reality; Boolean function; Computation; Evolutionary; Genetic Algorithms; Gene作者: ingrate 時(shí)間: 2025-4-1 14:33
,Kognitive Irrtümer in der Arbeitswelt, to the period just before the time (1928) when Wilhelm Cauer invented and patented the elliptic filter. Genetic programming is then used to reinvent a technically equivalent filter that avoids the key characteristics of then-preexisting Campbell filter. Genetic programming can be used as an inventi作者: Oratory 時(shí)間: 2025-4-1 19:32
