-
通过编制迷宫程序来熟练掌握A*算法。充分理解A*算法和启发函数的关系...
通过编制迷宫程序来熟练掌握A*算法。充分理解A*算法和启发函数的关系-through the preparation of the maze procedure to skillfully master A* algorithm.* A full understanding of algorithms and heuristic function of
- 2022-03-31 01:37:11下载
- 积分：1
-
插值程序
给入控制信号，输入输出分辨率 进行放大，分辨率例如1024 768，系统时钟为最高频率的输入时钟，里面包括双线性，还有最近领域法，两种算法的选择是通过一个电平进行控制
- 2022-09-19 13:50:03下载
- 积分：1
-
使用嵌入式零树小波的图像压缩算法
这是使用嵌入式零树小波的图像压缩算法。它用于在小波域中。这种算法是非常有效和有用在图像处理中。
- 2022-01-25 20:52:54下载
- 积分：1
-
说明: 1.本程序为复合形法
!* 2.程序功能是求解约束最优化问题...
说明: 1.本程序为复合形法
!* 2.程序功能是求解约束最优化问题-Note : 1. The procedures for the complex method!* 2. Programming is solving constrained optimization problem
- 2022-12-01 18:25:02下载
- 积分：1
-
本程序用FORTRAN求解gauss_seidel写。这是字文件。
this a program written by fortran for solving Gauss_Seidel. it s in word file.-this is a program written by fortran for solving Gauss_Seidel. it s in word file.
- 2022-04-17 08:18:38下载
- 积分：1
-
MRF_based_image_completion
资源描述AppWizard has created this MRF_Based DLL for you. This file contains a summary of what you will find in each of the files that make up your MRF_Based application.
- 2023-03-09 18:15:03下载
- 积分：1
-
验证hilbert矩阵是病态矩阵
验证hilbert矩阵是病态矩阵-Authentication is a pathological matrix matrix hilbert
- 2023-02-28 04:50:03下载
- 积分：1
-
直接分解算法
* To factor the n by n matrix A = (A(I,J)) into the product of the* lower triangular matrix L = (L(I,J)) and U = (U(I,J)), that is* A = LU, where the main diagonal of either L or U consists of all ones:** INPUT: dimension n; the entries A(I,J), 1
- 2023-06-21 06:30:04下载
- 积分：1
-
QR 法求特征值
QR分解法是三种将矩阵分解的方式之一。这种方式，把矩阵分解成一个正交矩阵与一个上三角矩阵的积。QR分解经常用来解线性最小二乘法问题。QR分解也是特定特征值算法即QR算法的基础。
- 2022-05-15 21:42:18下载
- 积分：1
-
数据结构-算法-C语言-Demo
#ifndef _BINARY_TREE_H_INCLUDED#define _BINARY_TREE_H_INCLUDED#include #include templatestruct Bintree_node {T element;Bintree_node* lchild;Bintree_node* rchild;explicit Bintree_node(const T& elem=T(), Bintree_node* lchd=0, Bintree_node* rchd=0): element(elem), lchild(lchd), rchild(rchd) {}};templateclass Binary_tree {public:typedef Bintree_node* PBtn;Binary_tree();virtual ~Binary_tree();void clear();int depth() const;int size() const;virtual PBtn find(const T& elem) const=0;virtual void insert(const T& elem)=0;virtual void erase(const T& elem)=0;virtual void print(std::ostream& output) const=0;void print_tree(std::ostream& output) const;protected:
- 2022-01-29 04:39:50下载
- 积分：1
