咨询与建议

限定检索结果

文献类型

  • 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 篇 cheng-pin wang
  • 2 篇 chih-yuan chen
  • 2 篇 srimani pk
  • 2 篇 blin lelia
  • 2 篇 tetz c. huang

语言

  • 43 篇 英文
  • 3 篇 其他
检索条件"主题词=Self-Stabilizing Algorithm"
46 条 记 录,以下是21-30 订阅
排序:
A self-stabilizing algorithm for a Maximal 2-Packing in a Cactus Graph Under Any Scheduler
收藏 引用
INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE 2017年 第8期28卷 1021-1045页
作者: Antonio Trejo-Sanchez, Joel Alberto Fernandez-Zepeda, Jose Cesar Ramirez-Pacheco, Julio Ctr Invest Matemat AC CONACYT CIMAT Merida Merida 97032 Yucatan Mexico CICESE Dept Comp Sci Carretera Ensenada Tijuana 3918 Ensenada 22860 Baja California Mexico Univ Caribe Dept Basic Sci SM 78Mza 1Lote 1 Cancun 77528 QR Mexico
In this paper, we present a self-stabilizing algorithm that computes a maximal 2-packing set in a cactus under the adversarial scheduler. The cactus is a network topology such that any edge belongs to at most one cycl... 详细信息
来源: 评论
A self-stabilizing algorithm for finding a minimal positive influence dominating set in social networks  13
A self-stabilizing algorithm for finding a minimal positive ...
收藏 引用
Proceedings of the Twenty-Fourth Australasian Database Conference - Volume 137
作者: Guangyuan Wang Hua Wang Xiaohui Tao Ji Zhang University of Southern Queensland QLD Australia
Online social network has developed significantly in recent years. Most of current research has utilized the property of online social network to spread information and ideas. Motivated by applications in social netwo... 详细信息
来源: 评论
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 TO CONSTRUCT AN ARBITRARY SPANNING TREE OF A CONNECTED GRAPH
收藏 引用
COMPUTERS & MATHEMATICS WITH APPLICATIONS 1995年 第9期30卷 1-7页
作者: ANTONOIU, G SRIMANI, PK COLORADO STATE UNIV DEPT COMP SCIFT COLLINSCO 80523
We propose a simple self-stabilizing distributed algorithm that maintains an arbitrary spanning tree in a connected graph. In proving the correctness of the algorithm, we develop a new technique without using a bounde... 详细信息
来源: 评论
A self-stabilizing Marching algorithm for a Group of Oblivious Robots
A Self-stabilizing Marching Algorithm for a Group of Oblivio...
收藏 引用
12th International Conference on Principles of Distributed Systems
作者: Asahiro, Yuichi Fujita, Satoshi Suzuki, Ichiro Yamashita, Masafumi Kyushu Sangyo Univ Fac Informat Sci Dept Social Informat Syst Higashi Ku 2-3-1 Matsukadai Fukuoka 8138503 Japan Hiroshima Univ Dept Elect Engn Fac Engn Hiroshima 7398527 Japan Univ Wisconsin Dept Elect Engn & Comp Sci Milwaukee WI 53201 USA Kyushu Univ Dept Comp Sci & Commun Engn Nishi Ku Fukuoka 8190395 Japan
We propose a self-stabilizing marching algorithm for a group of oblivious robots in an obstacle-free workplace. To this end, we develop a distributed algorithm for a group of robots to transport a polygonal object, wh... 详细信息
来源: 评论
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... 详细信息
来源: 评论
self-stabilizing algorithms for minimal dominating sets and maximal independent sets
收藏 引用
COMPUTERS & MATHEMATICS WITH APPLICATIONS 2003年 第5-6期46卷 805-811页
作者: Hedetniemi, SM Hedetniemi, ST Jacobs, DP Srimani, PK Clemson Univ Dept Comp Sci Clemson SC 29634 USA
In the self-stabilizing algorithmic paradigm for distributed computation, each node has only a local view of the system, yet in a finite amount of time, the system converges to a global state satisfying some desired p... 详细信息
来源: 评论
self-stabilizing algorithmS FOR UNFRIENDLY PARTITIONS INTO TWO DISJOINT DOMINATING SETS
收藏 引用
PARALLEL PROCESSING LETTERS 2013年 第1期23卷
作者: Hedetniemi, Sandra M. Hedetniemi, Stephen T. Kennedy, K. E. McRae, Alice A. Clemson Univ Sch Comp Clemson SC 29634 USA Southern Wesleyan Univ Dept Comp Sci Central SC 29630 USA Appalachian State Univ Dept Comp Sci Boone NC 28608 USA
An unfriendly partition is a partition of the vertices of a graph G = (V,E) into two sets, say Red R(V) and Blue B(V), such that every Red vertex has at least as many Blue neighbors as Red neighbors, and every Blue ve... 详细信息
来源: 评论
A self-stabilizing 2/3-approximation algorithm for the maximum matching problem
收藏 引用
THEORETICAL COMPUTER SCIENCE 2011年 第40期412卷 5515-5526页
作者: Manne, Fredrik Mjelde, Morten Pilard, Laurence Tixeuil, Sebastien Univ Bergen N-5020 Bergen Norway Univ Franche Comte F-25030 Besancon France Univ Paris 06 LIP6 F-75252 Paris 05 France Univ Paris 06 INRIA Grand Large F-75252 Paris 05 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 the self-stabilizing literature. Previous work has resulted i... 详细信息
来源: 评论
A self-stabilizing DISTRIBUTED APPROXIMATION algorithm FOR THE MINIMUM CONNECTED DOMINATING SET
收藏 引用
INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE 2010年 第3期21卷 459-476页
作者: Kamei, Sayaka Kakugawa, Hirotsugu Hiroshima Univ Dept Informat Engn Hiroshima 7398527 Japan Osaka Univ Dept Comp Sci Osaka 5608531 Japan
self-stabilization is a theoretical framework of non-masking fault-tolerant distributed algorithms. A self-stabilizing system tolerates any kind and any finite number of transient faults, such as message loss, memory ... 详细信息
来源: 评论