Efficient stack distance computation for priority replacement policies

被引：0
|
作者：
Dep. Information Engineering, Università di Padova, Padova, Italy [1 ]
不详 [2 ]
机构：
来源：
Proc. ACM Int. Conf. Comput. Front., CF |
关键词：
Compendex;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
Trees (mathematics)
引用
收藏
相关论文
共 50 条
  • [1] Efficient Stack Distance Computation for Priority Replacement Policies
    Bilardi, Gianfranco
    Ekanadham, Kattamuri
    Pattnaik, Pratap
    PROCEEDINGS OF THE 2011 8TH ACM INTERNATIONAL CONFERENCE ON COMPUTING FRONTIERS (CF 2011), 2011,
  • [2] Efficient Stack Distance Computation for a Class of Priority Replacement Policies
    Bilardi, Gianfranco
    Ekanadham, Kattamuri
    Pattnaik, Pratap
    INTERNATIONAL JOURNAL OF PARALLEL PROGRAMMING, 2013, 41 (03) : 430 - 468
  • [3] Efficient Stack Distance Computation for a Class of Priority Replacement Policies
    Gianfranco Bilardi
    Kattamuri Ekanadham
    Pratap Pattnaik
    International Journal of Parallel Programming, 2013, 41 : 430 - 468
  • [4] Efficient distance computation in configuration space
    Zhang, Liangjun
    Kim, Young J.
    Manocha, Dinesh
    COMPUTER AIDED GEOMETRIC DESIGN, 2008, 25 (07) : 489 - 502
  • [5] Efficient Computation of the Tree Edit Distance
    Pawlik, Mateusz
    Augsten, Nikolaus
    ACM TRANSACTIONS ON DATABASE SYSTEMS, 2015, 40 (01):
  • [6] Efficient computation of the Euclidean distance transform
    Boxer, L
    Miller, R
    COMPUTER VISION AND IMAGE UNDERSTANDING, 2000, 80 (03) : 379 - 383
  • [7] Efficient Stack Distance Approximation Based on Workload Characteristics
    Lim, Sooyoung
    Park, Dongchul
    IEEE ACCESS, 2022, 10 : 59792 - 59805
  • [8] Efficient Action Computation for Compositional SDN Policies
    Pan, Heng
    Li, Zhenyu
    Xie, Gaogang
    He, Peng
    Guan, Hongtao
    Mathy, Laurent
    IEEE TRANSACTIONS ON NETWORK AND SERVICE MANAGEMENT, 2018, 15 (01): : 387 - 401
  • [9] Efficient distributed computation of distance sketches in networks
    Das Sarma, Atish
    Dinitz, Michael
    Pandurangan, Gopal
    DISTRIBUTED COMPUTING, 2015, 28 (05) : 309 - 320
  • [10] Efficient Computation of Pairwise Minimax Distance Measures
    Chehreghani, Morteza Haghir
    2017 17TH IEEE INTERNATIONAL CONFERENCE ON DATA MINING (ICDM), 2017, : 799 - 804
12345