A Polynomial Function Discovery System — FFS
1997 ◽
Vol 06
(01)
◽
pp. 1-13
Keyword(s):
This paper presents a function discovery system FFS that has two core parts: FFS-0-CORE and FFS-1-CORE. Both cores are with polynomial time complexity in discovering functions of either a•f(x)+b form or a1f1(x)+…+anfn(x)+b form. FFS-0-CORE allows users to define their own models. FFS-1-CORE uses novel principles to increase information which helps the function discovery procedures. Three computational examples are included.
2000 ◽
Vol 69
(231)
◽
pp. 1167-1183
◽
Keyword(s):
2011 ◽
Vol 21
(07)
◽
pp. 1217-1235
◽
2012 ◽
Vol 23
(07)
◽
pp. 1451-1464
◽
2013 ◽
Vol 25
(24)
◽
pp. 2393-2396
◽
Keyword(s):