“Chenghao”的版本间的差异
（更改可见性） |
（更改可见性） |
||
| 第58行： | 第58行： | ||
*'''Cheng h''', Zhang l, Zhang y, Wu J, Wang C. Optimal Constraint Collection for Core-selecting Path Mechanism[C]. In ''Proceedings of AAMAS.'' Stockholm, Sweden, 2018. [[https://dl.acm.org/citation.cfm?id=3237383.3237397 链接]]. | *'''Cheng h''', Zhang l, Zhang y, Wu J, Wang C. Optimal Constraint Collection for Core-selecting Path Mechanism[C]. In ''Proceedings of AAMAS.'' Stockholm, Sweden, 2018. [[https://dl.acm.org/citation.cfm?id=3237383.3237397 链接]]. | ||
*'''Cheng, H'''., Zhang, W., Zhang, Y'''.''', Zhang, L., Wu, J., & Wang, C. (2020). Fast core pricing algorithms for path auction. Autonomous Agents and Multi-Agent Systems, 34(1), 18.[pdf] | *'''Cheng, H'''., Zhang, W., Zhang, Y'''.''', Zhang, L., Wu, J., & Wang, C. (2020). Fast core pricing algorithms for path auction. Autonomous Agents and Multi-Agent Systems, 34(1), 18.[pdf] | ||
| − | *Zhang, Y'''.''', Zeng, C., '''Cheng, H'''., Wang, C., & Zhang, L. (2019, July). Many could be better than all: A novel instance-oriented algorithm for Multi-modal Multi-label problem. In 2019 IEEE International Conference on Multimedia and Expo (ICME) (pp. 838-843). IEEE. | + | *Zhang, Y'''.''', Zeng, C., '''Cheng, H'''., Wang, C., & Zhang, L. (2019, July). Many could be better than all: A novel instance-oriented algorithm for Multi-modal Multi-label problem. In 2019 IEEE International Conference on Multimedia and Expo (ICME) (pp. 838-843). IEEE. |
| + | <div class="bshare-custom"><a title="分享到QQ空间" class="bshare-qzone"></a><a title="分享到新浪微博" class="bshare-sinaminiblog"></a><a title="分享到人人网" class="bshare-renren"></a><a title="分享到腾讯微博" class="bshare-qqmb"></a><a title="分享到网易微博" class="bshare-neteasemb"></a><a title="更多平台" class="bshare-more bshare-more-icon more-style-addthis"></a><span class="BSHARE_COUNT bshare-share-count">0</span></div> | ||
| + | <script type="text/javascript" charset="utf-8" src="[http://static.bshare.cn/b/buttonLite.js#style=-1&uuid=&pophcol=1&lang=zh http://static.bshare.cn/b/buttonLite.js#style=-1&uuid=&pophcol=1&lang=zh]"></script><script type="text/javascript" charset="utf-8" src="[http://static.bshare.cn/b/bshareC0.js http://static.bshare.cn/b/bshareC0.js]"></script> | ||
2020年3月27日 (五) 11:28的版本
|
PhD Candidate @ IIP Group
Email: njuchengh@163.com | |
Supervisor
Professor Chong-Jun Wang
Biography
I received my B.Sc. degree in of Nanjing University in June 2017. In the same year, I was admitted to study for a Phd degree in Nanjing University without entrance examination.
Currently I am a first year PhD student of Department of Computer Science and Technology in Nanjing University and a member of IIP Group, led by professor Jun-Yuan Xie and Chong-Jun Wang.
Research Interest
I am interested in Machine Learning and Mechanism design. Currently I am focusing on the subfields:
- path auctions
- adversarial attack
Award or honor
- National Scholarship for Encouragement 2016
- Principal Special Freshman Scholarship 2017
- Artificial Intelligence Scholarship 2018
- First-Class Doctoral Excellence Scholarship of Nanjing University 2019
meetings
Publications
- Cheng h, Zhang l, Zhang y, Wu J, Wang C. Optimal Constraint Collection for Core-selecting Path Mechanism[C]. In Proceedings of AAMAS. Stockholm, Sweden, 2018. [链接].
- Cheng, H., Zhang, W., Zhang, Y., Zhang, L., Wu, J., & Wang, C. (2020). Fast core pricing algorithms for path auction. Autonomous Agents and Multi-Agent Systems, 34(1), 18.[pdf]
- Zhang, Y., Zeng, C., Cheng, H., Wang, C., & Zhang, L. (2019, July). Many could be better than all: A novel instance-oriented algorithm for Multi-modal Multi-label problem. In 2019 IEEE International Conference on Multimedia and Expo (ICME) (pp. 838-843). IEEE.
<script type="text/javascript" charset="utf-8" src="http://static.bshare.cn/b/buttonLite.js#style=-1&uuid=&pophcol=1&lang=zh"></script><script type="text/javascript" charset="utf-8" src="http://static.bshare.cn/b/bshareC0.js"></script>
