CSpace

浏览/检索结果: 共5条,第1-5条 帮助

限定条件    
已选(0)清除 条数/页:   排序方式:
Bounding Residence Times for Atomic Dynamic Routings 期刊论文
MATHEMATICS OF OPERATIONS RESEARCH, 2022, 页码: 22
作者:  Cao, Zhigang;  Chen, Bo;  Chen, Xujin;  Wang, Changjun
收藏  |  浏览/下载:69/0  |  提交时间:2023/02/07
atomic dynamic routing  residence time  token technique  selfish routing  Nash equilibrium  
Passive Controller Realization of a Biquadratic Impedance With Double Poles and Zeros as a Seven-Element Series-Parallel Network for Effective Mechanical Control 期刊论文
IEEE TRANSACTIONS ON AUTOMATIC CONTROL, 2018, 卷号: 63, 期号: 9, 页码: 3010-3015
作者:  Wang, Kai;  Chen, Michael Z. Q.;  Li, Chanying;  Chen, Guanrong
收藏  |  浏览/下载:128/0  |  提交时间:2018/10/07
Biquadratic impedance  inerter  passive mechanical control  passive network synthesis  series-parallel network  
Passive Controller Realization of a Biquadratic Impedance With Double Poles and Zeros as a Seven-Element Series-Parallel Network for Effective Mechanical Control 期刊论文
IEEE TRANSACTIONS ON AUTOMATIC CONTROL, 2018, 卷号: 63, 期号: 9, 页码: 3010-3015
作者:  Wang, Kai;  Chen, Michael Z. Q.;  Li, Chanying;  Chen, Guanrong
收藏  |  浏览/下载:134/0  |  提交时间:2018/10/07
Biquadratic impedance  inerter  passive mechanical control  passive network synthesis  series-parallel network  
Network Characterizations for Excluding Braess's Paradox 期刊论文
THEORY OF COMPUTING SYSTEMS, 2016, 卷号: 59, 期号: 4, 页码: 747-780
作者:  Chen, Xujin;  Diao, Zhuo;  Hu, Xiaodong
收藏  |  浏览/下载:134/0  |  提交时间:2018/07/30
Nonatomic selfish routing  Braess's paradox  Single-commodity network  Multcommodity network  Series-parallel graph  
Risk Models for the Prize Collecting Steiner Tree Problems with Interval Data 期刊论文
ACTA MATHEMATICAE APPLICATAE SINICA-ENGLISH SERIES, 2014, 卷号: 30, 期号: 1, 页码: 1-26
作者:  AlvarezMiranda Eduardo;  CandiaVejar Alfredo;  Chen Xujin;  Hu Xiaodong;  Li Bi
收藏  |  浏览/下载:96/0  |  提交时间:2021/01/14
SERIES-PARALLEL GRAPHS  SHORTEST-PATH PROBLEM  COMPUTATIONAL-COMPLEXITY  NETWORK  OPTIMIZATION  CONSTRAINTS  ALGORITHMS  FLOWS  uncertainty modeling  prize collecting Steiner tree  interval data  series-parallel graphs  polynomial-time solvability