QQ客服 官方微博 反馈留言

浏览/检索结果: 共3条，第1-3条 帮助 限定条件 专题：兰州大学    第一署名单位    第一作者单位    通讯作者单位     已选(0)清除 条数/页：5101520253035404550556065707580859095100   排序方式：请选择作者升序作者降序题名升序题名降序发表日期升序发表日期降序提交时间升序提交时间降序 SOFL-based dependency graph generation for scheduling 会议论文 11th Systems of Systems Engineering Conference, SoSE 2016, Kongsberg, Norway, June 12, 2016 - June 16, 2016 作者:  Cheng, Zhuo;  Zhang, Haitao;  Tan, Yasuo;  Lim, Yuto 收藏  |  浏览/下载：3/0  |  提交时间：2017/01/18 Formal specification  Computer control  Control systems  Cruise control  Formal methods  Scheduling  Specifications  Systems engineering  Dependency graphs  Feasible solution  Formal engineerings  Multi task system  Requirement specification  SOFL  Task dependencies   A case study: SOFL + Model checking for OSEK/VDX application 会议论文 5th International Workshop on Structured Object-Oriented Formal Language and Method, SOFL+MSVL 2015, Paris, France, November 6, 2015 - November 6, 2015 作者:  Cheng, Zhuo;  Zhang, Haitao;  Tan, Yasuo;  Lim, Yuto 收藏  |  浏览/下载：6/0  |  提交时间：2017/01/18 Formal specification  Automobiles  Computational linguistics  Computer control  Formal languages  Formal methods  Model checking  Specifications  Automotive applications  Development process  Feasible solution  Formal engineerings  High quality  Requirement specification   A new constant factor approximation for computing 3-connected m-dominating sets in homogeneous wireless networks 会议论文 IEEE INFOCOM 2010, San Diego, CA, United states, March 14, 2010 - March 19, 2010 作者:  Kim, Donghyun;  Wang, Wei;  Li, Xianyue;  Zhang, Zhao;  Wu, Weili 收藏  |  浏览/下载：3/0  |  提交时间：2017/01/20 Approximation algorithms  Computation theory  Polynomial approximation  Wireless networks  Approximation ratios  CdS  Connected Dominating Set  Constant factor approximation  Dominating sets  Feasible solution  K-connected  Polynomial time approximation algorithms  Quality fault  Unit disk graphs