搜索结果
找到约 238 项符合
Least-square 的查询结果
Applet 利用多态性编程
利用多态性编程,创建一个square类,实现求三角形、正方形和圆形面积。方法
//抽象出一个共享的类,定义一个函数求面积的公共界面。再重新定义各面积的求面积
//函数,在主类中创建不同类的对象,并求不同形状的面积
数学计算 直线拟合的几种算法
直线拟合的几种算法,其中包括线性最小二乘,和两种不同目标函数的非线性最小二乘,用于比较这些方法的优劣,另外matlab中说的robust least squares方法没有找到,希望有朋友能给穿一下:)
人工智能/神经网络 This program demonstrates some function approximation capabilities of a Radial Basis Function Networ
This program demonstrates some function approximation capabilities of a Radial Basis Function Network.
The user supplies a set of training points which represent some "sample" points for some arbitrary curve. Next, the user specifies the number of equally spaced gaussian centers and the variance for ...
数据结构 声明一个基类Shape(点), 在此基础上派生出Rectangle(长方形)和Circle(圆),这三个类都有GetArea()函数计算对象的面积,构造函数
声明一个基类Shape(点), 在此基础上派生出Rectangle(长方形)和Circle(圆),这三个类都有GetArea()函数计算对象的面积,构造函数,析构函数等有关函数。再使用Rectangle类创建一个派生类Square(正方形)。并设计创建各种类的对象,调用所有函数。设计函数f(Shape &a)能对不同对象的实参调用计算打印出对象的面积。 ...
数学计算 平均因子分解法
平均因子分解法,适用于正定矩阵First, let s recall the definition of the Cholesky decomposition: Given a symmetric positive definite square matrix X, the Cholesky decomposition of X is the factorization X=U U, where U is the square root matrix of X, and satisfies:
(1) U U = X
(2) U is upper triangul ...
微处理器开发 his project was built and tested with WinAVR-20060125. Make sure the MCU target define in the Mak
his project was built and tested with WinAVR-20060125.
Make sure the MCU target define in the Makefiles corresponds to the AVR you are using!!
To build the code, just install WinAVR and run "make" from the console in echomaster and
echoslave subdirs.
"make program" will program the device if yo ...
matlab例程 A fast customizable function for locating and measuring the peaks in noisy time-series signals. Adju
A fast customizable function for locating and measuring the peaks in noisy time-series signals. Adjustable parameters allow discrimination of "real" signal peaks from noise and background. Determines the position, height, and width of each peak by least-squares curve-fitting.
人工智能/神经网络 this m file can Find a (near) optimal solution to the Traveling Salesman Problem (TSP) by setting up
this m file can Find a (near) optimal solution to the Traveling Salesman Problem (TSP) by setting up a Genetic Algorithm (GA) to search for the shortest path (least distance needed to travel to each city exactly once)
Notes:
1. Input error checking included
2. Inputs can be specified in any order, s ...
Linux/Unix编程 Chessboard Cover,On a chessboard
Chessboard Cover,On a chessboard,only one square is different, called specific.Use the Divide-and-Conquer methods to solve the Chessboard Cover Problem.
数学计算 This unit uses an array of bytes to represent a LARGE number. The number is binairy-stored in the ar
This unit uses an array of bytes to represent a LARGE number. The number is binairy-stored in the array, with the Least Significant Byte (LSB) first and the Most Significant Byte (MSB) last, like all Intel-integer types.