QUESTIONS & ANSWERS Right-sizing Bombers and People

被引：0
|
作者：
Ray, G. Timothy
机构：
来源：
Air Force Magazine | 2020年 / 103卷 / 05期
关键词：
D O I：
暂无
中图分类号：
学科分类号：
摘要：
引用
收藏
页码：8 / 9
相关论文
共 50 条
  • [41] Dynamic Right-Sizing for Power-Proportional Data Centers
    Lin, Minghong
    Wierman, Adam
    Andrew, Lachlan L. H.
    Thereska, Eno
    IEEE-ACM TRANSACTIONS ON NETWORKING, 2013, 21 (05) : 1378 - 1391
  • [42] Right questions, wrong answers
    不详
    CIVIL ENGINEERING, 1996, 66 (06): : 26 - 27
  • [43] Comment: Right-sizing adult neurology training for the child neurologist
    Pearl, Phillip L.
    NEUROLOGY, 2012, 79 (08) : 819 - 819
  • [44] Right-Sizing Adjuvant and Neoadjuvant Clinical Trials in Breast Cancer
    Berry, Donald A.
    CLINICAL CANCER RESEARCH, 2016, 22 (01) : 3 - 5
  • [45] CRED: Cloud Right-Sizing with Execution Deadlines and Data Locality
    Xu, Maotong
    Alamro, Sultan
    Lan, Tian
    Subramaniam, Suresh
    IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 2017, 28 (12) : 3389 - 3400
  • [46] Right-sizing Server Capacity Headroom for Global Online Services
    Verbowski, Chad
    Thayer, Ed
    Costa, Paolo
    Leather, Hugh
    Franke, Bjoern
    2018 IEEE 38TH INTERNATIONAL CONFERENCE ON DISTRIBUTED COMPUTING SYSTEMS (ICDCS), 2018, : 645 - 659
  • [47] RIGHT-SIZING CITIES IN THE UNITED STATES: DEFINING ITS STRATEGIES
    Hummel, Daniel
    JOURNAL OF URBAN AFFAIRS, 2015, 37 (04) : 397 - 409
  • [48] GETTING THE RIGHT ANSWERS BY ASKING THE RIGHT QUESTIONS
    FELDMAN, S
    ONLINE, 1995, 19 (01): : 105 - 105
  • [49] A Lightweight Model for Right-Sizing Master-Worker Applications
    Kremer-Herman, Nathaniel
    Tovar, Benjamin
    Thain, Douglas
    PROCEEDINGS OF THE INTERNATIONAL CONFERENCE FOR HIGH PERFORMANCE COMPUTING, NETWORKING, STORAGE, AND ANALYSIS (SC'18), 2018,
  • [50] Path Consolidation for Dynamic Right-Sizing of Data Center Networks
    Adnan, Muhammad Abdullah
    Gupta, Rajesh
    2013 IEEE SIXTH INTERNATIONAL CONFERENCE ON CLOUD COMPUTING (CLOUD 2013), 2013, : 581 - 588
12345