中文版 | English

在结果中检索

CSpace

浏览/检索结果: 共25条，第1-10条 帮助

已选(0)清除 条数/页：   排序方式：
Mechanisms for dual-role-facility location games: Truthfulness and approximability 期刊论文
THEORETICAL COMPUTER SCIENCE, 2022, 卷号: 932, 页码: 69-83
作者:  Chen, Xujin;  Li, Minming;  Wang, Changjun;  Wang, Chenhao;  Zhang, Mengqi;  Zhao, Yingchao
收藏  |  浏览/下载：67/0  |  提交时间：2023/02/07
Mechanism design  Facility location  Approximation  Truthfulness  
The efficiency of Nash equilibria in the load balancing game with a randomizing scheduler 期刊论文
THEORETICAL COMPUTER SCIENCE, 2020, 卷号: 838, 页码: 180-194
作者:  Chen, Xujin;  Hu, Xiaodong;  Wang, Chenhao;  Wu, Xiaoying
收藏  |  浏览/下载：186/0  |  提交时间：2020/11/18
Load balancing game  Price of anarchy  Price of stability  Decision-making principle  Nash equilibrium  
Super solutions of random (3+p)-SAT 期刊论文
THEORETICAL COMPUTER SCIENCE, 2019, 卷号: 793, 页码: 14-27
作者:  Wang, Bin;  Zhou, Guangyan
收藏  |  浏览/下载：203/0  |  提交时间：2020/01/10
(1,0)-satisfiable  Super solution  Phase transition  Unit Clause  
A polynomial-time algorithm to compute generalized Hermite normal forms of matrices over Z[x] 期刊论文
THEORETICAL COMPUTER SCIENCE, 2019, 卷号: 755, 页码: 89-109
作者:  Jing, Rui-Juan;  Yuan, Chun-Ming;  Gao, Xiao-Shan
收藏  |  浏览/下载：161/0  |  提交时间：2019/03/05
Generalized Hermite normal form  Grobner basis  Polynomial-time algorithm  Z[x] module  
TCS SNC Preface 期刊论文
THEORETICAL COMPUTER SCIENCE, 2017, 卷号: 681, 页码: 1-2
作者:  Verschelde, Jan;  Watt, Stephen M.;  Zhi, Lihong
收藏  |  浏览/下载：87/0  |  提交时间：2018/07/30
Solving polynomial systems with noise over F-2: Revisited 期刊论文
THEORETICAL COMPUTER SCIENCE, 2017, 卷号: 676, 页码: 52-68
作者:  Huang, Zhenyu;  Lin, Dongdai
收藏  |  浏览/下载：114/0  |  提交时间：2018/07/30
Boolean polynomial system with noise  Max-PoSSo  ISBS method  Cold Boot attack  Serpent  
Algorithm on rainbow connection for maximal outerplanar graphs 期刊论文
THEORETICAL COMPUTER SCIENCE, 2016, 卷号: 651, 页码: 76-86
作者:  Deng, Xingchao;  Li, Hengzhe;  Yan, Guiying
收藏  |  浏览/下载：129/0  |  提交时间：2018/07/30
Rainbow connection number  Maximal outerplanar graph  Diameter  Algorithm  
Approximation for the minimum cost doubly resolving set problem 期刊论文
THEORETICAL COMPUTER SCIENCE, 2016, 卷号: 609, 页码: 526-543
作者:  Chen, Xujin;  Hu, Xiaodong;  Wang, Changjun
收藏  |  浏览/下载：136/0  |  提交时间：2018/07/30
Source location  Doubly resolving set  Approximation algorithms  Polynomial-time solvability  Metric dimension  
Computing power of Turing machines in the framework of unsharp quantum logic 期刊论文
THEORETICAL COMPUTER SCIENCE, 2015, 卷号: 598, 页码: 2-14
作者:  Shang, Yun;  Lu, Xian;  Lu, Raqian
收藏  |  浏览/下载：108/0  |  提交时间：2018/07/30
Turing machines  Unsharp quantum logic  Computational power  
Selfish bin covering 期刊论文
THEORETICAL COMPUTER SCIENCE, 2011, 卷号: 412, 期号: 50, 页码: 7049-7058
作者:  Cao, Zhigang;  Yang, Xiaoguang
收藏  |  浏览/下载：98/0  |  提交时间：2018/07/30
Selfish bin covering  Weighted majority games  Price of anarchy  Price of stability  Nash equilibrium