机器博弈机器搜索算法的研究，做acm与人工智能的可以参考下
上传时间： 2014-01-03
上传用户：himbly
凸包的标程，对于备战ACM比赛的对员相当有用哦
标签：
上传时间： 2016-11-18
上传用户：invtnewer
PKU第1011题源码，具体请参考http://acm.pku.edu.cn/JudgeOnline/problem?id=10
上传时间： 2014-12-02
上传用户：671145514
【USACO3.2.5】魔板 ，经典ACM题，采用BFS
标签： USACO
上传时间： 2013-12-03
上传用户：ywqaxiwang
八数码，是经典的ACM题目中， 采用BFS的例子
标签： 数码
上传时间： 2016-12-05
上传用户：569342831
betsy tour问题的详解，适合做acm的同学
上传时间： 2014-12-03
上传用户：wfl_yy
经典题目——百钱百鸡问题，虽然很简单但是也是ACM培训初期必须掌握的呀
标签：
上传时间： 2014-02-10
上传用户：rishian
The combinatorial core of the OVSF code assignment problem that arises in UMTS is to assign some nodes of a complete binary tree of height h (the code tree) to n simultaneous connections, such that no two assigned nodes (codes) are on the same root-to-leaf path. Each connection requires a code on a specified level. The code can change over time as long as it is still on the same level. We consider the one-step code assignment problem: Given an assignment, move the minimum number of codes to serve a new request. Minn and Siu proposed the so-called DCAalgorithm to solve the problem optimally. We show that DCA does not always return an optimal solution, and that the problem is NP-hard. We give an exact nO(h)-time algorithm, and a polynomial time greedy algorithm that achieves approximation ratio Θ(h). Finally, we consider the online code assignment problem for which we derive several results
标签： combinatorial assignment problem arises
上传时间： 2014-01-19
上传用户：BIBI
使用贪心算法解决最优服务次序问题，效率高，适用于ACM竞赛
上传时间： 2013-12-21
上传用户：shanml
各种典型的算法集锦，对程序员来说是莫大的帮助，对acm爱好者跟不用说
上传时间： 2013-12-25
上传用户：qb1993225
