官方服务：
资源简介：
对多头秤匹配算法进行运算分析，采用遗传算法、动态规划算法程序对多头秤秤斗数量和匹配成功率加以分析计算，优化选取多头秤的数量，得到源数据。
应用场景：
提供机构：
郑州大学创建时间：
2022-11-15
相关数据集
ivanjaenm/otdata_1M_rowwise_variableC
这是一个包含多个浮点数序列字段的数据集，用于训练和测试。数据集分为训练集和测试集，其中训练集包含800万个示例，测试集包含200万个示例。数据集的特征包括源距离、目标距离、输入成本矩阵、输入索引、输入总数、目标otplan密集解和目标otplan稀疏解。
Hugging Face2025-10-22 更新150
Branch and Bound algorithm application in works of Ukrainian scientists
This comparison highlights the application of the Branch and Bound method in various optimization problems across diverse fields, and papers are written by Ukrainian scientists and indexed in Scopus.
DataCite Commons2024-10-27 更新70
Communication-Efficient Distributed Sparse Learning with Oracle Property and Geometric Convergence*
This article introduces two highly efficient distributed non-convex sparse learning algorithms. Our approach accommodates non-convexity in both the loss function and penalty, acknowledging the potenti
Taylor & Francis Group2025-03-18 更新40
3SAT single-pair G-QAOA results
Here are the G-QAOA results for 3-SAT. The results are shown in the manuscript.The instance file is shown in order of m eaningless number/problem size/solution ratio/3SAT instance .The res
DataCite Commons2025-06-01 更新80
Data for "Heuristic algorithms in Evolutionary Computations and modular organization of biological macromolecules: applications to in vitro evolution"
This publication contains data for the construction of the figures and tables for the paper "Heuristic algorithms in Evolutionary Computations and modular organization of biological macromolecules: ap
Zenodo2021-11-16 更新40
