Wolfgang Banzhaf. Genetic programming for pedestrians. In Proceedings of the 5th International Conference on Genetic Algorithms, ICGA-93. Morgan Kaufmann, 1993.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....breeding policies, tness functions and new genetic operations. Also a group of researchers have focussed on the syntax of GP since representation is an important phenomena for all evolutionary methods. This has resulted obtaining di erent variations of the standard GP method like Pedestrian GP [5], Strongly Typed GP [40] Stack Based GP [30] and Machine Code GP [42] Note that abstraction is an important phenomena for solving complex problems. However, standard GP has no mechanism to support data abstraction for the control of growing complexity and to facilitate code reuse. Hence ....

Wolfgang Banzhaf. Genetic programming for pedestrians. In Stephanie Forrest, editor, Proceedings of the 5th International Conference on Genetic Algorithms, ICGA-93, page 628, University of Illinois at Urbana-Champaign, 17-21 July 1993. Morgan Kaufmann.

.... of reasons, but any other programming language should work as well, and indeed there have been implementations in C , just to mention a programming language that di ers drastically from LISP, or even with an encoding from which a program can be compiled (see e.g. the work by Wolfgang Banzhaf [5]) controllers; be S the set of possible states of the system to be controlled and suppose that failure and success conditions of a simulation are de ned. Competitions can be performed as follows: An initial state is randomly generated according to some distribution over S, which could depend, ....

W. Banzhaf. Genetic programming for pedestrians. In S. Forrest, editor, Proceedings of the Fifth International Conference on Genetic Algorithms, page 628, San Mateo, CA, 1993. Morgan Kaufmann.

....order by the name of the patent. ffl none 9 10 3.6 Crossreferences The following table contains the references to the proceedings having genetic algorithms via ftp articles and references to these articles. in [91] 10] in [92] 53, 66] in [93] 35, 76] in [94] 71] in [95] [25, 58, 81, 84] in [96] 57] in [97] 77] Authors 11 3.7 Authors The following list contains all genetic algorithms via ftp authors and references to their known contributions. Abela, J. 19, 20, 22] Abramson, David, 19, 20, 21, 22] Adami, Chris, 23] Adamidis, Panagiotis, 7] Ahuactzin, ....

....to their known contributions. Abela, J. 19, 20, 22] Abramson, David, 19, 20, 21, 22] Adami, Chris, 23] Adamidis, Panagiotis, 7] Ahuactzin, Juan Manuel, 88, 90] Altenberg, Lee, 16] Atlan, Laurent, 24] Back, Thomas, 83] Bakirtzis, A. G. 18] Bakirtzis, A. 8] Banzhaf, Wolfgang, [25, 26] Beasley, David, 27, 28] Bertoni, Alberto, 32, 33] Bessi ere, Pierre, 85, 88, 90] Bonnet, J erome, 24] Born, Joachim, 29, 30] Boyd, Ian D. 9] Bull, David R. 27, 28] Chiva, Emmanual, 10] Chu, Chee Hung H. 11] Cliff, David T. 12, 13, 14, 17, 43, 44, 46, 47, 48, 49, 50, 52] ....

[Article contains additional citation context not shown here]

Wolfgang Banzhaf. Genetic programming for pedestrians. In Forrest [95], page 628. (also as [?]; available via anonymous ftp cite ftp.cc.utexas.edu directory /pub/genetic-programming/papers file GenProg forPed.ps.Z) ga:Banzhaf93a.

....Lisp, i.e. three, in order to avoid syntactic problems when the tree crossover and the mutation operators try to replace a function with another one having a di erent number of arguments. Any function will actually use the number of arguments it needs. This choice is the same made by W. Banzhaf in [Ban93] for the Pedestrian Genetic Programming. Finally, the classical proportional and the truncation selection mechanisms have been considered; the latter has been chosen because it accelerates the convergence time to a suboptimum. To this end, moreover, we have also used a 1 elitism strategy with both ....

