位置：成果数据库 > 期刊 > 期刊详情页
A revisit of fast greedy heuristics for mapping a class of independent tasks onto heterogeneous comp
  • ISSN号：0743-7315
  • 期刊名称：Journal of Parallel and Distributed Computing
  • 时间：0
  • 页码：695-714
  • 语言：英文
  • 相关项目：基于分类超曲面的覆盖分类算法与理论研究
作者： Luo, Ping|Shi, Zhongzhi|Lu, Kevin|
同期刊论文项目
基于分类超曲面的覆盖分类算法与理论研究
期刊论文 32 会议论文 39
同项目期刊论文
Information-Theoretic Distance Measures for Clustering Validation: Generalization and Normalization
基于混合正则化的无标签领域的归纳迁移学习
An Algorithm for Solving Rule-Sets Based Bilevel Decision
Coss-domain Learning From Multiple Sources: Consensus Regularization Perspective
Lower Bound for Quantum Integration Error on Anisotropic Sobolev Classes
QUANTUM COMPLEXITY OF THE APPROXIMATION FOR THE CLASSES B(Wr p([0, 1]d)) AND B(Hr p([0, 1]d))?
Optimal query error of quantum approximation on some Sobolev classes
Optimal integration error on anisotropic classes for restricted Monte Carlo and quantum algorithms
视频数据库的聚类索引方法
确定性信号的Poisson 过程与局部平均采样逼近
分类超曲面算法复杂度研究
基于覆盖的分类算法研究进展
基于轮廓的图像检索
集成视觉特征和语义信息的相关反馈方法
神经电路广义模糊逻辑骨架及其在视皮层神经系统模拟中的应用
Quick multi-objective evolutionary algorithm based on dominating tree
On defining partition entropy by inequalities
Quick emergency response plan generation system combining CBR and RBR
基于覆盖的分类学习算法研究进展
确定性信号的Poisson过程与局部平均采样逼近
基于路径匹配的在线分层强化学习方法
基于小波变换和ICA的运动目标分割
一种CBR与RBR相结合的快速预案生成系统
Inductive transfer learning for unlabeled target-domain via hybrid regularization
Greedy Algorithm in m-Term Approximation for Periodic Besov Class with Mixed Smoothness