PUMA

academical publication management
collect, organize, and share publications

( en | de )

 

Disambiguation of "Gu, Shenshen"

Author of the publication

copydeleteadd this publication to your clipboard
A Polynomial Time Solvable Algorithm to Binary Quadratic Programming Problems with Q Being a Seven-Diagonal Matrix and Its Neural Network Implementation.

, , and . ISNN, volume 8866 of Lecture Notes in Computer Science, page 338-346. Springer, (2014)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Yasemin Gündüz University of Stuttgart

Yanan Guo University of Stuttgart

Frederik Gutbrod University of Stuttgart

Dr. Ulrich Guddat University of Stuttgart

Radoslava Guirguinova University of Stuttgart

 

Other publications of authors with the same name

FPGA implementation of K-Winners-Take-All neural network based on linear programming formulation., and . ICACI, page 55-59. IEEE, (2016)A neural network based algorithm to compute the distance between a point and an ellipsoid., and . ICACI, page 294-299. IEEE, (2015)The Implementation of a Pointer Network Model for Traveling Salesman Problem on a Xilinx PYNQ Board., , and . ISNN, volume 10878 of Lecture Notes in Computer Science, page 130-138. Springer, (2018)A Finite-Time Convergent Recurrent Neural Network Based Algorithm for the L Smallest k-Subsets Sum Problem.. ISNN (1), volume 7951 of Lecture Notes in Computer Science, page 19-27. Springer, (2013)An Improved Transiently Chaotic Neural Network for Solving the K-Coloring Problem.. ISNN (1), volume 3496 of Lecture Notes in Computer Science, page 750-755. Springer, (2005)A Pointer Network Based Deep Learning Algorithm for the Max-Cut Problem., and . ICONIP (1), volume 11301 of Lecture Notes in Computer Science, page 238-248. Springer, (2018)Reachability determination in acyclic Petri nets by cell enumeration approach., , , , and . Automatica, 47 (9): 2094-2098 (2011)Polynomial time solvable algorithms to a class of unconstrained and linearly constrained binary quadratic programming problems., , and . Neurocomputing, (2016)A K-Winners-Take-All Neural Network Based on Linear Programming Formulation., and . IJCNN, page 37-40. IEEE, (2007)An efficient algorithm for the subset sum problem based on finite-time convergent recurrent neural network., and . Neurocomputing, (2015)