EFFICIENT COMPUTATION OF OPTIMAL ASSIGNMENTS FOR DISTRIBUTED TASKS

被引：68
|
作者：
SINCLAIR, JB
机构：
来源：
JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING | 1987年 / 4卷 / 04期
关键词：
D O I：
10.1016/0743-7315(87)90024-4
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
引用
收藏
页码：342 / 362
页数：21
相关论文
共 50 条
  • [1] Efficient computation of optimal actions
    Todorov, Emanuel
    [J]. PROCEEDINGS OF THE NATIONAL ACADEMY OF SCIENCES OF THE UNITED STATES OF AMERICA, 2009, 106 (28) : 11478 - 11483
  • [2] Efficient gossip and robust distributed computation
    Georgiou, C
    Kowalski, DR
    Shvartsman, AA
    [J]. DISTRIBUTED COMPUTING, PROCEEDINGS, 2003, 2848 : 224 - 238
  • [3] Efficient and Adaptive Distributed Skyline Computation
    Valkanas, George
    Papadopoulos, Apostolos N.
    [J]. SCIENTIFIC AND STATISTICAL DATABASE MANAGEMENT, 2010, 6187 : 24 - +
  • [4] Efficient gossip and robust distributed computation
    Georgiou, C
    Kowalski, DR
    Shvartsman, AA
    [J]. THEORETICAL COMPUTER SCIENCE, 2005, 347 (1-2) : 130 - 166
  • [5] Efficient Computation of Weapon-Target Assignments Using Abstraction
    Elliott, D. Sawyer
    Vatsan, Maansi
    [J]. IEEE CONTROL SYSTEMS LETTERS, 2023, 7 : 3717 - 3722
  • [6] Efficient Computation of the Characteristic Polynomial of a Tree and Related Tasks
    Martin Fürer
    [J]. Algorithmica, 2014, 68 : 626 - 642
  • [7] On Optimal Embeddings for Distributed Computation of Arbitrary Functions
    Vyavahare, Pooja
    Shetty, Akhil
    [J]. 2014 INTERNATIONAL CONFERENCE ON SIGNAL PROCESSING AND COMMUNICATIONS (SPCOM), 2014,
  • [8] Efficient Computation of the Characteristic Polynomial of a Tree and Related Tasks
    Fuerer, Martin
    [J]. ALGORITHMS - ESA 2009, PROCEEDINGS, 2009, 5757 : 11 - 22
  • [9] Efficient Computation of the Characteristic Polynomial of a Tree and Related Tasks
    Fuerer, Martin
    [J]. ALGORITHMICA, 2014, 68 (03) : 626 - 642
  • [10] Efficient distributed execution of computationally intensive tasks
    Meliones, AN
    Barosan, I
    Varvarigou, TT
    [J]. HIGH-PERFORMANCE COMPUTING AND NETWORKING, 1998, 1401 : 262 - 273
12345