A PARTIALLY PERSISTENT DATA STRUCTURE FOR THE SET-UNION PROBLEM

被引：0
|
作者：
GAIBISSO, C
GAMBOSI, G
TALAMO, M
机构：
来源：
RAIRO-INFORMATIQUE THEORIQUE ET APPLICATIONS-THEORETICAL INFORMATICS AND APPLICATIONS | 1990年 / 24卷 / 02期
关键词：
D O I：
10.1051/ita/1990240201891
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
引用
收藏
页码：189 / 202
页数：14
相关论文
共 50 条
  • [21] Byzantine Set-Union Consensus using Efficient Set Reconciliation
    Dold, Florian
    Grothoff, Christian
    PROCEEDINGS OF 2016 11TH INTERNATIONAL CONFERENCE ON AVAILABILITY, RELIABILITY AND SECURITY, (ARES 2016), 2016, : 29 - 38
  • [22] Byzantine set-union consensus using efficient set reconciliation
    Dold F.
    Grothoff C.
    Grothoff, Christian (christian.grothoff@inria.fr), 1600, Springer International Publishing (2017)
  • [23] Exploring Initialization Strategies for Metaheuristic Optimization: Case Study of the Set-Union Knapsack Problem
    Garcia, Jose
    Leiva-Araos, Andres
    Crawford, Broderick
    Soto, Ricardo
    Pinto, Hernan
    MATHEMATICS, 2023, 11 (12)
  • [24] Estimation of Distribution Algorithm Based on Levy Flight for Solving the Set-Union Knapsack Problem
    Liu, Xue-Jing
    He, Yi-Chao
    IEEE ACCESS, 2019, 7 : 132217 - 132227
  • [25] The Local Branching as a Learning Strategy in the Evolutionary Algorithm: The Case of the Set-Union Knapsack Problem
    Dahmani, Isma
    Ferroum, Meriem
    Hifi, Mhand
    JOURNAL OF ADVANCES IN INFORMATION TECHNOLOGY, 2022, 13 (03) : 259 - 264
  • [26] Effect of Backtracking Strategy in Population-Based Approach: The Case of the Set-Union Knapsack Problem
    Dahmani, Isma
    Ferroum, Meriem
    Hifi, Mhand
    CYBERNETICS AND SYSTEMS, 2022, 53 (01) : 168 - 185
  • [27] An adaptive evolutionary search-based method for efficiently tackling the set-union knapsack problem
    Zhao, Juntao
    Hifi, Mhand
    INFORMATION SCIENCES, 2024, 676
  • [28] Binary Particle Swarm Optimization Based Hyper-Heuristic for Solving the Set-Union Knapsack Problem
    CHEN Xiang
    LUO Jinyan
    LIN Geng
    WuhanUniversityJournalofNaturalSciences, 2021, 26 (04) : 305 - 314
  • [29] Enhanced Moth Search Algorithm for the Set-Union Knapsack Problems
    Feng, Yanhong
    Yi, Jiao-Hong
    Wang, Gai-Ge
    IEEE ACCESS, 2019, 7 : 173774 - 173785
  • [30] The Importance of Transfer Function in Solving Set-Union Knapsack Problem Based on Discrete Moth Search Algorithm
    Feng, Yanhong
    An, Haizhong
    Gao, Xiangyun
    MATHEMATICS, 2019, 7 (01)
12345