Mathias et al., 1994 - Google Patents
Transforming the search space with gray codingMathias et al., 1994
View PS- Document ID
- 977941552141447199
- Author
- Mathias K
- Whitley L
- Publication year
- Publication venue
- Proceedings of the first IEEE conference on evolutionary computation. IEEE world congress on computational intelligence
External Links
Snippet
Genetic algorithm test functions have typically been designed with properties in numeric space that make it difficult to locate the optimal solution using traditional optimization techniques. The use of Gray coding has been found to enhance the performance of genetic …
- 230000001131 transforming 0 title description 5
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
- G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
- G06F17/30286—Information retrieval; Database structures therefor; File system structures therefor in structured data stores
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
- G06F17/10—Complex mathematical operations
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06N—COMPUTER SYSTEMS BASED ON SPECIFIC COMPUTATIONAL MODELS
- G06N3/00—Computer systems based on biological models
- G06N3/12—Computer systems based on biological models using genetic models
- G06N3/126—Genetic algorithms, i.e. information processing using digital simulations of the genetic system
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Mathias et al. | Transforming the search space with gray coding | |
| Whitley | Permutations | |
| EP1506621B1 (en) | Decoding of chain reaction codes through inactivation of recovered symbols | |
| Mathias et al. | Changing representations during search: A comparative study of delta coding | |
| Cole et al. | Verifying candidate matches in sparse and wildcard matching | |
| Hairer | The motion of a random string | |
| US11954115B2 (en) | Methods and systems for wavelet based representation | |
| Sleator et al. | Short encodings of evolving structures | |
| Rowe et al. | Properties of gray and binary representations | |
| WO2015044777A1 (en) | Systems and methods for distance approximation in graphs | |
| Panchenko | Structure of finite-RSB asymptotic Gibbs measures in the diluted spin glass models | |
| Mathias et al. | Initial performance comparisons for the delta coding algorithm | |
| Thomas et al. | Using real-coded genetic algorithms for Weibull parameter estimation | |
| Milenkovic et al. | Probabilistic transforms for combinatorial urn models | |
| Brown | Dynamic programming in computer science | |
| Wang et al. | A genetic algorithm combined with finite element method for robust design of actuators | |
| Sudan | Maximum likelihood decoding of Reed Solomon codes | |
| Cui et al. | Machine learning on generalized complete intersection Calabi-Yau manifolds | |
| McPhee et al. | A schema theory analysis of mutation size biases in genetic programming with linear representations | |
| Kaeding et al. | Program for generating tables of SU (3)⊃ SU (2)⊗ U (1) coupling coefficients | |
| CN110990188A (en) | Construction method of partial repetition code based on Hadamard matrix | |
| Kotsireas et al. | Competent genetic algorithms for weighing matrices | |
| Murray et al. | Defining pathway assembly and exploring its applications | |
| Haas | Scaling limits of Markov-branching trees and applications: lecture notes of the XII Simposio de Probabilidad y Procesos Estocásticos 16–20 Novembre 2015, Mérida, Yucatán | |
| Ordentlich et al. | On multi-directional context sets |