Search - main.c

Search - main.c - List

[AI-NN-PR] 压力测试程序 DL : 0: StressMark测试软件是一个使用Visual C++编写的，开放源代码的测试工具，可以完成服务程序及重要算法的功能和性能测试，其最主要的功能是模拟多线程或多客户端的自动化压力测试。-StressMark test software is a prepared using Visual C, the open-source testing tools, procedures and services to complete the important functions of the algorithm and performance tests. its main function is simulated multi-threaded or multi-client automation pressure tests.
Date : 2025-12-19 Size : 141kb User : hao
[AI-NN-PR] facedetection_all DL : 0: 包含了人脸识别过程中主要算法的实现,对初学者快速上手很有帮助-contains face recognition algorithm for the main course of the realization of beginners unfamiliar helpful
Date : 2025-12-19 Size : 11kb User : 林海
[AI-NN-PR] GA-1 DL : 0: 一个利用遗传算法求解最优解的程序主要是利用遗传算法迭代寻求最优的逼近解-using a genetic algorithm for optimal solution of the main procedures is the use of genetic algorithms for optimal iterative approximation Solutions
Date : 2025-12-19 Size : 2kb User : 薛燕
[AI-NN-PR] apriori(C++) DL : 0: 本算法的基本功能是用C＋＋语言实现了APRIORI算法，用户可以先选择要进行的操作。然后再输入支持度和置信度，就可得到挖掘的结果。输出的结果主要包括两个部分。 1．输出所有的频繁项集。 2．输出所有的产生的规则。算法还能够输出初始的事务集合，并且可以输出产生的中间结果。-the algorithm is the basic functions using C++ language of APRIORI algorithm, Users may choose to conduct the operation. Then import support and confidence, could be the result of excavation. Output of the two main parts. 1. Output of all frequent sets. 2. Output of all the rules. Algorithm can also output the affairs of the initial pool, and can output of intermediate results.
Date : 2025-12-19 Size : 104kb User : linvg
[AI-NN-PR] JiuGongTree DL : 0: 这是有一个解决八数码问题的程序！主要应用了宽度优先搜索法！是用C#开发的-This is a solution to the problem of digital eight procedures. Application of the width of the main priorities Search! Is the development of the C#
Date : 2025-12-19 Size : 1.32mb User : 李天意
[AI-NN-PR] dijkstra-c++ DL : 0: Dijkstra算法是典型的最短路算法，用于计算一个节点到其他所有节点的最短路径。主要特点是以起始点为中心向外层层扩展，直到扩展到终点为止。 Dijkstra算法能得出最短路径的最优解，但由于它遍历计算的节点很多，所以效率低。Dijkstra算法是一种逐步搜索算法，通过为每个顶点n保留目前为止所找到的从m到n的最短路径来工作的。 c#实现算法-Dijkstra algorithm is a typical example of the most short-circuit algorithm, used to calculate a node to all other nodes of the shortest path. The main characteristics is the starting point as the center outward expansion layers, until the date extended to the end. Dijkstra shortest path algorithm can arrive at the optimal solution, but because it traverse a lot of computing nodes, so inefficient. Dijkstra algorithm is a step by step search algorithm for each vertex n reservations so far found from the m to n shortest path to work. c# algorithm
Date : 2025-12-19 Size : 2kb User : kivilin
[AI-NN-PR] gesn-20000926 DL : 0: 这是一个gesn的c源代码。在上传的压缩包中，有一个对所有原程序包的详细说明的txt-GESN Main Development
Date : 2025-12-19 Size : 22kb User : xumin
[AI-NN-PR] main DL : 0: 神经网络算法的C语言实现，可以在此基础上根据所要解决的问题进行修改-Neural network algorithm to achieve the C language, can be based on issues resolved to amend
Date : 2025-12-19 Size : 5kb User : 张驰
[AI-NN-PR] libsvm-2.89 DL : 0: 是一種線性方成的分類器。SVM透過統計的方式將雜亂的資料以NN的方式分成兩類，以便處理。LIBLINEAR is a linear classifier for data with millions of instances and features. It supports L2-regularized logistic regression (LR), L2-loss linear SVM, and L1-loss linear SVM. -Main features of LIBLINEAR include Same data format as LIBSVM, our general-purpose SVM solver, and also similar usage Multi-class classification: 1) one-vs-the rest, 2) Crammer & Singer Cross validation for model selection Probability estimates (logistic regression only) Weights for unbalanced data MATLAB/Octave, Java interfaces
Date : 2025-12-19 Size : 509kb User : 陳彥霖
[AI-NN-PR] Hop DL : 0: C++ Program for Hopfield Network For convenience every C++ program has two components: One is the header file with all of the class declarations and lists of include library files the other is the source file that includes the header file and the detailed descriptions of the member functions of the classes declared in the header file. You also put the function main in the source file. Most of the computations are done by class member functions, when class objects are created in the function main, and calls are made to the appropriate functions. The header file has an .h (or .hpp) extension, as you know, and the source file has a .cpp extension, to indicate that it is a C++ code file. It is possible to have the contents of the header file written at the beginning of the .cpp file and work with one file only, but separating the declarations and implementations into two files allows you to change the implementation of a class(.cpp) without changing the interface to the class (.h).-C++ Program for Hopfield Network For convenience every C++ program has two components: One is the header file with all of the class declarations and lists of include library files the other is the source file that includes the header file and the detailed descriptions of the member functions of the classes declared in the header file. You also put the function main in the source file. Most of the computations are done by class member functions, when class objects are created in the function main, and calls are made to the appropriate functions. The header file has an .h (or .hpp) extension, as you know, and the source file has a .cpp extension, to indicate that it is a C++ code file. It is possible to have the contents of the header file written at the beginning of the .cpp file and work with one file only, but separating the declarations and implementations into two files allows you to change the implementation of a class(.cpp) without changing the interface to the class (.h).
Date : 2025-12-19 Size : 119kb User : yuebob
[AI-NN-PR] PSO DL : 0: 改进后的经典的pso算法，主函数是对空间坐标的搜索，使用的时候可以改成其他的相应问题，c++描述-The improved classic pso algorithm, the main function is the search space coordinates, using the time to change other consequential issues, c++ description of
Date : 2025-12-19 Size : 223kb User : 阿斯顿
[AI-NN-PR] DS DL : 0: DS证据理论中的合成规则的算法实现；该算法对两个基本可信度分配(BPA)的合成规则进行实现，算法包含在DS.h文件中，main.c文件对其进行调用，并对简单示例进行测试。-DS evidence theory in the synthesis of the rules of algorithm the algorithm two basic probability assignment (BPA) to achieve the synthesis rules, the algorithm is included in the DS.h file, main.c file their calls, and simple example for testing.
Date : 2025-12-19 Size : 11kb User : liuxiang
[AI-NN-PR] TSP_GA DL : 0: 在c语言中用遗传算法解决旅行商问题的一个简单的程序，含有主程序，数据文件-In c language using genetic algorithms to solve the traveling salesman problem of a simple program, with the main program, data file
Date : 2025-12-19 Size : 3kb User : 陈建飞
[AI-NN-PR] TSP_ACA DL : 0: 对于旅行商问题在c语言中，用蚁群算法所编的一个程序，包含主程序和数据文件-For the traveling salesman problem in c language, compiled using ant colony algorithm is a procedure that contains the main program and data files
Date : 2025-12-19 Size : 3kb User : 陈建飞
[AI-NN-PR] main(1) DL : 0: 模拟退火算法解决tsp问题用c语言实现-Tsp simulated annealing algorithm to solve the problem with c language
Date : 2025-12-19 Size : 2kb User : zhangxin
[AI-NN-PR] main.c.tar DL : 0: 基于反馈的EDF调度算法的仿真及性能测试程序。为原创，希望能收到一些意见。-Feed-back control EDF scheduler implemented on VxWorks kernel. This is original work for a course project. Hope it would be helpful to you guys.
Date : 2025-12-19 Size : 4kb User : gmagogsfm
[AI-NN-PR] LDPC DL : 0: 这是关于LDPC信道编码模块设计的程序打开源程序，先运行gengrate_h.m程序，陆续将码长设置为756bit，列重设置为3，行重设置为9。在Workspace中同时将H、A、B、C、D、E、Hget、Fget、g、Tget这是个变量选择另存为encode_in.mat 格式。再运行main_encode.m进行编码，主程序运行后，在当前目录下，自动生成编码结果文件“encode—out.mat”，这将作为下一次扩频调制仿真实验的的输入信号。最后分别查看Workspace中的变量s（编码前数据）和xyuan（编码后数据）的波形。对比后，可以看出编码前的数据码片长度为504bit，编码后的码片数据长度为756bit。编码效率=编码前码片长度/编码后码片长度=2/3。-This is about the LDPC channel coding module design process Open source, first run gengrate_h.m program, phasing out the code length is set to 756bit, column re-set to 3, line weight is set to 9. In the Workspace in the same time, H, A, B, C, D, E, Hget, Fget, g, Tget This is a variable select Save As encode_in.mat format. Then run main_encode.m encoding, the main program running in the current directory, the results of automatically generated code file "encode-out.mat", which will serve as the next simulation of the spread spectrum modulation input signal. Finally, the variables were View Workspace in s (before encoding data) and xyuan (encoded data) waveform. After comparison, we can see the data before encoding chip length of 504bit, encoded data length of chip 756bit. Coded before coding efficiency = chip length/length of the encoded chip = 2/3.
Date : 2025-12-19 Size : 15kb User : 吴健
[AI-NN-PR] main DL : 0: 遗传算法求解最优路径的c++程序一种求解vrp问题的好方法-Genetic algorithm for optimal path
Date : 2025-12-19 Size : 34kb User : Robert.x
[AI-NN-PR] main DL : 0: FASTA 算法C++实现，比较初级，没有多少技术含量-FASTA algorithm in C++
Date : 2025-12-19 Size : 1kb User : 李二
[AI-NN-PR] tmp DL : 0: 人工智能经典问题：传教士野人问题，内涵pdf版的问题描述和源代码main.c-The Artificial Intelligence classic question: missionaries Savage connotation pdf version description and source code main.cpp
Date : 2025-12-19 Size : 116kb User : 孙科

« 12 »