搜索资源列表
dianlixitong
- 使用matlab识别电力系统网路并且求出其中树的数目，求电力系统中的潮流计算，求电力系统中的灵敏度(Using MATLAB to calculate the number of trees in the power system.Calculate the power flow in the power system, and find the sensitivity in the power system)
decision_tree
- 机器学习/python入门项目三：决策树(Machine Learning / Python Getting Started Project 3: Decision Trees)
图片批量处理器
- k很舒服的空间发货的司空见惯明年初V啊啊立刻大声建档立卡说你肯定不感觉看到过，大手大脚奥斯卡。(Two years ago, I lived in my hometown. It is a small village, so people there get familiar with each other. When we walked on the country road, everyone smiled when we saw each other. There was no dista
test1
- 本程序利用二叉树实现了表达式的存储和计算的功能(Storage and calculation of expressions with two forked trees)
RandomTree
- 产生一个动态改造随机树的代码，可以用来改变产生随机树的分支，形成方法，颜色等操作。(A code that dynamically transforms random trees can be used to change branches that generate random trees, form methods, colors and so on.)
rr-master
- rr is a lightweight tool for recording and replaying execution of applications (trees of processes and threads).
seg_tree
- segment tree 的简要实现，主要是面对与搜索的数据结构(Let us consider the following problem to understand Segment Trees. We have an array arr[0 . . . n-1]. We should be able to 1 Find the sum of elements from index l to r where 0 <= l <= r <= n-1 2 Change
python程序
- 利用Python中的turtle库实现画树，简单易上手(Using turtle Library in Python to draw trees, easy to get started.)
jane_1390_sm_appendixs3
- Boot Regression Trees
经典全模场景种树脚本
- 基于Max scr ipt脚本语言开发，用于在3ds Max场景当中快速种植树木(Based on Max scr ipt scr ipting language development, used for fast planting trees in the 3DS Max scene.)
可用程序
- 首先构造决策树，产生随机森林，是一种预测模型。(First, constructing decision trees to produce random forests is a prediction model.)
Random-Forests-Matlab-master (2)
- 要说随机森林，必须先讲决策树。决策树是一种基本的分类器，一般是将特征分为两类（决策树也可以用来回归，不过本文中暂且不表）。构建好的决策树呈树形结构，可以认为是if-then规则的集合，主要优点是模型具有可读性，分类速度快。(In machine learning, a random forest is a classifier that contains multiple decision trees, and its output category is determined by the m
Bidirectional Rapidly-exploring Random Trees
- 基于二值图的路径规划，rrt算法。 双向优化，通过起点与终点双点发展扩展树，优化处理速度。(Path planning based on binary graph, RRT algorithm. Two way optimization, through the start and end point of the expansion tree development, optimize the processing speed.)