咨询与建议

限定检索结果

文献类型

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

馆藏范围

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

日期分布

学科分类号

  • 3 篇 工学
    • 3 篇 计算机科学与技术...
    • 1 篇 电气工程
  • 1 篇 理学
    • 1 篇 数学
  • 1 篇 管理学
    • 1 篇 管理科学与工程(可...

主题

  • 3 篇 distributed loca...
  • 2 篇 graph algorithms
  • 2 篇 centralized loca...
  • 2 篇 maximum matching
  • 2 篇 maximum weighted...
  • 1 篇 complexity class...
  • 1 篇 sublinear approx...
  • 1 篇 randomized algor...

机构

  • 2 篇 tel aviv univ sc...
  • 1 篇 ben gurion univ ...
  • 1 篇 weizmann inst sc...
  • 1 篇 univ paris dider...
  • 1 篇 univ toronto dep...

作者

  • 2 篇 medina moti
  • 2 篇 ron dana
  • 2 篇 even guy
  • 1 篇 peleg david
  • 1 篇 korman amos
  • 1 篇 goeoes mika
  • 1 篇 fraigniaud pierr...
  • 1 篇 parter merav

语言

  • 3 篇 英文
检索条件"主题词=Distributed local algorithms"
3 条 记 录,以下是1-10 订阅
排序:
Best of two local models: Centralized local and distributed local algorithms
收藏 引用
INFORMATION AND COMPUTATION 2018年 第Part1期262卷 69-89页
作者: Even, Guy Medina, Moti Ron, Dana Tel Aviv Univ Sch Elect Engn IL-69978 Tel Aviv Israel Ben Gurion Univ Negev Dept Elect & Comp Engn IL-8410501 Beer Sheva Israel
We consider two models of computation: centralized local algorithms and local distributed algorithms. algorithms in one model are adapted to the other model to obtain improved algorithms. distributed vertex coloring i... 详细信息
来源: 评论
Randomized distributed decision
收藏 引用
distributed COMPUTING 2014年 第6期27卷 419-434页
作者: Fraigniaud, Pierre Goeoes, Mika Korman, Amos Parter, Merav Peleg, David Univ Paris Diderot CNRS Paris France Univ Toronto Dept Comp Sci Toronto ON Canada Weizmann Inst Sci IL-76100 Rehovot Israel
The paper tackles the power of randomization in the context of local distributed computing by analyzing the ability to "boost" the success probability of deciding a distributed language using a Monte-Carlo a... 详细信息
来源: 评论
distributed Maximum Matching in Bounded Degree Graphs  15
Distributed Maximum Matching in Bounded Degree Graphs
收藏 引用
16th International Conference on distributed Computing and Networking
作者: Even, Guy Medina, Moti Ron, Dana Tel Aviv Univ Sch Elect Engn IL-69978 Tel Aviv Israel
We present deterministic distributed algorithms for computing approximate maximum cardinality matchings and approximate maximum weight matchings. Our algorithm for the unweighted case computes a matching whose size is... 详细信息
来源: 评论