搜索结果: 1-1 共查到“模糊数学 Communication Networks”相关记录1条 . 查询时间(0.084 秒)
Max-Flow Min-Cut Theorems for Communication Networks Based on Equational Logic
Max-Flow Min-Cut Theorems Communication Networks Equational Logic
2010/12/24
Traditionally, communication networks are modeled and analyzed in terms of information flows in
graphs. In this paper, we introduce a new symbolic approach to communication networks, where the topolo...