खोज परिणाम - "NP-hard problems."

  • प्रदर्शित 1 - 6 परिणाम 6
परिणाम को परिष्कृत करें
  1. 1

    Unification of scheduling, binding, and retiming to reduce power consumption under timings and resources constraints. द्वारा Chabini, N.

    में प्रकाशित IEEE Transactions on VLSI systems
    लेख


    कवर छवि
  2. 2

    Firefly-simulated annealing (F-SA) algorithm for continuous constrained optimization द्वारा Garillos, Cinmayii Abarsolo

    प्रकाशित 2011
    थीसिस


    कवर छवि
  3. 3

    Reducing dynamic power consumption in synchronous sequential digital designs using retiming and supply voltage scaling. द्वारा Chabini, N.

    में प्रकाशित IEEE Transactions on VLSI systems
    लेख


    कवर छवि
  4. 4

    Multiuser detection in CDMA - a comparison of relaxations, exact, and heuristic search methods. द्वारा Peng Hui Tan

    में प्रकाशित IEEE Transactions on wireless communications
    लेख


    कवर छवि
  5. 5

    Constrained maximum-likelihood detection in CDMA. द्वारा Peng Hui Tan

    में प्रकाशित IEEE Transactions on communications
    लेख


    कवर छवि
  6. 6

    Formulating SoC test scheduling as a network transportation problem. द्वारा Koranne, S.

    लेख


    कवर छवि

खोज साधन: