@article{10.1016/j.endm.2004.06.024,
    abstract = "In this work some preliminary numerical results obtained by large scale simulations of the sequential dynamics of a neural network model for the graph bisection problem on random geometrically connected graphs are presented. It can be concluded that the sequential dynamic is a low cost, effective and very fast local minima optimization heuristic for the Graph Bisection Problem. © 2005 Elsevier B.V. All rights reserved.",
    year = "2004",
    title = "Large Scale Simulations of a Neural Network Model for the Graph Bisection Problem on Geometrically Connected Graphs",
    volume = "18",
    keywords = "Geometrically Connected Graphs , Graph Bisection Problem , Neural Networks",
    pages = "151-156",
    doi = "10.1016/j.endm.2004.06.024",
    journal = "Electronic Notes in Discrete Mathematics",
    author = "Salinas, Luís C. and Hernández, Gonzalo"
}

{"_id":"cNPthJzW8286gQK5w","bibbaseid":"salinas-hernndez-largescalesimulationsofaneuralnetworkmodelforthegraphbisectionproblemongeometricallyconnectedgraphs-2004","downloads":0,"creationDate":"2017-04-03T15:16:25.881Z","title":"Large Scale Simulations of a Neural Network Model for the Graph Bisection Problem on Geometrically Connected Graphs","author_short":["Salinas, L. C.","Hernández, G."],"year":2004,"bibtype":"article","biburl":"https://1fichier.com/?yjj84y68k0","bibdata":{"bibtype":"article","type":"article","abstract":"In this work some preliminary numerical results obtained by large scale simulations of the sequential dynamics of a neural network model for the graph bisection problem on random geometrically connected graphs are presented. It can be concluded that the sequential dynamic is a low cost, effective and very fast local minima optimization heuristic for the Graph Bisection Problem. © 2005 Elsevier B.V. All rights reserved.","year":"2004","title":"Large Scale Simulations of a Neural Network Model for the Graph Bisection Problem on Geometrically Connected Graphs","volume":"18","keywords":"Geometrically Connected Graphs , Graph Bisection Problem , Neural Networks","pages":"151-156","doi":"10.1016/j.endm.2004.06.024","journal":"Electronic Notes in Discrete Mathematics","author":[{"propositions":[],"lastnames":["Salinas"],"firstnames":["Luís","C."],"suffixes":[]},{"propositions":[],"lastnames":["Hernández"],"firstnames":["Gonzalo"],"suffixes":[]}],"bibtex":"@article{10.1016/j.endm.2004.06.024,\n abstract = \"In this work some preliminary numerical results obtained by large scale simulations of the sequential dynamics of a neural network model for the graph bisection problem on random geometrically connected graphs are presented. It can be concluded that the sequential dynamic is a low cost, effective and very fast local minima optimization heuristic for the Graph Bisection Problem. © 2005 Elsevier B.V. All rights reserved.\",\n year = \"2004\",\n title = \"Large Scale Simulations of a Neural Network Model for the Graph Bisection Problem on Geometrically Connected Graphs\",\n volume = \"18\",\n keywords = \"Geometrically Connected Graphs , Graph Bisection Problem , Neural Networks\",\n pages = \"151-156\",\n doi = \"10.1016/j.endm.2004.06.024\",\n journal = \"Electronic Notes in Discrete Mathematics\",\n author = \"Salinas, Luís C. and Hernández, Gonzalo\"\n}\n\n","author_short":["Salinas, L. C.","Hernández, G."],"key":"10.1016/j.endm.2004.06.024","id":"10.1016/j.endm.2004.06.024","bibbaseid":"salinas-hernndez-largescalesimulationsofaneuralnetworkmodelforthegraphbisectionproblemongeometricallyconnectedgraphs-2004","role":"author","urls":{},"keyword":["Geometrically Connected Graphs","Graph Bisection Problem","Neural Networks"],"downloads":0},"search_terms":["large","scale","simulations","neural","network","model","graph","bisection","problem","geometrically","connected","graphs","salinas","hernández"],"keywords":["geometrically connected graphs","graph bisection problem","neural networks"],"authorIDs":[],"dataSources":["mqyNxb9twi6rYAXFv"]}