Eberbach E., Enhancing Genetic Programming by $-calculus, Proc. of the Second Annual Genetic Programming Conference GP-97, Morgan Kaufmann, Stanford University, 1997, 88.  Home/Search   Document Not in Database   Summary   Related Articles   Check

..... Meta control. We use a process algebra variant of resource bounded computation to integrate deliberative and reactive approaches for action selection in real time. Our approach has been developed independently of anytime algorithms under the names modifiable algorithms [2] and calculus [3]. calculus proposes a general theory of algorithm construction. Everything is a expression: agents, behaviors, interactions, and environments. Elementary behaviors are expressions representing atomic process steps. Simple expressions consist of negation , cost , send , receive , ....

Eberbach E.: Enhancing Genetic Programming by $-calculus, Proc. of the Second Annual Genetic Programming Conference GP-97, Morgan Kaufmann, (

....14 Genetic programming Droste, Stefan, 398] Dubossarsky, Eugene, 219] Duffy, J. 378] Dunay, B. D. 147, 221] Dunay, Bertrand Daniel, 93, 189] Dunham, B. 492] Dunlap, Frank, 34] Durnota, Bohdan, 122] Dworman, Garett, 279] Dzeroski, S. 148] Dzeroski, S. 94] Eberbach, Eugene, [400] Edmonds, A. N. 191] Ehrenburg, Herman, 280] Eick, C. F. 341] Eick, Christoph F. 329] Engel, David, 192] Esparcia Alcazar, Anna J. 401] Esparcia Alc azar, Anna I. 226, 352] Evett, Matthew, 403] Evett, M. 402] Farry, Kristin A. 282] Fernandez, Jaime J. 193, 281, 282] ....

.... 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]

Eugene Eberbach. Enhancing genetic programming by $-calculus. In Koza et al. [567], page ? y(conf.prog) ga97aEberbach. 44 Genetic programming

....(e.g. selfmodif ication) and optimization, including expert systems, neural networks, evolutionary computation, artif icial life, adaptive autonomous agents, plan generation, fault tolerant systems, computer viruses, machine learning, and evolvable hardware. The calculus (read: cost calculus) [9, 10, 11, 12, 13] is a higher order polyadic process algebra with a quantita 1 research partially supported by a grant from NSERC No.OGP0046501, a preliminary version of this paper has appeared in Late Breaking Papers of Genetic Programming GP 98 Conference, Madison, Wisconsin tive aspect (cost) which naturally ....

Eberbach E., Enhancing Genetic Programming by $-calculus, Proc. of the Second Annual Genetic Programming Conference GP-97, Morgan Kaufmann, Stanford University, 1997, 88.

No context found.

Eberbach E., Enhancing Genetic Programming by $- calculus, Proc. of the Second Annual Genetic Programming Conference GP-97, Morgan Kaufmann, Stanford University,

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