LAZY NARROWING IN A GRAPH MACHINE

被引:0
|
作者
MORENONAVARRO, JJ
KUCHEN, H
LOOGEN, R
RODRIGUEZARTALEJO, M
机构
[1] RHEIN WESTFAL TH AACHEN, LEHRSTUHL INFORMAT II, W-5100 AACHEN, GERMANY
[2] UNIV COMPLUTENSE MADRID, FAC CC MATEMAT, DEPT INFORMAT & AUTOMAT, E-28040 MADRID, SPAIN
关键词
D O I
暂无
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
引用
收藏
页码:298 / 317
页数:20
相关论文
共 50 条
  • [21] GENERATIONAL GARBAGE COLLECTION FOR LAZY GRAPH REDUCTION
    SEWARD, J
    LECTURE NOTES IN COMPUTER SCIENCE, 1992, 637 : 200 - 217
  • [22] A Lazy Approach for Machine Learning Algorithms
    Galvan, Ines M.
    Valls, Jose M.
    Lecomte, Nicolas
    Isasi, Pedro
    ARTIFICIAL INTELLIGENCE APPLICATIONS AND INNOVATIONS III, 2009, : 517 - 522
  • [23] A Lazy Approach for Machine Learning Algorithms
    Galván, Inés M.
    Valls, José M.
    Lecomte, Nicolas
    Isasi, Pedro
    IFIP Advances in Information and Communication Technology, 2009, 296 : 517 - 522
  • [24] Complete strategies for term graph narrowing
    Habel, A
    Plump, D
    RECENT TRENDS IN ALGEBRAIC DEVELOPMENT TECHNIQUES, 1999, 1589 : 152 - 167
  • [25] An abstract machine for parallel lazy evaluation
    Baker-Finch, C
    TRENDS IN FUNCTIONAL PROGRAMMING, 2000, : 153 - 161
  • [26] The Very Lazy λ-Calculus and the STEC Machine
    Rochel, Jan
    IMPLEMENTATION AND APPLICATION OF FUNCTIONAL LANGUAGES, 2009, 6041 : 198 - 217
  • [27] Laro: Lazy Repartitioning for Graph Workloads on Heterogeneous Clusters
    Sheng, Feng
    Cao, Qiang
    Cai, Haoran
    Yao, Jie
    Xie, Changsheng
    2017 IEEE 36TH INTERNATIONAL PERFORMANCE COMPUTING AND COMMUNICATIONS CONFERENCE (IPCCC), 2017,
  • [28] LAZY LOCAL SEARCH MEETS MACHINE SCHEDULING
    Annamalai, Chidambaram
    SIAM JOURNAL ON COMPUTING, 2019, 48 (05) : 1503 - 1543
  • [29] Online lazy bureaucrat scheduling with a machine deadline
    Gai, Ling
    Zhang, Guochuan
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2018, 35 (02) : 530 - 537
  • [30] Online lazy bureaucrat scheduling with a machine deadline
    Ling Gai
    Guochuan Zhang
    Journal of Combinatorial Optimization, 2018, 35 : 530 - 537