W. Banzhaf (1993). Genetic Programming for pedestrians. Tech. Report: 93-03.

....[345] Autere, Antti, 174, 184] Back, Barbro, 188] B ack, Thomas, 20, 412] Backofen, Rolf, 86] Baden, Scott, 81] Baiardi, Fabrizio, 222] Bakirtzis, A. G. 151, 200] Bala, Jerzy W. 87] Balsa Canto, Eva, 335] Baluja, Shumeet, 11, 56, 58] Banga, Julio R. 335] Banzhaf, Wolfgang, [206, 230, 346, 347, 348] Batali, J. 88] Baum, Eric B. 39] Beasley, David, 349, 350] Belew, Richard K. 81] Bentley, Peter J. 82] Berg, J. van den, 172] Bertoni, Alberto, 356, 357] Bessi ere, Pierre, 414, 417, 419] Biles, William E. 305] Blickle, Tobias, 152, 190, 218] Boneh, Dan, 39] Bonnet, ....

.... 20 Genetic algorithms available via ftp and www fuzzy sets, 353, 27, 29, 193] fuzzy systems, 160, 228, 241, 252, 253, 273] GA hardness, 15] GA hardness, 209] GADGET, 113] game theory, 159] games Othello, 394] genetic algorithms, 320, 324, 337] genetic drift, 375] genetic programming, [345, 346, 347, 385, 395, 413, 152, 185, 206, 207, 230, 257, 258, 278, 289, 321] genetic programming analysis, 182] C , 80] data mining, 74] learning, 124] sorting, 384] genome variable length, 366] graph coloring, 196] graph partitioning, 414] graphs maximum clique, 196] rrawing, 300] group theory Steiner systems, 386] grouping, 92] halftoning, 21, 53] ....

[Article contains additional citation context not shown here]

Wolfgang Banzhaf. Genetic programming for pedestrians. In Forrest [467], page 628. (also as [?]; ftp.cc.utexas.edu: /pub/genetic-programming/papers/ GenProg forPed.ps.Z) Key: ga:Banzhaf93a.

....Thomas, 75, 76, 4, 214, 918, 919] Badii, A. 77] Bagchi, Sugato, 78] Baiardi, F. 724] Baker, Ellie, 236] Baker, James Edward, 79, 80] Bala, Jerzy W. 81, 82] Balio, R. Del, 211, 212] Ball, N. R. 83, 84] Baluja, Shumeet, 85, 86] Banks, S. P. 433, 434] Banzhaf, Wolfgang, [87, 88, 89, 90, 91, 92, 93] Barrios, Victor, 94, 95] Barry, A. M. 96] Baskaran, Subbiah, 97] Bassanini, A. 682] Bassett, Steve, 98] Battle, David L. 1036] Baxter, J. 99] Bean, James C. 100] Beard, Nick, 101, 777] Beasley, David, 102, 103, 104, 105, 106] Beaty, Steven J. 107] Beauchamp, James, ....

.... [628] crossword puzzle, 826] Othello, 718] GAmeter, 351] GATES, 645] GAWindows, 612] gears, 811] gene size 2880bits, 649] generations, 571] 100, 191] 1000, 162] 2000, 938] 300, 732] 300 500, 948] genetic drift, 444, 445] genetic fusion, 494] genetic programming, [62, 63, 64, 65, 87, 88, 101, 151, 203, 395, 396, 397, 398, 428, 429, 430, 431, 521, 565, 570, 592, 593, 596, 597, 598, 682, 723, 733, 759, 777, 818, 942, 943, 953, 976, 977, 1002, 1107, 1108] genetic programming sorting, 569] GenNETS, 1104] genome length 48 bits, 1076] genotype, 433] GENROUTE, 275] geology, 458] geophysics, 39, 162, 656, 885] groundwater, 458] petrophysics, 557] GESA, 1095] Gnets, 1029] graph coloring, 175, 255] graph partitioning, 1052] ....

