Burgess, 1999 - Google Patents
Finding approximate analytic solutions to differential equations using genetic programmingBurgess, 1999
View PDF- Document ID
- 18170464069354694720
- Author
- Burgess G
- Publication year
External Links
Snippet
The computational optimisation technique, genetic programming, is applied to the analytic solution of general differential equations. The approach generates a mathematical expression that is an approximate or exact solution to the particular equation under …
- 230000002068 genetic 0 title abstract description 67
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/3061—Information retrieval; Database structures therefor; File system structures therefor of unstructured textual data
- G06F17/30613—Indexing
- G06F17/30619—Indexing indexing structures
-
- 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/3061—Information retrieval; Database structures therefor; File system structures therefor of unstructured textual data
- G06F17/30634—Querying
- G06F17/30657—Query processing
- G06F17/30675—Query execution
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F9/00—Arrangements for programme control, e.g. control unit
- G06F9/06—Arrangements for programme control, e.g. control unit using stored programme, i.e. using internal store of processing equipment to receive and retain programme
- G06F9/46—Multiprogramming arrangements
-
- 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
- G06F17/11—Complex mathematical operations for solving equations, e.g. nonlinear equations, general mathematical optimization problems
-
- 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/30—Information retrieval; Database structures therefor; File system structures therefor
- G06F17/30943—Information retrieval; Database structures therefor; File system structures therefor details of database functions independent of the retrieved data type
- G06F17/30946—Information retrieval; Database structures therefor; File system structures therefor details of database functions independent of the retrieved data type indexing structures
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06N—COMPUTER SYSTEMS BASED ON SPECIFIC COMPUTATIONAL MODELS
- G06N5/00—Computer systems utilising knowledge based models
- G06N5/02—Knowledge representation
- G06N5/022—Knowledge engineering, knowledge acquisition
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F8/00—Arrangements for software engineering
- G06F8/40—Transformations of program code
- G06F8/41—Compilation
-
- 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
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06N—COMPUTER SYSTEMS BASED ON SPECIFIC COMPUTATIONAL MODELS
- G06N3/00—Computer systems based on biological models
- G06N3/02—Computer systems based on biological models using neural network models
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06N—COMPUTER SYSTEMS BASED ON SPECIFIC COMPUTATIONAL MODELS
- G06N99/00—Subject matter not provided for in other groups of this subclass
- G06N99/005—Learning machines, i.e. computer in which a programme is changed according to experience gained by the machine itself during a complete run
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06N—COMPUTER SYSTEMS BASED ON SPECIFIC COMPUTATIONAL MODELS
- G06N5/00—Computer systems utilising knowledge based models
- G06N5/04—Inference methods or devices
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F19/00—Digital computing or data processing equipment or methods, specially adapted for specific applications
- G06F19/10—Bioinformatics, i.e. methods or systems for genetic or protein-related data processing in computational molecular biology
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F7/00—Methods or arrangements for processing data by operating upon the order or content of the data handled
Similar Documents
Publication | Publication Date | Title |
---|---|---|
Whitley | Next generation genetic algorithms: a user’s guide and tutorial | |
Cococcioni et al. | Solving the lexicographic multi-objective mixed-integer linear programming problem using branch-and-bound and grossone methodology | |
Castelli et al. | A C++ framework for geometric semantic genetic programming | |
Spector et al. | The push3 execution stack and the evolution of control | |
Korns | Accuracy in symbolic regression | |
Muggleton | Bayesian inductive logic programming | |
Burgess | Finding approximate analytic solutions to differential equations using genetic programming | |
Kong et al. | Averaged tree-augmented one-dependence estimators | |
König et al. | Explaining non-bisimilarity in a coalgebraic approach: Games and distinguishing formulas | |
Dioşan et al. | Evolutionary design of evolutionary algorithms | |
Křen et al. | Automatic creation of machine learning workflows with strongly typed genetic programming | |
Owais et al. | Query optimization by Genetic Algorithms. | |
Brain et al. | Invertibility conditions for floating-point formulas | |
Woodward et al. | Canonical representation genetic programming | |
Korns | An Evolutionary Algorithm for Big Data Multi-Class Classification Problems | |
Böhl et al. | Tunas-fishing for diverse answer sets: A multi-shot trade up strategy | |
Chen | Linguistic relativity and programming languages | |
Dorzhieva et al. | Punctual dimension of algebraic structures in certain classes | |
Liberti | Reformulation techniques in mathematical programming | |
Makke et al. | Symbolic Regression: A Pathway to Interpretability Towards Automated Scientific Discovery | |
Koohestani et al. | Addressing the envelope reduction of sparse matrices using a genetic programming system | |
Pancerz et al. | Modelling concurrent systems specified by dynamic information systems: A rough set approach | |
Olsson et al. | Using automatic programming to generate state-of-the-art algorithms for random 3-SAT | |
Vasbinder et al. | Selected Papers of John H Holland: A Pioneer in Complexity Science | |
Jiroušek et al. | Construction of multidimensional models by operators of composition: current state of art |