Výsledky vyhľadávania - (("binary quadratic programming problem") OR ("Binary quadratic programming problemys"))

  • Zobrazené výsledky 1 - 3 z 3
Upresniť hľadanie
  1. 1

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

    Autori: Axehill, Daniel Hansson, Anders Gunnarsson, Fredrik

    Zdroj: LiTH-ISY-R.

    Predmety: 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

    Popis súboru: electronic

    Prístupová URL adresa: 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
    Pridať do obľúbených
  2. 2

    Memetic Algorithms for the Unconstrained Binary Quadratic Programming Problem

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

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

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

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

    Popis súboru: application/postscript

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

    Dostupnosť: 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
    Pridať do obľúbených
  3. 3

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

    Autori: Fubito Toyama Jyuichi Miyamichi Kenji Shoji a ďalší

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

    Nájsť tento článok vo Web of Science
    Pridať do obľúbených

Vyhľadávacie nástroje: