Pages that link to "Item:Q2185605"
From MaRDI portal
The following pages link to An approximation algorithm for graph partitioning via deterministic annealing neural network (Q2185605):
Displaying 13 items.
- Improved recurrent neural network-based manipulator control with remote center of motion constraints: experimental results (Q2057734) (← links)
- MGAT: multi-view graph attention networks (Q2057755) (← links)
- Sliding-mode variable structure control for complex automatic systems: a survey (Q2130327) (← links)
- An approximation Lagrangian-based algorithm for the maximum clique problem via deterministic annealing neural network (Q2159961) (← links)
- Stationary distribution and ergodicity of a stochastic cholera model with multiple pathways of transmission (Q2205474) (← links)
- Finite-time synchronization of input delay complex networks via non-fragile controller (Q2205535) (← links)
- Solving the production transportation problem via a deterministic annealing neural network method (Q2245991) (← links)
- A logarithmic descent direction algorithm for the quadratic knapsack problem (Q2287590) (← links)
- Command filtering-based adaptive fuzzy control for permanent magnet synchronous motors with full-state constraints (Q2662704) (← links)
- Generalized Cauchy process based on heavy-tailed distribution and grey relational analysis for reliability predicting of distribution systems (Q2686800) (← links)
- Prescribed performance synchronization of complex dynamical networks with event-based communication protocols (Q6081088) (← links)
- Quantized control for a class of neural networks with adaptive event‐triggered scheme and complex cyber‐attacks (Q6083790) (← links)
- Dynamic path planning of mobile robot based on improved simulated annealing algorithm (Q6157298) (← links)