子列表代码 c + +

按照难度排列，差不多也有80道左右了，代码都很精简，附有注释还有解析神马的，适合初学者参考。

资源描述This paper presents a lowcost indoor location identification and material tracking methodology for construction projects using Ultra High Frequency (UHF) passive Radio Frequency Identification (RFID) technology. Onsite location aware information is an emerging area that focuses on automating delivery of spatial information pertinent to location of materials, workforce, and equipment. This spatial information can be used to derive knowledge about construction project status. A two-step algorithm is presented to automate the process of location estimation and material tracking in near-real-time. In this methodology, a number of passive RFID tags are distributed onsite where work is progressing, and a mobile RFID reader is carried by a worker onsite. Each passive RFID tag is deployed as a reference point with a known location (landmark) within a predefined zone. Reference tags of known locations are used to d

龙格-库塔法是数值计算的重要方法 本例子简明扼要,浅显好懂-Runge- Kutta numerical method is an important method to the example of concise and simple to understand

用语计算光子晶体的透射率和反射率以及能带结构-Term calculation of photonic crystal transmittance and reflectance as well as the energy band structure

加深数据挖掘中分类（决策树）的认识，其经典算法为Id3算法，了解影响Id3算法性能的因素，掌握基于Id3算法理论的分类分析的原理和方法。并亲手实现id3算法。 并有详尽的报告文档帮助使用者了解id3的原理以及实现方法。                                                                                                       

深度优先遍历图的方法是，从图中某顶点v出发： （1）访问顶点v； （2）依次从v的未被访问的邻接点出发，对图进行深度优先遍历；直至图中和v有路径相通的顶点都被访问； （3）若此时图中尚有顶点未被访问，则从一个未被访问的顶点出发，重新进行深度优先遍历，直到图中所有顶点均被访问过为止。　当然，当人们刚刚掌握深度优先搜索的时候常常用它来走迷宫.

精通Matlab综合辅导与指南-proficient Matlab comprehensive counseling and guidance

此文件包含某大学ACM暑期培训课程中关于二分匹配的讲义ppt和匈牙利算法代码。-This file contains a university summer ACM training courses on the two sub-matching algorithm lectures ppt and Hungary code.

1.用C++语言设计的一个学生成绩管理系统2.以报告的形式进行了书写，对于学生管理系统有比较详细的介绍3.源程序附加在报告后面4.并有相关程序解释

数值分析中的许多常用算法，偶向大家强烈推荐中-numerical analysis of many commonly used algorithm, even to strongly recommend which