Bilaketaren emaitzak - "NP-hard problem."

  • Erakusten 1 - 6 emaitzak -- 6
Findu emaitzak
  1. 1

    Reducing dynamic power consumption in synchronous sequential digital designs using retiming and supply voltage scaling. nork Chabini, N.

    Argitaratua izan da IEEE Transactions on VLSI systems
    Artikulua


    Azala
  2. 2

    Multiuser detection in CDMA - a comparison of relaxations, exact, and heuristic search methods. nork Peng Hui Tan

    Artikulua


    Azala
  3. 3

    Unification of scheduling, binding, and retiming to reduce power consumption under timings and resources constraints. nork Chabini, N.

    Argitaratua izan da IEEE Transactions on VLSI systems
    Artikulua


    Azala
  4. 4

    Firefly-simulated annealing (F-SA) algorithm for continuous constrained optimization nork Garillos, Cinmayii Abarsolo

    Argitaratua 2011
    Tesis


    Azala
  5. 5

    Constrained maximum-likelihood detection in CDMA. nork Peng Hui Tan

    Artikulua


    Azala
  6. 6

    Formulating SoC test scheduling as a network transportation problem. nork Koranne, S.

    Artikulua


    Azala

Bilaketa egiteko lanabesak: