New Approach of Constant Resolving of Analytical Programming
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F70883521%3A28140%2F16%3A43875308" target="_blank" >RIV/70883521:28140/16:43875308 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
New Approach of Constant Resolving of Analytical Programming
Original language description
This papers' aim is to provide the Artificial Intelligence community with a better tool for symbolic regression. In this paper, the method of analytical programming and constant resolving is revisited and extended. Nowadays, analytical programming mainly uses two methods for onstant resolving. The first method is meta-evolution, in which the second evolutionary algorithm is used for constant resolving. The second method uses non-linear fitting algorithm. This paper reveals the third method, which use the basic mathematics to generate constants. The findings of this study have a number of important implications for future practice.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
IN - Informatics
OECD FORD branch
—
Result continuities
Project
—
Continuities
S - Specificky vyzkum na vysokych skolach
Others
Publication year
2016
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
Proceedings - 30th European Conference on Modelling and Simulation ECMS 2016
ISBN
978-0-9932440-2-5
ISSN
—
e-ISSN
—
Number of pages
6
Pages from-to
231-236
Publisher name
EUROPEAN COUNCIL MODELLING & SIMULATION, SCHOOL COMPUTING & MATHEMATICS
Place of publication
Nottingham
Event location
Regensburg
Event date
May 31, 2016
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
000386310800032