Showing 1 - 8 results of 8 for search '(( binary data feature maximization algorithm ) OR ( binary wave process optimization algorithm ))', query time: 0.91s Refine Results
  1. 1

    MCLP_quantum_annealer_V0.5 by Anonymous Anonymous (4854526)

    Published 2025
    “…Theoretical and applied experiments are conducted using four solvers: QBSolv, D-Wave Hybrid binary quadratic model 2, D-Wave Advantage system 4.1, and Gurobi. …”
  2. 2

    Contextual Dynamic Pricing with Strategic Buyers by Pangpang Liu (18886419)

    Published 2024
    “…In this process, buyers can also strategically manipulate their feature data to obtain a lower price, incurring certain manipulation costs. …”
  3. 3

    Supplementary Material 8 by Nishitha R Kumar (19750617)

    Published 2025
    “…</li><li><b>Naïve bayes (NB): </b> A probabilistic classifier based on Bayes' theorem, suitable for predicting resistance phenotypes based on genomic features.</li><li><b>Linear discriminant Analysis (LDA) is a statistica</b>l approach that maximizes class separability. …”
  4. 4

    Image1_Applying the Hubbard-Stratonovich Transformation to Solve Scheduling Problems Under Inequality Constraints With Quantum Annealing.TIF by Sizhuo Yu (11429743)

    Published 2021
    “…Its current hardware implementation relies on D-Wave’s Quantum Processing Units, which are limited in terms of number of qubits and architecture while being restricted to solving quadratic unconstrained binary optimization (QUBO) problems. …”
  5. 5

    Image3_Applying the Hubbard-Stratonovich Transformation to Solve Scheduling Problems Under Inequality Constraints With Quantum Annealing.TIF by Sizhuo Yu (11429743)

    Published 2021
    “…Its current hardware implementation relies on D-Wave’s Quantum Processing Units, which are limited in terms of number of qubits and architecture while being restricted to solving quadratic unconstrained binary optimization (QUBO) problems. …”
  6. 6

    Image2_Applying the Hubbard-Stratonovich Transformation to Solve Scheduling Problems Under Inequality Constraints With Quantum Annealing.TIF by Sizhuo Yu (11429743)

    Published 2021
    “…Its current hardware implementation relies on D-Wave’s Quantum Processing Units, which are limited in terms of number of qubits and architecture while being restricted to solving quadratic unconstrained binary optimization (QUBO) problems. …”
  7. 7

    DataSheet1_Applying the Hubbard-Stratonovich Transformation to Solve Scheduling Problems Under Inequality Constraints With Quantum Annealing.pdf by Sizhuo Yu (11429743)

    Published 2021
    “…Its current hardware implementation relies on D-Wave’s Quantum Processing Units, which are limited in terms of number of qubits and architecture while being restricted to solving quadratic unconstrained binary optimization (QUBO) problems. …”
  8. 8

    Adaptive Inference for Change Points in High-Dimensional Data by Yangfan Zhang (6451946)

    Published 2021
    “…On the estimation front, we obtain the convergence rate of the maximizer of our test statistic standardized by sample size when there is one change-point in mean and <i>q</i> = 2, and propose to combine our tests with a wild binary segmentation algorithm to estimate the change-point number and locations when there are multiple change-points. …”