位置：成果数据库 > 期刊 > 期刊详情页
A Distributed Design for Minimum 2-Connected m-Dominating Set in Bidirectional Wireless Ad-Hoc Netwo
  • 期刊名称：Tsinghua Science and Technology
  • 时间：2012
  • 页码：553-566
  • 相关项目：M-可解性、M-计算复杂性与计算机科学的模型理论
作者： Xiaofeng Gao|Bosheng Xu|Jun Li|
同期刊论文项目
M-可解性、M-计算复杂性与计算机科学的模型理论
期刊论文 26 会议论文 51 获奖 5 著作 1
同项目期刊论文
弱偏伪度量空间的完备和双完备
Algebraic Data Retrieval Algorithms for Multi-Channel Wireless Data Broadcast
A Constant-Factor Approximation for d-Hop Connected Dominating Sets in Unit Disk Graph
On the Semantics of Markov Automata
Performance Analysis for Approximating MCDS in Wireless Ad-Hoc Network
Symbolic Bisimulation for Quantum Processes
Data-Driven Metaphor Recognition and Explanation
How faithfully can pi be interpreted in SA?
An Interpretation of Erlang into Value-passing Calculus
Process passing calculus, revisited
Real-Reward Testing for Probabilistic Processes
Compositional reasoning for weighted Markov decision processes
The Value-Passing Calculus
<span style="font-family:&quot;Arial&quot;,sans-serif;font-size:10.5pt;">Rel
<span style="color: black; font-family:;" calibri",sans-serif;font-size:11pt;"
How faithfully can &pi; be interpreted in SA?
The lambda-calculus in the pi-calculus
Consistency, optimality, and incompleteness
<span style="font-family:;" arial",sans-serif;font-size:10.5pt;"=""
A Polynomial Time Algorithm for Checking Regularity of Totally Normed Process Algebra
A Distributed Design for Minimum 2-Connected m-Dominating Set in Bidirectional Wireless Ad-Hoc Networks