中文版 | English

在结果中检索

CSpace

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

限定条件    
已选(0)清除 条数/页：   排序方式：
Follow the perturbed approximate leader for solving semi-bandit combinatorial optimization 期刊论文
FRONTIERS OF COMPUTER SCIENCE, 2021, 卷号: 15, 期号: 5, 页码: 12
作者:  Yang, Feidiao;  Chen, Wei;  Zhang, Jialin;  Sun, Xiaoming
收藏  |  浏览/下载：36/0  |  提交时间：2021/12/01
online learning  online combinatorial optimization  semi-bandit  follow-the-perturbed-leader  
Facility location games with optional preference 期刊论文
THEORETICAL COMPUTER SCIENCE, 2020, 卷号: 847, 页码: 185-197
作者:  Chen, Zhihuai;  Fong, Ken C. K.;  Li, Minming;  Wang, Kai;  Yuan, Hongning;  Zhang, Yong
收藏  |  浏览/下载：29/0  |  提交时间：2021/12/01
Game theory  Facility location game  Algorithmic mechanism design  Approximation  
The one-round multi-player discrete Voronoi game on grids and trees 期刊论文
THEORETICAL COMPUTER SCIENCE, 2020, 卷号: 838, 页码: 143-159
作者:  Sun, Xiaoming;  Sun, Yuan;  Xia, Zhiyu;  Zhang, Jialin
收藏  |  浏览/下载：46/0  |  提交时间：2020/12/10
Game theory  Nash equilibrium  Location game  Graph theory  
Coreness of cooperative games with truncated submodular profit functions 期刊论文
THEORETICAL COMPUTER SCIENCE, 2020, 卷号: 822, 页码: 49-60
作者:  Chen, Wei;  Shan, Xiaohan;  Sun, Xiaoming;  Zhang, Jialin
收藏  |  浏览/下载：41/0  |  提交时间：2020/12/10
Cooperative game  Core  Submodular function  Social network  
On the modulo degree complexity of Boolean functions 期刊论文
THEORETICAL COMPUTER SCIENCE, 2020, 卷号: 818, 页码: 32-40
作者:  Li, Qian;  Sun, Xiaoming
收藏  |  浏览/下载：30/0  |  提交时间：2020/12/10
Boolean function  Degree complexity  Polynomial  Decision tree complexity  Hypergraph property  
The Complexity of Optimization on Grids 期刊论文
ALGORITHMICA, 2019, 卷号: 81, 期号: 9, 页码: 3494-3518
作者:  Barba, Luis;  Milatz, Malte;  Nummenpalo, Jerri;  Sun, Xiaoming;  Thomas, Antonis;  Zhang, Jialin;  Zhang, Zhijie
收藏  |  浏览/下载：68/0  |  提交时间：2019/12/10
Unique-sink orientation  Optimization  Linear programming  
A tighter relation between sensitivity complexity and certificate complexity 期刊论文
THEORETICAL COMPUTER SCIENCE, 2019, 卷号: 762, 页码: 1-12
作者:  He, Kun;  Li, Qian;  Sun, Xiaoming
收藏  |  浏览/下载：248/0  |  提交时间：2019/04/03
Sensitivity conjecture  Sensitivity  Block sensitivity  Certificate complexity  Boolean functions  
Near optimal algorithms for online weighted bipartite matching in adversary model 期刊论文
JOURNAL OF COMBINATORIAL OPTIMIZATION, 2017, 卷号: 34, 期号: 3, 页码: 689-705
作者:  Sun, Xiaoming;  Zhang, Jia;  Zhang, Jialin
收藏  |  浏览/下载：42/0  |  提交时间：2019/12/12
Online matching  Weighted bipartite graph  Adversary model  Near optimal algorithm