A modified Hopfield Artificial Neural Network is proposed to solve effectively and efficiently Boolean Satisfiability (SAT) NP-hard problems. The proposed Neural Network is compared against other traditional methods employed in this field, such as Greedy SAT and Genetic Algorithms for SAT. The results show that the proposed network represents a good alternative given their output quality and response time speed.


    Zugriff

    Zugriff prüfen

    Verfügbarkeit in meiner Bibliothek prüfen

    Bestellung bei Subito €


    Exportieren, teilen und zitieren



    Titel :

    Modified Neural Net for the Boolean Satisfiability Problem


    Beteiligte:


    Erscheinungsdatum :

    2015-11-01


    Format / Umfang :

    149850 byte




    Medientyp :

    Aufsatz (Konferenz)


    Format :

    Elektronische Ressource


    Sprache :

    Englisch



    Allocation of avionics communication using Boolean satisfiability

    Carta, Daniela Cristina / de Oliveira, Jose Maria Parente / Starr, Rodrigo Rizzi | IEEE | 2012


    Allocation of avionics communication using Boolean satisfiability

    Carta, Daniela Cristina / de Oliveira, Jose Maria Parente / Starr, Rodrigo Rizzi et al. | IEEE | 2012



    A sharp threshold for the phase transition of a restricted Satisfiability problem for Horn clauses

    Dunne, P. E. / Bench-Capon, T. J. M. | British Library Online Contents | 2001


    Satisfiability and optimization in periodic traffic flow problems

    Großmann, Peter / Technische Universität Dresden | TIBKAT | 2016

    Freier Zugriff