Search - solve

Search - solve - List

【Communication】 VFP串口通讯 DL : 1: VFP Microsoft Comm 控件来解决串行口读数据这一关键问题-VFP Microsoft Comm control to solve the serial data reading the key issue
Update : 2008-10-13 Size : 1818 Publisher : 洲
【OpenGL program】 GL Printdemo DL : 0: VC++和OPENGL解决了OPENGL的打印及打印预览代码详尽-VC and OpenGL solve the OpenGL Print and Print Preview detailed code
Update : 2008-10-13 Size : 37847 Publisher : 小王
【Other resource】求解线性代数方程组 DL : 0: 线性代数方程组的求解全选主元高斯消去法全选主元高斯约当消去法复系数方程组的全选主元高斯消去法-linear algebraic equations to solve all the main election yuan Gaussian Elimination entire election PCA about when Gaussian Elimination of complex equations of the entire election PCA Gaussian Elimination Act, etc.
Update : 2008-10-13 Size : 14930 Publisher : 樊继东
【Mathimatics-Numerical algorithms】 22338877 DL : 0: 蚁群算法在数值方法中的应用以及求解最优化函数的极值问题-Ant Algorithm in numerical methods and applications to solve the optimization problem function extremum
Update : 2008-10-13 Size : 26926 Publisher : 武松
【Other resource】 LibrarySystem DL : 0: 图书管理系统v1.0是使用JAVA语言开发的解决图书基本管理的一个应用程序。该系统能够实现简单的图书和用户管理，包括添加图书，删除图书，修改图书信息，添加用户，删除用户，修改用户信息，外借图书，归还图书，罚款计算等等。该系统的前台界面采用JAVA的 SWING开发，具有简洁美观的外观，直观的用户使用界面十分方便上手使用；后台采用MS-ACCESS 数据库，采用JDBC-ODBC数据库连结方式，使用前须在控制面板中的数据库（ODBC）中的用户 DSN里将ACCESS数据库文件添加到用户数据源，数据源名为JLibrary,登陆名称和密码设置为空。注意：该程序正常运行需要安装JAVA运行环境（Java Runtime Environment v1.4.1_05）-Library Management System v1.0 is the use of the Java language books to solve basic management of an application. The system is capable of achieving a simple and user management books, including the addition of books, books delete, modify library information, add users, delete users, change user information, borrowing books, return books, etc. fine calculation. The future of the system interface using Java SWING development, with the simple and beautiful appearance, intuitive user interface is very convenient to get started; Background using MS-Access database using JDBC-ODBC database links, prior to the use of the control panel databases (ODBC) the user DSN Lane ACCESS database files will be added to the user data sources, data source named JLibrary, user name and password set up empty. N
Update : 2008-10-13 Size : 420631 Publisher : xy
【Other resource】自适应神经网络在确定落煤残存瓦斯量中的应用 DL : 0: 落煤残存瓦斯量的确定是采掘工作面瓦斯涌出量预测的重要环节,它直接影响着采掘工作面瓦斯涌出量预测的精度,并与煤的变质程度、落煤粒度、原始瓦斯含量、暴露时间等影响因素呈非线性关系。人工神经网络具有表示任意非线性关系和学习的能力,是解决复杂非线性、不确定性和时变性问题的新思想和新方法。基于此,作者提出自适应神经网络的落煤残存瓦斯量预测模型,并结合不同矿井落煤残存瓦斯量的实际测定结果进行验证研究。结果表明,自适应调整权值的变步长BP神经网络模型预测精度高,收敛速度快该预测模型的应用可为采掘工作面瓦斯涌出量的动态预测提供可靠的基础数据,为采掘工作面落煤残存瓦斯量的确定提出了一种全新的方法和思路。-charged residual coal gas is to determine the volume of mining gas emission rate forecast an important link, which directly affect mining gas emission rate forecast accuracy, and with coal metamorphism, loading coal particle size, the original gas content, exposure time and other factors nonlinear relationship. Artificial neural networks have expressed arbitrary nonlinear relationships and the ability to solve complex nonlinear, time-varying uncertainty and the new ideas and new approaches. Based on this, the author of adaptive neural network loading coal residual gas production forecast model, and a combination of different loading coal mine gas remnants of the actual test results of research. Results show that the adaptive value of the right to change step BP neural network model predict
Update : 2008-10-13 Size : 60227 Publisher : 王静
【Other】 zhuangxiang DL : 0: 该程序是采用贪婪法编制的一个小程序，解决问题是：有编号为1到n的物品，各物品的体积已知。将其装入体积均为V的箱子里，所用箱子要少-that the procedure was used in the preparation of greedy law a small program to solve the problem is : No. 1 to n items, the volume of goods known. Its size will load all the boxes V, using fewer boxes
Update : 2008-10-13 Size : 812 Publisher : 井亚
【GDI-Bitmap】图片显示VC++ DL : 0: 显示图片的VC++源码,可以解决Visual C++ 图片的现实问题.-showed pictures of VC source can solve Visual C Photo reality.
Update : 2008-10-13 Size : 27273 Publisher : 刘海涛
【Communication】 DOS程序如何读写Windows剪贴板 DL : 0: DOS程序如何读写Windows剪贴板才解决文件共享冲突问题-procedures how to read and write DOS Windows clipboard file-sharing to solve conflict
Update : 2008-10-13 Size : 3172 Publisher : 蔡旭初
【Other resource】遗传算法的一个编程实例 DL : 0: 打开压缩包，其中的word文档中提供了“m个工件分配给m架机床的效益最优化问题，使用一种遗传算法解决。”的整个编程思路和过程分析。望有相关需要的朋友喜欢-open compressed, the word document provided "m m allocated to the workpiece-machine efficiency optimization, the use of a genetic algorithm to solve." The entire programming ideas and process analysis. Expect relevant to the needs of friends like
Update : 2008-10-13 Size : 14753 Publisher : 罗宾
【Windows Develop】棋盘覆盖问题 DL : 0: 该程序实现对残缺棋盘覆盖问题的求解采用方法：分治方法-the program right chessboard incomplete coverage of the methods used to solve : the administration
Update : 2008-10-13 Size : 2329 Publisher : 杨晨
【Windows Develop】最小生成树（Kuskal算法） DL : 0: 该程序用贪心算法来求解最小生成树问题采用贪婪准则：每次选择边权值最小边。如果该边加入后不构成环，则加入。-procedures with the greedy algorithm to solve the problem using the minimum spanning tree greedy guidelines : each side the right to choose the minimum value side. If the edge after the entry does not constitute a part, while accession.
Update : 2008-10-13 Size : 2280 Publisher : 杨晨
【Windows Develop】 0-1背包问题 DL : 0: 该程序用贪心算法来求解0-1背包问题采用贪婪准则：每次选择p/w最大的物品放入背包。-procedures with the greedy algorithm to solve 0-1 knapsack problem using greed criteria : Each choice p / w largest goods Add backpack.
Update : 2008-10-13 Size : 2195 Publisher : 杨晨
【Windows Develop】二分覆盖问题 DL : 0: 该程序用贪心算法来求解二分覆盖问题. 采用贪婪准则：每次从A中选择一个顶点加入覆盖，选择时：选取能覆盖B中还未被覆盖的顶点的数目最多的顶点。-procedures with the greedy algorithm to solve two hours coverage. Using greed criteria : A time to choose from a peak accession coverage options : To B coverage can not be covered by the largest number of vertices of the vertex.
Update : 2008-10-13 Size : 2295 Publisher : 杨晨
【Windows Develop】二维最近点 DL : 0: 该程序实现对二维数据轴上的最临近点的求解问题采用方法：分治方法-procedures to achieve the two-dimensional data of the axis points near the methodology used to solve the problem : the administration
Update : 2008-10-13 Size : 2282 Publisher : 杨晨
【Windows Develop】一维最近点（分治法）1 DL : 0: 该程序实现对一维数据轴上的最临近点的求解问题采用方法：分治方法1（该方法在递归时由于使用数组的值，使得递归进栈的数据很多，消耗系统空间很大，所以处理的个数经测试不超过70个，可见在设计程序时，考虑空间的使用也是很必要的！）-the process of achieving a dimensional data axis near the point of the methodology used to solve the problem : a partition method (the method when the use of recursive array, which makes the recursive stack into many of the data, consume much space, the number of tested not more than 70, based in Visibility terms procedures, the use of space is also necessary!)
Update : 2008-10-13 Size : 1996 Publisher : 杨晨
【Windows Develop】一维最近点（分治法）2 DL : 0: 该程序实现对一维数据轴上的最临近点的求解问题采用方法：分治方法(找出中位数,两边递归）-the process of achieving a dimensional data axis near the point of the methodology used to solve the problem : the administration (to identify the median on both sides, the recursive)
Update : 2008-10-13 Size : 1830 Publisher : 杨晨
【Windows Develop】一维最近点（传统法）1 DL : 0: 该程序实现对一维数据轴上的最临近点的求解问题采用方法：计算每对顶点间的距离，比较之效率为O(n2)-the process of achieving a dimensional data axis near the point of the methodology used to solve the problem : for each pair of vertices the distance, a comparison of the efficiency of O (n2)
Update : 2008-10-13 Size : 2039 Publisher : 杨晨
【Windows Develop】一维最近点（传统法）2 DL : 0: 该程序实现对一维数据轴上的最临近点的求解问题采用方法：传统方法2:先排序，然后一次线性扫描，得到最近距离，时间复杂性O（nlogn）-the process of achieving a dimensional data axis near the point of the methodology used to solve the problem : The traditional two methods : first order, and then a linear scan, recently received distance, time complexity of O (nlogn)
Update : 2008-10-13 Size : 2171 Publisher : 杨晨
【Other resource】 Matrix_Chain DL : 0: 求解矩阵链相乘的问题，通过动态规划的方法，来求解该问题，使得矩阵链的相乘的运算最少。-chain matrix multiplication to solve the problem through dynamic programming methods to solve the problem, making the chain matrix multiplication operator at least.
Update : 2008-10-13 Size : 903 Publisher : 韩希先

« 1 2 ... 43 44 45 46 47 4849 50 »