Suchergebnisse - "Binary quadratic programming problem"

  • Treffer 1 - 3 von 3
Treffer weiter einschränken
  1. 1

    A Low-Complexity High-Performance Preprocessing Algorithm for Multiuser Detection using Gold Sequences

    Autoren: Axehill, Daniel Hansson, Anders Gunnarsson, Fredrik

    Quelle: LiTH-ISY-R.

    Schlagwörter: Code division multiple access, Computational complexity, Error statistics, Interference suppression, Maximum likelihood detection, Multiuser detection, Quadratic programming, Sequences, CDMA channel models, Gold sequences, NP-hard problem, Binary quadratic programming problem, Bit error rate, Low cross correlation, Low-complexity high-performance preprocessing algorithm, Maximum likelihood problem, Optimal detector, Optimum multiuser detection problem, Parallel interference cancellation, Suboptimal detector, Successive interference cancellation, Time-synchronous users, TECHNOLOGY, TEKNIKVETENSKAP

    Dateibeschreibung: electronic

    Zugangs-URL: https://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-56156
    https://liu.diva-portal.org/smash/get/diva2:316942/FULLTEXT01.pdf

    View record in SwePub Nájsť tento článok vo Web of Science
    Zu den Favoriten
  2. 2

    Memetic Algorithms for the Unconstrained Binary Quadratic Programming Problem

    Autoren: Peter Merz Kengo Katayama The Pennsylvania State University CiteSeerX Archives

    Weitere Verfasser: Peter Merz Kengo Katayama The Pennsylvania State University CiteSeerX Archives

    Quelle: http://www-ra.informatik.uni-tuebingen.de/mitarb/pmerz/papers/bs-bqp.ps.gz.

    Schlagwörter: Unconstrained Binary Quadratic Programming Problem, Fitness Landscape Analysis, Evolutionary Algorithm, Local Search, Combinatorial Optimization

    Dateibeschreibung: application/postscript

    Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.2.6624

    Verfügbarkeit: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.2.6624
    http://www-ra.informatik.uni-tuebingen.de/mitarb/pmerz/papers/bs-bqp.ps.gz

    View record from BASE Nájsť tento článok vo Web of Science
    Zu den Favoriten
  3. 3

    An Iterated Greedy Algorithm for the Binary Quadratic Programming Problem / バイナリー2次計画問題に対する反復貪欲法

    Autoren: Fubito Toyama Jyuichi Miyamichi Kenji Shoji et al.

    Quelle: 電気学会論文誌Ｃ（電子・情報・システム部門誌） / IEEJ Transactions on Electronics, Information and Systems. 2010, 130(6):1089

    Nájsť tento článok vo Web of Science
    Zu den Favoriten

Suchwerkzeuge: