两足机器人的能量控制开发

数值分析中常用的几种算法的实现-numerical analysis of several commonly used algorithms to achieve

带有测试数据的蚁群算法，可以指定检测区域的大小，经过测试，可以运行，有需要的可以看看。

用C语言实现了宿舍管理系统，包括用密码登录不同等级的界面（超级管理员、管理员、普通用户）；用链表、数据结构实现基本信息的输入；用文件实现录入数据的存储及读取；链表相关的增加、删除、查询、修改、排序等功能的实现。适合C语言的初学者。

c program for identifying bottleneck machines in a job shop (used in the scheduling of the shop floor)

资源描述

另一种离散傅立叶变换程序-a discrete Fourier transform procedures

Ordinary and Partial Differential Equation Routines in C, C++, Fortran, Java, Maple, and MATLAB

常用算法的C程序。主要内容包括多项式的计算、复数运算、随机数的产生、矩阵运算、矩阵特征值与特征向量的计算、线性代数方程组的求解、非线性方程与方程组的求解、插值与逼近、数值积分、常微分方程组的求解、数据处理、极值问题的求解、数学变换与滤波、特殊函数的计算、排序和查找。-Commonly used algorithm of C procedures. Include polynomial terms, complex computation, random number generation, matrix operations, matrix eigenvalue and eigenvector calculations, linear algebra equations, nonlinear equations with the equations, interpolation and approximation, numerical integration, solving ordinary differential equations, data processing, for solving extremum problems, mathematical transformation and filtering, the calculation of special functions, sorting and search.

0 / 1背包问题是一个N P-复杂问题，为了解决该问题，，将用回溯算法解决该问题。既然想选择一个对象的子集，将它们装入背包，以便获得的收益最大，则解空间应组织成子集树的形状（如图1 6 - 2所示）。该回溯算法与4 . 2节的装载问题很类似。首先形成一个递归算法，去找到可获得的最大收益。然后，对该算法加以改进，形成代码。改进后的代码可找到获得最大收益时包含在背包中的对象的集合。-0/1 knapsack problem is a P-complex issues, in order to solve the problem, and will be used backtracking algorithm to solve the problem. As to the choice of a subset of object, they will load a backpack, in order to obtain the greatest profits, the solution should be organized into space subset of the shape of the tree (Figure 1 6-2 below). The backtracking algorithms and 4. Two loading problem is very similar. Forming a recursive algorithm to get the maximum benefit available. Then, this algorithm is modified to form code. Improved code can be found at the maximum benefits included in the backpack of a collection of objects.

poj 3310 的代码和方法说明,个人原创- the codes and solution for poj_3310.