بدائل البحث:
location algorithm » selection algorithm (توسيع البحث), encryption algorithm (توسيع البحث), correction algorithm (توسيع البحث)
model optimization » codon optimization (توسيع البحث), global optimization (توسيع البحث), based optimization (توسيع البحث)
source location » resource allocation (توسيع البحث), source localization (توسيع البحث), source pollution (توسيع البحث)
binary data » primary data (توسيع البحث), dietary data (توسيع البحث)
data source » data sources (توسيع البحث)
binary wave » binary image (توسيع البحث)
wave model » naive model (توسيع البحث), game model (توسيع البحث), base model (توسيع البحث)
location algorithm » selection algorithm (توسيع البحث), encryption algorithm (توسيع البحث), correction algorithm (توسيع البحث)
model optimization » codon optimization (توسيع البحث), global optimization (توسيع البحث), based optimization (توسيع البحث)
source location » resource allocation (توسيع البحث), source localization (توسيع البحث), source pollution (توسيع البحث)
binary data » primary data (توسيع البحث), dietary data (توسيع البحث)
data source » data sources (توسيع البحث)
binary wave » binary image (توسيع البحث)
wave model » naive model (توسيع البحث), game model (توسيع البحث), base model (توسيع البحث)
-
1
-
2
-
3
Data_Sheet_1_Pneumonia detection by binary classification: classical, quantum, and hybrid approaches for support vector machine (SVM).pdf
منشور في 2024"…A support vector machine (SVM) is attractive because binary classification can be represented as an optimization problem, in particular as a Quadratic Unconstrained Binary Optimization (QUBO) model, which, in turn, maps naturally to an Ising model, thereby making annealing—classical, quantum, and hybrid—an attractive approach to explore. …"
-
4
MCLP_quantum_annealer_V0.5
منشور في 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. …"
-
5
Min-Cut/Max-Flow Problem Instances for Benchmarking
منشور في 2022"…</p> </li></ul> </li></ul> </div><div><p>The reason for releasing this collection is to provide a single place download all datasets used in our paper (and various previous paper) instead of having to scavenge from multiple sources. Furthermore, several of the problem instances typically used for benchmarking min-cut/max-flow algorithms are no longer available at their original locations and may be difficult to find. …"