咨询与建议

限定检索结果

文献类型

  • 35 篇 期刊文献
  • 11 篇 会议

馆藏范围

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

日期分布

学科分类号

  • 42 篇 工学
    • 41 篇 计算机科学与技术...
    • 6 篇 软件工程
    • 4 篇 信息与通信工程
    • 3 篇 电子科学与技术(可...
    • 2 篇 电气工程
  • 12 篇 理学
    • 12 篇 数学
  • 1 篇 管理学
    • 1 篇 管理科学与工程(可...

主题

  • 46 篇 self-stabilizing...
  • 10 篇 distributed syst...
  • 5 篇 complexity
  • 4 篇 distributed algo...
  • 3 篇 graph algorithm
  • 3 篇 tree
  • 3 篇 maximal independ...
  • 2 篇 minimum spanning...
  • 2 篇 graphs
  • 2 篇 fault tolerance
  • 2 篇 shortest path pr...
  • 2 篇 graph
  • 2 篇 dominating set
  • 2 篇 wireless sensor ...
  • 2 篇 cut point
  • 2 篇 distributed demo...
  • 2 篇 2/3-approximatio...
  • 2 篇 undirected graph
  • 2 篇 fault-tolerant
  • 2 篇 maximum matching

机构

  • 4 篇 univ w indies de...
  • 3 篇 kuwait univ dept...
  • 3 篇 clemson univ sch...
  • 2 篇 univ bergen n-50...
  • 2 篇 yuan ze univ dep...
  • 2 篇 yuan ze univ dep...
  • 2 篇 southern wesleya...
  • 1 篇 yuan ze univ dep...
  • 1 篇 univ paris cite ...
  • 1 篇 univ lyon liris ...
  • 1 篇 univ lyon 1 f-69...
  • 1 篇 natl taichung un...
  • 1 篇 sorbonne univ cn...
  • 1 篇 conservatoire na...
  • 1 篇 univ caribe dept...
  • 1 篇 univ paris 06 so...
  • 1 篇 univ wisconsin d...
  • 1 篇 univ lyon 1 lab ...
  • 1 篇 yuan ze univ dep...
  • 1 篇 cicese dept comp...

作者

  • 7 篇 chaudhuri p
  • 4 篇 huang tc
  • 4 篇 huang tetz c.
  • 4 篇 tixeuil sebastie...
  • 3 篇 chen da-ren
  • 3 篇 wang cheng-pin
  • 3 篇 thompson h
  • 3 篇 lin ji-cherng
  • 3 篇 kheddouci hamama...
  • 2 篇 pilard laurence
  • 2 篇 mjelde morten
  • 2 篇 haddad mohammed
  • 2 篇 lin jc
  • 2 篇 kennedy k. e.
  • 2 篇 chen chih-yuan
  • 2 篇 srimani pk
  • 2 篇 blin lelia
  • 2 篇 hsu ming-yang
  • 2 篇 manne fredrik
  • 2 篇 hedetniemi steph...

语言

  • 43 篇 英文
  • 3 篇 其他
检索条件"主题词=Self-Stabilizing Algorithm"
46 条 记 录,以下是31-40 订阅
排序:
Short correctness proofs for two self-stabilizing algorithms under the distributed daemon model
收藏 引用
DISCRETE APPLIED MATHEMATICS 2009年 第1期157卷 140-148页
作者: Lin, Ji-Cherng Chiu, Ming-Yi Yuan Ze Univ Dept Comp Sci & Engn Chungli 320 Tao Yuan Taiwan
The distributed daemon model introduced by Burns in 1987 is a natural generalization of the central daemon model introduced by Dijkstra in 1974. In this paper, we show that a well-known shortest path algorithm is self... 详细信息
来源: 评论
A self-stabilizing 2/3-Approximation algorithm for the Maximum Matching Problem
A Self-stabilizing 2/3-Approximation Algorithm for the Maxim...
收藏 引用
10th International Symposium on Stabilization, Safety and Security of Distributed Systems (SSS 2008)
作者: Manne, Fredrik Mjelde, Morten Pilard, Laurence Tixeuil, Sebastien Univ Bergen N-5020 Bergen Norway Univ Franche Comte Besancon France Univ Paris 06 LIP6 & INRIA Grand Larg Paris France
The matching problem asks for a large set of disjoint edges in a graph. It is a problem that has received considerable attention in both the sequential and self-stabilizing literature. Previous work has resulted in se... 详细信息
来源: 评论
A self-stabilizing algorithm for the shortest path problem assuming read/write atomicity
收藏 引用
JOURNAL OF COMPUTER AND SYSTEM SCIENCES 2005年 第1期71卷 70-85页
作者: Huang, TC Yuan Ze Univ Dept Comp Engn & Sci Taoyuan 32026 Taiwan
Shortest path finding has a variety of applications in the areas of transportation and communication in distributed systems. In this paper, we design and prove the correctness of a self-stabilizing algorithm that solv... 详细信息
来源: 评论
A self-stabilizing algorithm for the shortest path problem assuming the distributed demon
收藏 引用
COMPUTERS & MATHEMATICS WITH APPLICATIONS 2005年 第5-6期50卷 671-681页
作者: Huang, TC Yuan Ze Univ Dept Comp Engn & Sci Taoyuan 320 Taiwan
Shortest path finding has a variety of applications in transportation and communication. In this paper, we study a well-known self-stabilizing algorithm for the shortest path problem for the distributed systems. The p... 详细信息
来源: 评论
A self-stabilizing algorithm for the center-finding problem assuming read/write separate atomicity
收藏 引用
COMPUTERS & MATHEMATICS WITH APPLICATIONS 2004年 第10-11期48卷 1667-1676页
作者: Huang, TC Lin, JC Mou, N Yuan Ze Univ Dept Comp Engn & Sci Taoyuan 32026 Taiwan
The problem of locating centers of graphs has a variety of applications in the areas of transportation and communication in distributed systems. In this paper, we design and prove the correctness of a self-stabilizing... 详细信息
来源: 评论
A self-stabilizing graph algorithm: Finding the cutting center of a tree
收藏 引用
INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS 2004年 第2期81卷 183-190页
作者: Chaudhuri, P Thompson, H Univ W Indies Dept Comp Sci Math & Phys Bridgetown Barbados
The cutting number of a node i in a connected graph G is the number of pairs of nodes in different components of G-{i}. The cutting center consists of the set of nodes of G with maximal cutting number. This article pr... 详细信息
来源: 评论
A self-stabilizing distributed algorithm for the Steiner tree problem
收藏 引用
IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS 2004年 第2期E87D卷 299-307页
作者: Kamei, S Kakugawa, H Hiroshima Univ Dept Informat Engn Higashihiroshima 7398527 Japan
self-stabilization is a theoretical framework of non-masking fault-tolerant distributed algorithms. In this paper, we investigate the Steiner tree problem in distributed systems, and propose a self-stabilizing heurist... 详细信息
来源: 评论
A self-stabilizing algorithm for finding the cutting center of a tree
A self-stabilizing algorithm for finding the cutting center ...
收藏 引用
International Conference on Parallel and Distributed Processing Techniques and Applications
作者: Chaudhuri, P Thompson, H Univ W Indies Dept Comp Sci Math & Phys Bridgetown Barbados
The cutting number of a node i in a connected graph G is the number of pairs of nodes in different components of G - {i}. The cutting center consists of the set of nodes of G with maximal cutting number. This paper pr... 详细信息
来源: 评论
self-stabilizing tree ranking
收藏 引用
INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS 2005年 第5期82卷 529-539页
作者: Chaudhuri, P Thompson, H Univ W Indies Dept Comp Sci Math & Phys Bridgetown Barbados
Given a graph G and some property p(g), a p-ranking (ordering) of the nodes of G can be defined as a one-to-one function from V to {1, 2, 3, ..., n} such that property p(G) holds for each node i is an element of V. In... 详细信息
来源: 评论
A self-stabilizing algorithm for the shortest path problem in a distributed system
收藏 引用
COMPUTERS & MATHEMATICS WITH APPLICATIONS 2002年 第1-2期43卷 103-109页
作者: Huang, TC Lin, JC Yuan Ze Univ Dept Comp Engn & Sci Chung Li Taoyuan 32026 Taiwan
In this paper, we propose a self-stabilizing algorithm for finding shortest paths in a distributed system in which a central daemon is assumed. The correctness of the proposed algorithm is proved by using the bounded ... 详细信息
来源: 评论