A Conflict-aware Divide-and-Conquer Algorithm for Symmetric Sparse Matrix-Vector Multiplication
收藏相关数据集
Sensitivity of computation time to the route split and sample size.
Sensitivity of computation time to the route split and sample size.
NIAID Data Ecosystem90
Convergence time and hit rate results for continuous, FMS and SLE problems through static, preprogrammed (external) and constant (internal) lattice reconfiguration with binary tournament local selection.
Convergence time and hit rate results for continuous, FMS and SLE problems through static, preprogrammed (external) and constant (internal) lattice reconfiguration with binary tournament local selecti
Figshare2015-12-02 更新60
Quasi-Newton Acceleration of EM and MM Algorithms via Broyden’s Method
The principle of majorization-minimization (MM) provides a general framework for eliciting effective algorithms to solve optimization problems. However, the resulting methods often suffer from slow co
Taylor & Francis Group2023-09-15 更新40
Fuzzy optimization model for electric vehicle routing problem with time windows and recharging stations
This is the experimental data of the manuscript entitled "fuzzy optimization model for electric vehicle routing problem with time windows and recharging stations". All data are saved in the file with
DataCite Commons2020-08-27 更新70
Geração de cronograma para operação de sistema de abastecimento de água intermitente com distribuição equitativa
O trabalho desenvolvido propôs um método de operação de sistemas de abastecimento de água visando a equidade mesmo em situações de escassez hídricas. Para testar a automação proposta foi criada uma ba
DataCite Commons2025-05-16 更新50
