Showing 1 - 6 results of 6 for search '"NP-hard problems."', query time: 0.02s Refine Results
  1. 1

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

    Published 2011
    Thesis

    Firefly-simulated annealing (F-SA) algorithm for continuous constrained optimization
  2. 2

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

    Article

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

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

    Article

    Constrained maximum-likelihood detection in CDMA.
  4. 4

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

    Article

    Formulating SoC test scheduling as a network transportation problem.
  5. 5

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

    Article

    Reducing dynamic power consumption in synchronous sequential digital designs using retiming and supply voltage scaling.
  6. 6

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

    Article

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

Search Tools: