Stop the war!

Остановите войну!

• solidarity - (ua) - (ru)
• news - (ua) - (ru)
• donate - donate - donate

for scientists:

• ERA4Ukraine
• Assistance in Germany
• Ukrainian Global University
• #ScienceForUkraine

default search action

• combined dblp search
• author search
• venue search
• publication search

Authors:

• no matches

• 

Venues:

• no matches

• 

Publications:

• no matches

• 

ask others

• Google
• Google Scholar
• Semantic Scholar
• Internet Archive Scholar
• CiteSeerX
• ORCID

Refine list

refinements active!

zoomed in on ?? of ?? records

dismiss all constraints

view refined list in

dblp search

export refined list as

XML

JSON

JSONP

BibTeX

showing all ?? records

Volume 1 - Volume 2

• 
  Hisashi Tamaki, Hajime Kita, Nobuhiko Shimizu, Keiji Maekawa, Yoshikazu Nishikawa:
  A Comparison Study of Genetic Codings for the Traveling Salesman Problem. 1-6
• 
  Thang Nguyen Bui, Byung Ro Moon:
  A New Genetic Approach for the Traveling Salesman Problem. 7-12
• 
  Robert Hinterding:
  Mapping, Order-Independent Genes and the Knapsack Problem. 13-17
• 
  Parthasarathy Guturu, Ammanamanchi Srinivasa Murthy, V. U. K. Sastry:
  Clique Finding - A Genetic Approach. 18-21
• 
  Harpal Maini, Kishan Mehrotra, Chilukuri K. Mohan, Sanjay Ranka:
  Knowledge Based Nonuniform Crossover. 22-27

• 
  Frank Klawonn, Jens Kinzel, Rudolf Kruse:
  Modifications of Genetic Algorithms for Designing and Optimizing Fuzzy Controllers. 28-33
• 
  James C. Bezdek, Srinivas Boggavarapu, Lawrence O. Hall, Amine Bensaid:
  Genetic Algorithm Guided Clustering. 34-39
• 
  Thomas Bäck, Ulrich Hammel:
  Evolution Strategies Applied to Perturbed Objective Functions. 40-45
• 
  Frederick E. Petry, Bill P. Buckles, Dev Prabhu, Roy George, Radhakrishnan Srikanth:
  Fuzzy Clustering With Genetic Search. 46-50
• 
  Andrea Bonarini:
  Evolutionary Learning of General Fuzzy Rules with Biased Evaluation Functions: Competition and Cooperation. 51-56

• 
  Thomas Bäck:
  Selective Pressure in Evolutionary Algorithms: A Characterization of Selection Mechanisms. 57-62
• 
  Günter Rudolph:
  Convergence of Non-Elitist Strategies. 63-66
• 
  Samir W. Mahfoud:
  Genetic Drift in Sharing Methods. 67-72

• 
  Jaroslaw Arabas, Zbigniew Michalewicz, Jan J. Mulawka:
  GAVaPS - A Genetic Algorithm with Varying Population Size. 73-78
• 
  Helge Rosé, Werner Ebeling, Johannes Schuchhardt:
  Evolutionary Strategies for Solving Frustrated Problems. 79-81
• 
  Jeffrey Horn, Nicholas Nafpliotis, David E. Goldberg:
  A Niched Pareto Genetic Algorithm for Multiobjective Optimization. 82-87
• 
  Hans-Michael Voigt, Thomas Anheyer:
  Modal Mutations in Evolutionary Algorithms. 88-92

• 
  Matteo Sonza Reorda, Maurizio Rebaudengo:
  A Genetic Algorithm for Floorplan Area Optimization. 93-96
• 
  B. B. Prahlada Rao, Lalit M. Patnaik, R. C. Hansdah:
  A Genetic Algorithm for Channel Routing using Inter-Cluster Mutation. 97-103
• 
  Mike Davis, Luoping Liu, John G. Elias:
  VLSI Circuit Synthesis Using a Parallel Genetic Algorithm. 104-109
• 
  Paolo Gentili, Francesco Piazza, Aurelio Uncini:
  Evolutionary Design of Fir Digital Filters with Power-of-Two Coefficients. 110-114

• 
  Attilio Giordana, Lorenza Saitta, Floriano Zini:
  Learning Disjunctive Concepts with Distributed Genetic Algorithms. 115-119
• 
  Arthur L. Corcoran, Sandip Sen:
  Using Real-Valued Genetic Algorithms to Evolve Rule Sets for Classification. 120-124
• 
  Douglas B. Lynch, David C. Kuncicky:
  A Knowledge-Based Genetic Heuristic for Learning Certainty Factors. 125-129
• 
  Simon M. Lucas:
  Structuring Chromosomes for Context-Free Grammar Evolution. 130-135

• 
  Astro Teller:
  Turing Completeness in the Language of Genetic Programming with Indexed Memory. 136-141
• 
  Kenneth E. Kinnear Jr.:
  Fitness Landscapes and Difficulty in Genetic Programming. 142-147
• 
  Timothy Perkis:
  Stack-Based Genetic Programming. 148-153
• 
  Simon Handley:
  On the Use of Directed Acyclic Graph to Represent a Population of Computer Programs. 154-159
• 
  Walter Alden Tackett, Aviram Carami:
  The Unique Implications of Brood Selection for Genetic Programming. 160-165

• 
  Vassilios Petridis, Spiridon A. Kazarlis:
  Varying Quality Function in Genetic Algorithms and the Cutting Problem. 166-169
• 
  Shigeyoshi Tsutsui, Yoshiji Fujimoto, Isao Hayashi:
  Extended Forking Genetic Algorithm for Order Representation (O-FGA). 170-175
• 
  B. Csukás, R. Lakner, K. Varga:
  Evolution of the Evaluated Conservation Structures. 176-181
• 
  Lee Altenberg:
  Evolving Better Representations Through Selective Genome Growth. 182-187
• 
  Samir W. Mahfoud:
  Crossover Interactions Among Niches. 188-193

• 
  Jean-Yves Potvin, Danny Dubé:
  Improving a Vehicle Routing Heuristic Through Genetic Search. 194-199
• 
  Andrew B. Conru:
  A Genetic Approach to the Cable Haress Routing Problem. 200-205
• 
  Thomas D. Logan:
  An Electronic Card Production Line Loading Program-An Evolutionary Algorithm Implementation. 206-210
• 
  Hoi-Shan Lin, Jing Xiao, Zbigniew Michalewicz:
  Evolutionary Algorithm for Path Planning in Mobile Robot Environment. 211-216
• 
  N. Saravanan, David B. Fogel:
  Evolving Neurocontrollers Using Evolutionary Programming. 217-222

• 
  Sadayoshi Mikami, Yukinori Kakazu:
  Genetic Reinforcement Learning for Cooperative Traffic Signal Control. 223-228
• 
  H. Füger, G. Stein, Uwe Stilla:
  Multi-Population Evolution Strategies for Structural Image Analysis. 229-234
• 
  Jeffrey D. Stumpf, Xin Feng, Richard W. Kelnhofer:
  An Enhanced Operator-Oriented Genetic Search Algorithm. 235-238
• 
  Chuen-Tsai Sun, Ying-Hong Liao, Jing-Liu Lu, Fu-May Zheng:
  Genetic Algorithm Learning in Game Playing with Multiple Coaches. 239-243

• 
  John R. Koza:
  Recognizing Patterns in Protein Sequences Using Iteration-Performing Calculations in Genetic Programming. 245-249
• 
  David Andre:
  Evolution of Mapmaking: Learning, Planning, and Memory Using Genetic Programming. 250-255
• 
  Patrik D'haeseleer:
  Context Preserving Crossover in Genetic Programming. 256-261
• 
  Craig W. Reynolds:
  The Difficulty of Roving Eyes. 262-267
• 
  Gerhard Weiß:
  Neural Networks and Evolutionary Computation. PartI: Hybrid Approaches in Artificial Intelligence. 268-272
• 
  Gerhard Weiß:
  Neural Networks and Evolutionary Computation. PartII: Hybrid Approaches in the Neurosciences. 273-277
• 
  Heinrich Braun, Peter Zagorski:
  Enzo-II-A Powerful Design Tool to Evolve Multilayer Feed Forward Networks. 278-283
• 
  Zoran Obradovic, Rangarajan Srikumar:
  Evolutionary Design of Application Tailored Neural Networks. 284-289
• 
  Mukesh J. Patel, Vittorio Maniezzo:
  NN'S and GA'S: Evolving Co-Operative Behaviour in Adaptive Learning Agents. 290-295

• 
  Mark F. Bramlette:
  Finding Maximum Flow with Random and Genetic Search. 296-299
• 
  Ben Paechter, Henri Luchian, Andrew Cumming, Mihai Petriuc:
  Two Solutions to the General Timetable Problem Using Evolutionary Methods. 300-305
• 
  Gerry V. Dozier, Dennis R. Bahler, James Bowen:
  Solbing Small and Large Scale Constraint Satisfaction Problems Using a Heuristic-Based Microgenetic Algorithm. 306-311
• 
  Hugues Bersini, Jean-Michel Renders:
  Hybridizing Genetic Algorithms with Hill-Climbing Methods for Global Optimization: Two Possible Ways. 312-317

• 
  Byoung-Tak Zhang, Heinz Mühlenbein:
  Synthesis of Sigma-Pi Neural Networks by the Breeder Genetic Programming. 318-323
• 
  Samy Bengio, Yoshua Bengio, Jocelyn Cloutier:
  Use of Genetic Programming for the Search of a New Learning Rule for Neural Networks. 324-327
• 
  Marc S. Atkin, Paul R. Cohen:
  Learning Monitoring Strategies: A Difficult Genetic Programming Application. 328-332
• 
  Ming-Yi Lay:
  Application of Genetic Programming in Analyzing Multiple Steady States of Dynamical Systems. 333-336
• 
  Hugo de Garis:
  The Genetic Programming of an Artificial Brain Which Grows/Evolves at Electronic Speeds in a Cellular Automata Machine. 337-339

• 
  Arthur L. Corcoran, Dale A. Schoenefeld:
  A Genetic Algorithm for File and Task Placement in a Distributed System. 340-344
• 
  Garrison W. Greenwood, Ajay Gupta, Kelly McSweeney:
  Scheduling Tasks in Multiprocessor Systems Using Evolutionary Strategies. 345-349
• 
  Jorng-Tzong Horng, Baw-Jhiune Liu, Cheng-Yan Kao:
  A Genetic Algorithm for Database Query Optimization. 350-355
• 
  Keith E. Mathias, L. Darrell Whitley, Christof Stork, Tony Kusuma:
  Staged Hybrid Genetic Search for Seismic Data Imaging. 356-361
• 
  Hiroshi Iijima, Yusuke Naito:
  Incremental Prediction of Side-Chain Conformation of Proteins by a Genetic Algorithm. 362-367

• 
  Abraham Schultz:
  A Multiple Population Boltzmann Machine. 368-373
• 
  Gary M. Griner:
  A Comparison of Simulated Evolution and Genetic Evolution Performance. 374-378
• 
  Charles C. Palmer, Aaron Kershenbaum:
  Representing Trees in Genetic Algorithms. 379-384
• 
  John A. Gunnels, Paul Cull, James L. Holloway:
  Genetic Algorithms and Simulated Annealing for Gene Mapping. 385-390

• 
  Ulrich Wilhelm Thonemann:
  Finding Improved Simulated Annealing Schedules with Genetic Programming. 391-395
• 
  Frederick E. Petry, Bertrand Daniel Dunay, Bill P. Buckles:
  Regular Language Induction with Genetic Programming. 396-400
• 
  Hitoshi Iba, Taisuke Sato, Hugo de Garis:
  System Identification Approach to Genetic Programming. 401-406
• 
  Justinian P. Rosca, Dana H. Ballard:
  Learning by Adapting Representations in Genetic Programming. 407-412
• 
  Sidney R. Maxwell III:
  Experiments with a Coroutine Execution Model for Genetic Programming. 413-417

• 
  Masaharu Munetomo, Yoshiaki Takai, Yoshiharu Sato:
  A Genetic Approach to Dynamic Load Balancing in a Distributed Computing System. 419-421
• 
  Craig A. Farrell, Dorota H. Kieronska, Mike Schulze:
  Genetic Algorithms for Network Division Problem. 422-427
• 
  V. Scott Gordon:
  Locality in Genetic Algorithms. 428-432

• 
  Keith E. Mathias, L. Darrell Whitley:
  Initial Performance Comparisons for the Delta Coding Algorithm. 433-438
• 
  F. Greene:
  A Method for Utilizing Diploid/Dominance in Genetic Search. 439-444
• 
  Roberto Piola:
  Evolutionary Solutions to a Highly Constrained Combinatorial Problem. 445-449
• 
  Jin-Kao Hao, Raphaël Dorne:
  An Empirical Comparison of Two Evolutionary Methods for Satisfiability Problems. 451-455

• 
  John E. Perry:
  The Effect of Population Enrichment in Genetic Programming. 456-461
• 
  David Andre:
  Learning and Upgrading Rules for an OCR System Using Genetic Programming. 462-467
• 
  Frederick E. Petry, Bill P. Buckles, Thyagarajan Sadasivan, Donald H. Kraft:
  The Use of Genetic Programming to Build Queries for Information Retrieval. 468-473
• 
  Simon Handley:
  Automated Learning of a Detector for the Cores of (Alpha)-Helics in Protein Sequences via Genetic Programming. 474-479
• 
  Sumit Das, Terry Franguiadakis, Michael E. Papka, Thomas A. DeFanti, Daniel J. Sandin:
  A Genetic Programming Application in Virtual Reality. 480-484

• 
  Anthony G. Pipe, Terence C. Fogarty, Alan F. T. Winfield:
  Balancing Exploration with Exploitation - Solving Mazes With Real Numbered Search Spaces. 485-489
• 
  Bryn V. Williams, Richard T. J. Bostock, David Bounds, Alan J. Harget:
  Improving Classification Performance in the Bumptree Network by Optimising Topology with a Genetic Algorithm. 490-495
• 
  David E. Moriarty, Risto Miikkulainen:
  Improving Game-Tree Search with Evolutionary Neural Networks. 496-501
• 
  Christian Jacob:
  Typed Expressions Evolution of Artificial Nervous Systems. 502-507

• 
  Dirk Thierens, David E. Goldberg:
  Elitist Recombination: An Integrated Selection Recombination GA. 508-512
• 
  Keith E. Mathias, L. Darrell Whitley:
  Transforming the Search Space with Gray Coding. 513-518
• 
  Stefan Langerman, Gregory Seront, Hugues Bersini:
  S.T.E.P.: The Easiest Way to Optimize a Function. 519-524
• 
  Akiko N. Aizawa:
  Evolving SSE: A Stochastic Schemata Exploiter. 525-529

a service of  

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.

Unpaywalled article links

Add open access links from to the list of external document links (if available).

load links from unpaywall.org

Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.

Archived links via Wayback Machine

For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).

load content from archive.org

Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.

Reference lists

Add a list of references from , , and to record detail pages.

load references from crossref.org and opencitations.net

Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.

Citation data

Add a list of citing articles from and to record detail pages.

load citations from opencitations.net

Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.

OpenAlex data

Load additional information about publications from .

load data from openalex.org

Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.

last updated on 2024-04-25 05:27 CEST by the dblp team

 all metadata released as open data under CC0 1.0 license

see also: Terms of Use | Privacy Policy | Imprint

dblp was originally created in 1993 at:

 

since 2018, dblp has been operated and maintained by:

 

the dblp computer science bibliography is funded and supported by: