A case study for constrained learning neural root finders (Q1780526)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A case study for constrained learning neural root finders |
scientific article; zbMATH DE number 2175483
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A case study for constrained learning neural root finders |
scientific article; zbMATH DE number 2175483 |
Statements
A case study for constrained learning neural root finders (English)
0 references
13 June 2005
0 references
Feedforward neural networks
0 references
Polynomials
0 references
Finding Roots
0 references
Recursive partitioning
0 references
Constrained learning algorithm
0 references
Computational complexity
0 references
0 references
0.87703323
0 references
0.87643516
0 references
0.87275505
0 references
0.8564538
0 references
0.8543031
0 references
0.8530957
0 references
