QQ客服 官方微博 反馈留言

	How Hard Is Bribery with Distance Restrictions?
	Yang, Yongjie; Shrestha, Yash Raj; Guo, Jiong
刊名	ECAI 2016: 22ND EUROPEAN CONFERENCE ON ARTIFICIAL INTELLIGENCE
	2016
卷号	285页码:363-371
DOI	10.3233/978-1-61499-672-9-363
会议名称	22nd European Conference on Artificial Intelligence (ECAI)
URL标识	查看原文
会议日期	AUG 29-SEP 02, 2016
内容类型	期刊论文
URI标识	http://www.corc.org.cn/handle/1471x/4702681
专题	山东大学
作者单位	1.Shandong Univ, Jinan, Peoples R China. 2.Univ Saarland, D-66123 Saarbrucken, Germany. 3.[Shrestha, Yash
推荐引用方式 GB/T 7714	Yang, Yongjie,Shrestha, Yash Raj,Guo, Jiong. How Hard Is Bribery with Distance Restrictions?[J]. ECAI 2016: 22ND EUROPEAN CONFERENCE ON ARTIFICIAL INTELLIGENCE,2016,285:363-371.
APA	Yang, Yongjie,Shrestha, Yash Raj,&Guo, Jiong.(2016).How Hard Is Bribery with Distance Restrictions?.ECAI 2016: 22ND EUROPEAN CONFERENCE ON ARTIFICIAL INTELLIGENCE,285,363-371.
MLA	Yang, Yongjie,et al."How Hard Is Bribery with Distance Restrictions?".ECAI 2016: 22ND EUROPEAN CONFERENCE ON ARTIFICIAL INTELLIGENCE 285(2016):363-371.

个性服务

查看访问统计

相关权益政策

暂无数据

收藏/分享

除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。