搜索资源列表
lunkuxunyousuanfa
- 轮库寻优算法的求解：库群联合调度的最优算法-Round of database searching algorithms to solve: The group of the Joint Optimal Scheduling Algorithm
EVC4.2.iniFilereadwriteFounction
- 是一个在EVC下开发的闹钟定制程序。其中一个难点就是如何创建、写、读一个ini 文件。由于是在EVC下，所以很多API函数都不被支持比如关于.ini文件读写GetPrivateProfileString和 WritePrivateProfileString函数。于是我开始在网上搜寻可以轻松读写ini文件的方法。最后找到了一个人写好的，可以实现类似 GetPrivateProfileString功能的函数。-EVC is a customizable alarm clock, developed
callnet_0.9
- 网络极速寻呼软件, 可扫描当前电脑上所有的TCP端口状态 ,支持完全自控的聊天服务,支持中国联通,河北国信,万声寻呼,中铁寻呼,斯壮寻呼,国讯寻呼等主要干线 -Network speed paging software, current computer can scan all TCP ports, and support fully controlled chat services to support China Unicom, Hebei Guoxin, million voice
sat_cons
- Least-squares searching for receiver position.Given 4 or more pseudoranges and ephemerides.
hillclimbing
- algorithm of hill climbing for searching
SAA1
- ALGORITHMS OF SAA1 FOR SEARCHING
SA1
- SA1 ALGORITHMS FOR SEARCHING
GA1
- GA1 ALGORITHMS FOR SEARCHING
zhinengxiaoche
- 具有寻黑带、趋光、避障功能，能记录走过的路程和时间-Black Belt with searching, phototaxis, obstacle avoidance function, can record the distance traveled and time
IconLib_src
- At some point in the last month, I needed to create an .ICO file on the fly with a couple of images inside preferably I was looking at code in C#. The .NET Framework 2.0 only supports HICON that basically is one Icon with just a single image in it. W
ifndef
- 关于路径搜索的实用性优化算法的应用，基于A*算法的优化-On the path searching algorithm to optimize the usefulness of the application of A* algorithm-based optimization
convexhull_Grahamscan
- Input : A set S of planar points Output : A convex hull for S Step 1: If S contains no more than five points, use exhaustive searching to find the convex hull and return. Step 2: Find a median line perpendicular to the X-axis which divides S in
Trie
- Trie数据结构，一种字符串存储方式，可以提高字符串的查找效率-a data structure of Trie, which can be used for storing the strings and improve the searching efficiency for a given string
datrie_cvs20061001.tar
- This an implementation of double-array structure for representing trie, as proposed by Junichi Aoe [1]. Trie is a kind of digital search tree, an efficient indexing method with O(1) time complexity for searching. Comparably as efficient as h
atan_lut
- 基于改进的查找表的arctan计算模块，包含完整的VHDL源代码及部分注释．绝对原创！-Arctan calculation module based on improved searching form. The rar package contains complete VHDL source code and some notes. Absolutely original!
xueshengguanli
- 学生成绩管理系统是一个教育单位不可缺少的部分,它的内容对于学校的决策者和管理者来说都至关重要,所以学生成绩管理系统应该能够为用户提供充足的信息和快捷的查询手段。但一直以来人们使用传统人工的方式管理文件档案，这种管理方式存在着许多缺点。随着科学技术的不断提高,计算机科学日渐成熟,其强大的功能已为人们深刻认识,它已进入人类社会的各个领域并发挥着越来越重要的作用。作为计算机应用的一部分,使用计算机对学生信息及成绩进行管理,具有手工管理所无法比拟的优点.-Student achievement mana
search
- searching pupil and iris boundaries
AVL_TREES_best_example
- The applet illustrates the behaviour of binary search trees, Searching and Sorting Algorithms, Self-adjusting Binary Search Trees, Symmetric binary B-trees,聽Data structure and maintenance algorithms
87361029MF500_code
- 基于M64＋RC500的读卡程序，包括寻卡、防冲突、认证等-Based on the M64+ RC500 reader procedures, including searching cards, anti-collision, authentication, etc.
hmmer-2.3.2.tar
- Profile hidden Markov models (profile HMMs) can be used to do sensitive database searching using statistical descr iptions of a sequence family s consensus. HMMER is a freely distributable implementation of profile HMM software for protein sequence a