随机算法的c++源代码，程序结构清晰，便于理解

插值算法，介绍了10种常用插值算法，插值算法， 介绍了10种常用插值算法-Interpolation algorithm, introduced 10 kinds of commonly used interpolation algorithm, interpolation algorithm, introduced 10 kinds of commonly used interpolation algorithm

资源描述Abstract Considering rapid developments in the technologies of both radio-frequency identification (RFID) systems and wireless sensor networks (WSN), an integration of the two technologies may lead to the formation of an RFID-enhanced WSN which would possess improved functions and capabilities. In the RFID-enhanced WSN, many reader-enhanced nodes have increasingly been employed. In such networks, RFID data contains a lot of duplication, because the same tag may be read multiple times, and collision may occur among readers, while energy constraints are also a serious problem. These three could in turn cause serious problems. In this paper, we have proposed our CSMA-based algorithm since it is light, efficiently minimizes all kinds of reader collision, and eliminates the duplicate data. For this purpose, we have used a separate control channel and a tag ID forwarding mechanism with a special co

10种过滤软件示例程序

C++动态规划的算法例子，找零钱的经典问题编程-C++ Dynamic programming algorithm for example, to find the classic problem of small change programming

基于波数域条件下,利用条带SAR的思想，对几个分布目标进行成像的程序；目标个数可以改变，条带SAR的参数同样可以改变，以得到不同的成像效果，进而可以进行比较

PCA进行人脸识别的好算法，可以应用于人脸识别系统PCA是进行人脸识别的经典算法，其算法应用的领域也非常的广泛在本代码中，有详细的PCA算法流程实现，使用C语言进行编程

数图空域滤波器 灰度图有效 C# dll装配件-Figure airspace effective filter grayscale C# dll installed accessories

数组排序，含bubble,quick,insertion,selection四种方法-Array sort,it includes four sort methods as follows: bubble sort ,quick sort,insertion sort and selection sort.

没有界面，用C写的小程序 问题如下：一家软件公司招聘了数十位程序员，分成若干部门。 进行一次考试，对各个部门的所有程序员进行考核。考试结束后评出了每个人的分数。现在需要知道，在每个部门内，成绩最好的程序员和成绩最差的程序员分别是谁。输入有N+1行，每一个有若干正整数。第一行只有一个正整数，代表公司的部门数目。剩余的N行，每一行代表了该部门所有程序员的得分。其中每行第一个数字k代表了该部门的程序员个数，该行剩下的有k对数据，每对数据包括一个程序员的姓名（一个字符串）和其得分（一个正整数）。【输出形式】输出有N行，每行有两个串。第一个串该部门得分最高的程序员的姓名，第二个数字是得分最低的程序员的姓名。-no interface, written in C minor procedural issues are as follows : a software company recruited dozens of programmers, divided into several departments. An examination of the various departments for testing all programmers. Examinations in 1886 after the end of each grade. Now need to know, in every sector, but the best programmers and the worst programmers who were. N input is a line, each one a number of positive integers. There is only a first positive integer representing the number of departments. The remaining N firms, each firm on behalf of all the sector"s programmers to the basket. Each Bank figures k a representative of the number of programmers, the bank left the k right d

Numerical Anaysis 8th Edition Burden and Faires (Maple Source)