[Article contains additional citation context not shown here]

Wolfgang Banzhaf. Genetic programming for pedestrians. In Forrest [347], page 628. (also as [89]; available via anonymous ftp cite ftp.cc.utexas.edu directory /pub/genetic-programming/papers file GenProg forPed.ps.Z ) ga:Banzhaf93a.

....R. W. 89] Ansari, Nirwan, 65] Aspnas, Anders, 208] Astola, Jaakko, 158] Atlan, Laurent, 300] Autere, Antti, 133, 143] Back, Barbro, 147] Back, Thomas, 19, 367] Baiardi, Fabrizio, 182] Bakirtzis, A. G. 109, 159] Bala, Jerzy W. 66] Baluja, Shumeet, 11, 44, 45] Banzhaf, Wolfgang, [165, 190, 301, 302, 303] Batali, J. 67] Baum, Eric B. 31] Beasley, David, 304, 305] Bentley, Peter J. 62] Berg, J. van den, 131] Bertoni, Alberto, 311, 312] Bessi ere, Pierre, 369, 372, 374] Biles, William E. 265] Blickle, Tobias, 110, 149, 178] Boneh, Dan, 31] Bonnet, J erome, 300] Born, Joachim, ....

.... fuzzy GA, 157, 279] fuzzy logic, 161] fuzzy sets, 308, 24, 26, 152] fuzzy systems, 118, 188, 201, 212, 213, 233] GA hardness, 14] GA hardness, 169] GADGET, 90] game theory, 117] games Othello, 349] genetic algorithms, 280, 283, 101, 294] genetic drift, 330] genetic programming, [300, 301, 302, 340, 350, 368, 110, 144, 165, 166, 190, 217, 218, 238, 249, 281] genetic programming analysis, 141] C , 61] data mining, 55] sorting, 339] genome variable length, 321] graph coloring, 155] graph partitioning, 369] graphs maximum clique, 155] rrawing, 260] group theory Subject index 19 Steiner systems, 341] grouping, 70] halftoning, 20, 41] ....

[Article contains additional citation context not shown here]

Wolfgang Banzhaf. Genetic programming for pedestrians. In Forrest [428], page 628. (also as [429]; ftp.cc.utexas.edu: /pub/genetic-programming/papers/ GenProg forPed.ps.Z) Key: ga:Banzhaf93a.

....for program induction by the genetic algorithm is not a new idea. Cramer [5] in his seminal paper on tree based genetic programming presents a linear language JB and discusses some of the difficulties associated with using this language in the genetic algorithm to induce programs. Banzhaf [1] addresses some of the problems mentioned by Cramer through the use of an editing process that can correct syntax errors contained in linear programs generated by the genetic algorithm. Perkis [16] attacked the problem of syntax errors contained in linear programs generated by the genetic ....

Wolfgang Banzhaf. Genetic programming for pedestrians. In Stephanie Forrest, editor, Proceedings of the Fifth International Conference on Genetic Algorithms, page 628ff, San Mateo, CA, 1993. Morgan Kaufmann Publishers Inc.

....523] Araki, Miyuhiko, 76] Arus, C. 287] Ashlock, Dan, 383, 459] Atkin, Marc C. 83, 476, 477] Atlan, Laurent, 478, 479, 508] Aytekin, T. 177] Backer, Gerriet, 265] Bal ate, Mojm ir, 384] Ballard, Dana H. 123, 155, 167, 178] Balogh, S. 350] Bancroft, C. 338] Banzhaf, Wolfgang, [143, 215, 240, 255, 253, 257, 259, 260, 266, 283, 309, 320, 323, 363, 372, 376, 385, 432, 480, 481] Barclay, Peter J. 293] Barklund, Jonas, 306] Barnes, D. P. 124] Barton, Geoffrey W. 210, 239, 316, 371] Bartton, G. W. 454] Bassanini, A. 515] Bastian, A. 386] Bauer, Eric T. 179] Beard, Nick, 482, 521] Bell, Larry, 381] Bengio, Samy, 85] Bengio, Yoshua, 85] Benini, Luca, ....

