咨询与建议

限定检索结果

文献类型

  • 3 篇 会议
  • 2 篇 期刊文献

馆藏范围

  • 5 篇 电子文献
  • 0 种 纸本馆藏

日期分布

学科分类号

  • 5 篇 工学
    • 5 篇 计算机科学与技术...
    • 1 篇 信息与通信工程
    • 1 篇 软件工程
  • 1 篇 理学
    • 1 篇 数学

主题

  • 5 篇 distributed appr...
  • 2 篇 graph algorithms
  • 2 篇 dynamic algorith...
  • 2 篇 distributed algo...
  • 2 篇 maximum matching
  • 1 篇 internet of thin...
  • 1 篇 distributed virt...
  • 1 篇 task offloading
  • 1 篇 bounded degree n...
  • 1 篇 matching
  • 1 篇 online games
  • 1 篇 peer-to-peer alg...
  • 1 篇 mobile cloud com...
  • 1 篇 random walks
  • 1 篇 dominating sets
  • 1 篇 edge computing
  • 1 篇 cloud computing
  • 1 篇 scheduling

机构

  • 2 篇 ben gurion univ ...
  • 1 篇 univ bordeaux bo...
  • 1 篇 inria bordeaux s...
  • 1 篇 technion israel ...
  • 1 篇 cnrs f-91405 ors...
  • 1 篇 univ paris 11 lr...
  • 1 篇 westpac inst ban...
  • 1 篇 tel aviv univ de...

作者

  • 2 篇 lotker zvi
  • 2 篇 patt-shamir boaz
  • 2 篇 rosen adi
  • 1 篇 hanusse nicolas
  • 1 篇 friedman roy
  • 1 篇 travers corentin
  • 1 篇 kogan alex
  • 1 篇 vittamsetti vija...
  • 1 篇 castanet tobias
  • 1 篇 ghosh subhas kum...
  • 1 篇 beaumont olivier

语言

  • 5 篇 英文
检索条件"主题词=distributed approximation algorithms"
5 条 记 录,以下是1-10 订阅
排序:
distributed Maximum Utility Task Offloading for Delay-Sensitive IoT Applications in Cloud and Edge Computing
收藏 引用
JOURNAL OF NETWORK AND SYSTEMS MANAGEMENT 2025年 第2期33卷 1-41页
作者: Ghosh, Subhas Kumar Vittamsetti, Vijay Monic Westpac Inst Bank Sydney NSW 2000 Australia
Task offloading in fog computing has emerged as a pivotal solution to address the computational constraints of IoT devices, particularly for delay-sensitive applications. This paper introduces a distributed algorithm ... 详细信息
来源: 评论
approximation Algorithm for Estimating Distances in distributed Virtual Environments  26th
Approximation Algorithm for Estimating Distances in Distribu...
收藏 引用
26th International Conference on Parallel and distributed Computing (Euro-Par)
作者: Beaumont, Olivier Castanet, Tobias Hanusse, Nicolas Travers, Corentin Univ Bordeaux Bordeaux INP CNRS LaBRIUMR5800 F-33400 Talence France Inria Bordeaux Sud Ouest 200 Ave Vieille Tour F-33405 Talence France
This article deals with the issue of guaranteeing properties in distributed Virtual Environments (DVEs) without a server. This issue is particularly relevant in the case of online games, that operate in a fully distri... 详细信息
来源: 评论
distributed APPROXIMATE MATCHING
收藏 引用
SIAM JOURNAL ON COMPUTING 2009年 第2期39卷 445-460页
作者: Lotker, Zvi Patt-Shamir, Boaz Rosen, Adi Ben Gurion Univ Negev Dept Commun Syst Engn IL-84105 Beer Sheva Israel Tel Aviv Univ Dept Elect Engn IL-69978 Tel Aviv Israel Univ Paris 11 LRI F-91405 Orsay France CNRS F-91405 Orsay France
We consider distributed algorithms for approximate maximum matching on general graphs. Our main result is a randomized (4 + epsilon)-approximation distributed algorithm for maximum weighted matching, whose running tim... 详细信息
来源: 评论
Brief Announcement: Deterministic Dominating Set Construction in Networks with Bounded Degree
Brief Announcement: Deterministic Dominating Set Constructio...
收藏 引用
29th ACM SIGACT-SIGOPS Symposium on Principles of distributed Computing
作者: Friedman, Roy Kogan, Alex Technion Israel Inst Technol Dept Comp Sci IL-32000 Haifa Israel
This paper considers the problem of calculating dominating sets in bounded degree networks. In these networks, the maximal degree of any node is bounded by delta, which is usually significantly smaller than n, the tot... 详细信息
来源: 评论
distributed Approximate Matching
Distributed Approximate Matching
收藏 引用
16th Annual ACM Symposium on Principles of distributed Computing
作者: Lotker, Zvi Patt-Shamir, Boaz Rosen, Adi Ben Gurion Univ Negev Dept Commun Syst Engn IL-84105 Beer Sheva Israel
We consider distributed algorithms for approximate maximum matching on general graphs. Our main result is a randomized (4 + epsilon)-approximation distributed algorithm for weighted maximum matching;whose running time... 详细信息
来源: 评论