Pages that link to "Item:Q1865473"

The following pages link to Dilation method for finding close roots of polynomials based on constrained learning neural networks (Q1865473):

Displaying 11 items.

• Finding roots of arbitrary high order polynomials based on neural network recursive partitioning method (Q866080) (← links)
• Boundedness and stability for recurrent neural networks with variable coefficients and time-varying delays (Q1409707) (← links)
• A new partitioning neural network model for recursively finding arbitrary roots of higher order arbitrary polynomials (Q1765859) (← links)
• A case study for constrained learning neural root finders (Q1780526) (← links)
• Existence and uniqueness of periodic solutions of nonautonomous cellular neural networks with impulses (Q2267203) (← links)
• Modified constrained learning algorithms incorporating additional functional constraints into neural networks (Q2466089) (← links)
• Improved constrained learning algorithms by incorporating additional functional constraints into neural networks (Q2490189) (← links)
• Determining the number of real roots of polynomials through neural networks (Q2507014) (← links)
• A new approach for function approximation incorporating adaptive particle swarm optimization and a priori information (Q2518483) (← links)
• Periodic solution and chaotic strange attractor for shunting inhibitory cellular neural networks with impulses (Q3531640) (← links)
• A Neural Root Finder of Polynomials Based on Root Moments (Q4832491) (← links)