.... programming, 104] fitting Mackey Glass, 119] formal languages context free, 248] fractals IFS, 187] ftiness limited error, 460] function approximation, 180] GA P, 200] game theory, 279] games, 390] Nim, 422] poker, 392] Tetris, 234] tile puzzle, 188] genetic programming, [489, 485, 490, 506, 483, 487, 488, 37, 507, 38, 39, 41, 42, 43, 44, 45, 46, 47, 48, 49, 474, 475, 501, 508, 40, 50, 51, 52, 53, 54, 55, 56, 57, 58, 525, 530, 536, 537, 77, 493, 494, 499, 500, 509, 511, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 519, 520, 522, 524, 526, 527, 538, 539, 476, 477, 478, 479, 480, 481, 482, 484, 486, 495, 496, 497, 498, 502, 503, 504, 505, 510, 512, 514, 71, 72, 73, 74, 75, 515, 516, 517, 518, 521, 523, 528, 529, 531, 532, 533, 534, 540, 541, 79, 82, 84, 86, 87, 88, 89, 92, 95, 96, 97, 99, 102, 107, 108, 109, 112, 114, 115, 117, 122, 123, 124, 125, 127, 129, 130, 133, 134, 135, 137, 138, 139, 140, 142, 143, 147, 149, 153, 155, 156, 157, 158, 160, 164, 167, 168, 170, 171, 10, 173, 11, 12, 13, 16, 17, 18, 19, 20, 175, 176, 177, 178, 180, 181, 182, 183, 184, 185, 187, 188, 189, 190, 192, 193, 194, 195, 196, 197, 198, 199, 200, 201, 202, 203, 205, 21, 206, 207, 210, 211, 213, 214, 215, 216, 217, 218, 221, 222, 223, 224, 225, 226, 227, 228, 229, 230, 231, 233, 234, 236, 237, 22, 238, 239, 240, 241, 242, 244, 245, 246, 248, 249, 250, 252, 253, 254, 255, 257, 258, 259, 260, 307, 261, 262, 26, 264, 265, 266, 267, 270, 272, 275, 277, 278, 279, 280, 281, 283, 284, 288, 289, 290, 292, 293, 294, 296, 298, 301, 302, 303, 304, 305, 306, 308, 309, 310, 27, 313, 314, 315, 316, 317, 318, 320, 321, 322, 323, 328, 330, 331, 332, 333, 334, 335, 336, 337, 338, 339, 341, 343, 344, 345, 346, 347, 348, 28, 349, 350, 351, 352, 355, 357, 358, 359, 360, 29, 361, 362, 363, 364, 366, 367, 368, 371, 372, 373, 374, 375, 32, 376, 377, 378, 379, 380, 381, 382, 383, 384, 385, 386, 387, 388, 390, 391, 392, 393, 394, 395, 396, 397, 400, 402, 403, 404, 405, 407, 408, 409, 410, 411, 412, 413, 414, 415, 417, 421, 422, 423, 33, 425, 426, 427, 429, 430, 432, 433, 435, 437, 438, 439, 440, 442, 443, 444, 445, 446, 447, 448, 449, 450, 451, 453, 454, 455, 456, 459, 461, 34, 462, 463, 464, 465, 466, 467, 468, 35, 469, 470, 471, 36, 472] genetic programming acyclic graphs, 151] agents, 325] AI, 329] analysis, 159, 327] Boolean functions, 398, 460] breeding, 80, 169, 172] C, 434] C , 103, 128, 186, 354, 356] classification, 287] code reuse, 418] combinatorial logic, 428] commercial applications, 243] compact ....

[Article contains additional citation context not shown here]

