相关数据集
Replication Data for: A Sleeping, Recovering Bandit Algorithm for Optimizing Recurring Notifications
Replication datasets (200 million rows) used in experiments by Yancey & Settles (2020).
DataONE2020-06-11 更新50
Instances for the ML-MRCPSP-Z.rar
Benchmark cases of the work titled: "Ant Colony Algorithms for minimizing costs in multi-mode resource constrained project scheduling problems with spatial constraints"
Mendeley Data2024-05-15 更新40
A Novel Drone Delivery Problem with Stochastic Arrival Time under Uncertain Wind Conditions for Last-mile Delivery Using Iterated Adaptive Tabu Search Algorithm
This is the experimental data of the manuscript entitled "A Novel Drone Delivery Problem with Stochastic Arrival Time under Uncertain Wind Conditions for Last-mile Delivery Using Iterated Adaptive Tab
DataCite Commons2025-01-05 更新40
NN DynaQ with prioritized sweeping and multiple predecessors
Figures illustrating the model, the task and the results of an neural network implementation of a DynaQ reinforcement learning algorithm with prioritized sweeping, in a case where a (state,action) cou
NIAID Data Ecosystem40
aime_backtracks_val
该数据集包含多个特征，如问题的提示、原始解决方案、步骤、正确性判断、数值序列、优势序列、回溯选择、最小/最大优势、最小/最大值、最小/最大pav、新解决方案、新正确性判断、当前响应、最佳响应、当前令牌数、总令牌数、ID、URL、目标答案、更新标志、数据索引和轮次等信息。数据集分为训练集，包含1036个样本，总大小为11561424字节。
Hugging Face2025-01-31 更新40
