▍1. Alphabeta_HH
Alpha-Beta搜索算法,博弈树搜索中最常用的算法之一(Alpha-Beta search algorithm, the game tree search, one of the most commonly used algorithms)
Alpha-Beta搜索算法,博弈树搜索中最常用的算法之一(Alpha-Beta search algorithm, the game tree search, one of the most commonly used algorithms)
钻石搜索法可以在帧间预测中准确的收索到匹配的宏块或者是子块,从而有效的降低码率和改善图像质量(Diamond Search interframe prediction method can accurately claim to match the collection of sub-macroblock or block, so as to effectively reduce the bit rate and improve image quality)
利用句柄复制进行文件占坑实现阻止文件删除,外加枚举进程内所有打开的文件、搜索文件句柄所在进程、卸载相关句柄。(Copy files using handles accounting realize pit stop delete files, plus the process of enumeration of all open files, search file handles where the process of unloading the relevant handler.)
搜索是网络技术的热门课题,网络爬虫是搜索技术的基础,用VC++编写的网络爬虫可以很好的学习这门课题,适合初学者(Search is a hot topic of network technology, network reptiles is based on search technology, using VC++ Prepared reptiles can be a very good network of learning in this subject, suitable for beginners)
很好的搜索: 给你很多长度不定的木棒,将他们分成几组,每组中的总长度作为这组的标示值,请给出一种分组方法,能使得所有标示值中的最小值最大。 Input 多组,每组两行,第一行是一个N和K,代表有N根木棒,分成K组,第二行是N个数字,代表木棒的长度。(N不超过100,K不超过20,每根木棒长度不超过1000) Output 输出所有标示值中的最小值的最大值。 Sample Input 5 3 1 3 5 7 9 5 3 89 59 68 35 29 Sample Output 8 89(err)
网络爬虫程序,C++实现!程序完全开源!(Network reptiles procedures, C++ Realize! Procedure is totally open source!)
这个是我们大学的一个小学期作业,是完成关键路径的搜索(this is our university a primary period of operation is the completion of the Critical Path Search)
开放源码的搜索引擎(Xapian open source search engine)(open source search engine (Xapian open source search engi ne))
搜索获取最近格点的程序,通过matlab调用C程序(recently obtained search grid procedure for the adoption of Matlab call C procedures)
下一代天网文件搜索引擎(next generation Skynet document search engine)