Wolfgang Banzhaf. Genetic programming for pedestrians. In Forrest [544], page 628. (also as [?]; available via anonymous ftp site ftp.cc.utexas.edu directory /pub/genetic-programming/papers file GenProg forPed.ps.Z) ga:Banzhaf93a.

....2.2.1 Program Representation In most genetic programming work the programs being evolved are represented using trees [Koz92] However a number of alternative approaches use linear chromosomes. Per94] uses a linear postfix language and claims some advantages over the more standard tree approach. Ban93] also uses a linear approach but various operations convert this to a tree shaped program which is executed. However of the linear chromosome approaches perhaps the most surprising and successful is [Nor94] in which the representation is a small (up to 1000 bytes) machine code program. Enormous ....

Wolfgang Banzhaf. Genetic programming for pedestrians. In Stephanie Forrest, editor, Proceedings of the 5th International Conference on Genetic Algorithms, ICGA-93, page 628, University of Illinois at UrbanaChampaign, 17-21 July 1993. Morgan Kaufmann.

....of the virtual machine which interprets target programs. These include the generation of automatically defined functions (Koza 1992) the tagging for reuse of useful program modules that arise (Angeline and Pollack 1993) the incorporation of a pseudo developmental process for program repair (Banzhaf 1993) and the addition of scratchpad memory which target programs can use to record state information (Teller 1993) 3 Stack GP 3.1 Implementation In the first implementation of the stack GP system, as in Koza, target programs (critters) are LISP s expressions consisting of combinations of functions ....

Banzhaf, Wolfgang. (1993) "Genetic Programming for Pedestrians." in Proc. of the Fifth International Conference on Genetic Algorithms. (ed. Stephanie Forrest), San Mateo, CA: Morgan Kaufman.

.... in [107] 108, 109, 110, 111, 112, 113, 114, 115, 116, 117, 118] in [119] 120, 121] in [122] 123] in [124] 125] in [126] 127, 128, 129, 130] in [131] 132] in [133] 134] in [135] 136] in [137] 138] in [139] 140] in [141] 142, 143, 144] in [145] 146] in [147] [148, 149, 150, 151, 152, 153, 154, 155] in [156] 157, 158, 159] in [160] 161] in [162] 163, 164] in [165] 166] in [167] 168, 169] 12 3.7 Authors The following list contains all genetic programming authors and references to their known contributions. Alpern, Adam, 170] Altenberg, Lee, 57, 171] Andre, David, 62, ....

....Adam, 170] Altenberg, Lee, 57, 171] Andre, David, 62, 80, 172, 108] Andrews, Martin, 173] Angeline, Peter J. 58, 59, 174, 121, 175, 37] Araki, Miyuhiko, 176] Atkin, Marc C. 63, 177, 44] Atlan, Laurent, 178, 29, 179, 30] Ballard, Dana H. 76, 45, 180, 109] Banzhaf, Wolfgang, [88, 115, 118, 148, 36] Barnes, D. P. 181] Bassanini, A. 43] Beard, Nick, 17, 18] Bengio, Samy, 64] Bengio, Yoshua, 64] Bickel, Arthur S. 142] Bickel, Riva Wenig, 142] Bluming, Jason, 66] Bonnet, J erome, 178, 29, 179] Bryant, Bruce D. 182] Buckles, Bill P. 67, 71] Carmi, Aviram, 77] ....

[Article contains additional citation context not shown here]

Wolfgang Banzhaf. Genetic programming for pedestrians. In Forrest [147], page 628. (also as [247]; available via anonymous ftp cite ftp.cc.utexas.edu directory /pub/genetic-programming/papers file GenProg forPed.ps.Z) ga:Banzhaf93a.

....Multiobjectives Hybrids [ZM93] Gru93] Knowledge augmentation Approximate function evaluation [Koz92] Table 2: Exotic GA Techniques Applied to Genetic Programming 4.1 Syntax In this section we look at various syntactical variations to the standard GP approach. 4.1. 1 Pedestrian GP Banzhaf ( Ban93] has devised a GP system using a traditional GA binary string representation. The mechanisms of transcription, editing and repairing are used to convert these bit strings into computer programs. Each individual in the population consists of a string of 225 bits. The 225 bits are interpreted as ....

Wolfgang Banzhaf. Genetic programming for pedestrians. In Proceedings of the 5th International Conference on Genetic Algorithms, ICGA-93. Morgan Kaufmann, 1993.

....i.e. three, in order to avoid syntactic problems when the tree crossover and the mutation operators try to replace a function with another one having a different number of arguments. Any function will actually use the number of arguments it needs. This choice is the same made by W. Banzhaf in [Ban93] for the Pedestrian Genetic Programming. An example of application of the tree crossover and of the mutation (insertion) is shown in Fig. 1 which reports both the trees and the relative TOY Lisp programs (strings) It should be noted that in this figure we report only the actual number of function ....

W. Banzhaf (1993). Genetic Programming for pedestrians. Tech. Report: 93--03.

....language (like LISP) but programs of an imperative language (like C) are evolved. The use of linear bit sequences in GP again goes back to Cramer and his JB language [7] Cramer later discarded his approach in favor of a tree representation. A more general linear approach was introduced by Banzhaf [2]. Nordin s idea of using machine code for evolution was the most radical down to bones approach [17] in this context. It was subsequently expanded [19] and led to the AIMGP (Automatic Induction of Machine code by Genetic Programming) system [3] In AIMGP, individuals are manipulated directly as ....

....genetic programming. An individual program is represented as a variable length string composed of simple C instructions. An excerpt of a linear genetic program is given below. void ind(v) double v[8] v[0] v[5] 73; v[7] v[0] 59; I) if (v[1] 0) if (v[5] 21) v[4] v[2] v[1] v[2] v[5] v[4] I) v[6] v[0] 25; v[6] v[4] 4; v[1] sin(v[6] if (v[0] v[1] I) v[3] v[5] v[5] I) v[7] v[6] 2; v[5] v[7] 115; I) if (v[1] v[6] 5 v[1] sin(v[7] The instruction set (or function set) of the system is composed of arithmetic ....

[Article contains additional citation context not shown here]

W. Banzhaf (1993) Genetic Programming for Pedestrians. In S. Forrest (ed.) Proceedings of the Fifth International Conference on Genetic Algorithms, 628, Morgan Kaufmann, San Mateo, CA.

.... domain and structural and diversity measures ffl efficient algorithms for locating of gaps in distance spaces with more than two dimensions Since binary strings are simple structures in comparison with trees, genospaces of binary strings are of special interest in the context of genometry [WoBa93]. ....

Banzhaf, Wolfgang; Genetic Programming for Pedestrians, Int. Conference on Genetic Algorithms (ICGA-93), Champaign-Urbana, IL, 1993, S. Forrest (Ed.), Morgan Kaufmann Publishers, San Mateo, CA, 628

No context found.

Wolfgang Banzhaf. Genetic programming for pedestrians. In Proceedings of the 5th International Conference on Genetic Algorithms, ICGA-93. Morgan Kaufmann, 1993.

No context found.

Wolfgang Banzhaf. Genetic programming for pedestrians. In Stephanie Forrest, editor, Proceedings of the 5th International Conference on Genetic Algorithms, ICGA-93, page 628, University of Illinois at Urbana-Champaign, 17-21 July 1993. Morgan Kaufmann.

No context found.

W. Banzhaf. Genetic programming for pedestrians. In S. Forrest, editor, Proceedings of the Fifth International Conference on Genetic Algorithms, page 628, San Mateo, CA, 1993. Morgan Kaufmann.

No context found.

Wolfgang Banzhaf. Genetic programming for pedestrians. In Stephanie Forrest, editor, Proceedings of the 5th International Conference on Genetic Algorithms, ICGA-93, page 628, University of Illinois at Urbana-Champaign, 17-21 July 1993. Morgan Kaufmann.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC