Please use this identifier to cite or link to this item:
https://olympias.lib.uoi.gr/jspui/handle/123456789/10925Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Tsoulos, I. G. | en |
| dc.contributor.author | Lagaris, I. E. | en |
| dc.date.accessioned | 2015-11-24T17:01:26Z | - |
| dc.date.available | 2015-11-24T17:01:26Z | - |
| dc.identifier.issn | 1389-2576 | - |
| dc.identifier.uri | https://olympias.lib.uoi.gr/jspui/handle/123456789/10925 | - |
| dc.rights | Default Licence | - |
| dc.title | Solving differential equations with genetic programming | en |
| heal.type | journalArticle | - |
| heal.type.en | Journal article | en |
| heal.type.el | Άρθρο Περιοδικού | el |
| heal.identifier.primary | 10.1007/s10710-006-7009-y | - |
| heal.language | en | - |
| heal.access | campus | - |
| heal.recordProvider | Πανεπιστήμιο Ιωαννίνων. Σχολή Θετικών Επιστημών. Τμήμα Μηχανικών Ηλεκτρονικών Υπολογιστών και Πληροφορικής | el |
| heal.publicationDate | 2006 | - |
| heal.abstract | A novel method for solving ordinary and partial differential equations, based on grammatical evolution is presented. The method forms generations of trial solutions expressed in an analytical closed form. Several examples are worked out and in most cases the exact solution is recovered. When the solution cannot be expressed in a closed analytical form then our method produces an approximation with a controlled level of accuracy. We report results on several problems to illustrate the potential of this approach. | en |
| heal.journalName | Genetic Programming and Evolvable Machines | en |
| heal.journalType | peer reviewed | - |
| heal.fullTextAvailability | TRUE | - |
| Appears in Collections: | Άρθρα σε επιστημονικά περιοδικά ( Ανοικτά) | |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| Lagaris-2006-Solving differential equations with genetic programming.pdf | 1.3 MB | Adobe PDF | View/Open Request a copy |
This item is licensed under a Creative Commons License
