搜索资源列表
Anadaptivefilteringapproachtotargettracking
- A method is presented for augmenting an extended Kalman filter with an adaptive element. The resulting estimator provides robustness to parameter uncertainty and unmodeled dynamics.-A method is presented for augmen
tom_cow
- we use breadth-first algorithm to find a augmenting path The max flow is all the power flow out the source node or sink into the destination node.
Anadaptivefilteringapproachtotargettracking
- A method is presented for augmenting an extended Kalman filter with an adaptive element. The resulting estimator provides robustness to parameter uncertainty and unmodeled dynamics.-A method is presented for augmen
tom_cow
- we use breadth-first algorithm to find a augmenting path The max flow is all the power flow out the source node or sink into the destination node.-we use breadth-first algorithm to find a augmenting pathThe max flow is
max_flow
- 介绍最大流算法的ppt，The Ford-Fulkerson Augmenting Path Algorithm，The Capacity Scaling Algorithm，The Goldberg-Tarjan Preflow Push Algorithm，-Introduction maximum flow algorithm ppt, The Ford-Fulkerson Augmenting Path Algorithm, T
Maximum_flow
- 用C++实现的3种最大流算法。CS（Capacity-Scaling Algorithm）、SAP（Shortest Augmenting Path Algorithm）、ISAP（Improved Shortest Augmenting Path Algorithm）。-C++ implementation with three kinds of maximum flow algorithms. CS (Capacity-Scalin
shortestaugmentingpath
- 最大流问题的最短增广路径算法 是算法中的重要部分 -Maximum flow problem of the shortest augmenting path algorithm is an important part of the algorithm
network
- 无线运营商都在充实与补充基础设施，如微细胞分布式天线和继电器，宏蜂窝网络的进程。本文主要介绍了分布式天线的技术。-Wireless operators are in the process of augmenting the macrocell network with supplemental infrastructure such as microcells, distributed antennas and relays.
maxflow
- 实现的是最大流的两种增广路算法，用到队列和BFS寻增广路-To achieve the maximum flow of the two augmenting path algorithm, used in the queue and the BFS search augmenting path
xyl_suanfa
- 匈牙利算法是基于Hall定理中充分性证明的思想，它是部图匹配最常见的算法，该算法的核心就是寻找增广路径，它是一种用增广路径求二分图最大匹配的算法。-Hungarian algorithm is based on the thought of the Hall theorem sufficient proof, it is the Ministry of graph matching most common algorithm, the
the-maximum-flow-problem-
- 用增广路法计算最大流问题，给出了C++代码-Augmenting path method to calculate the maximum flow problem given C++ code
Ford-Fulkerson
- 算法导论对最大流算法有很详细的介绍，今天实现了最大流Ford-Fulkerson的算法，包括BFS和DFS来搜索增广路径。 -Introduction to Algorithms maximum flow algorithm has a very detailed briefing today to achieve the maximum flow algorithm of Ford-Fulkerson, including BF
224Edmonds_Karp
- T017_最大流增广路算法224Edmonds_Karp-T017_ maximum flow augmenting path algorithm 224Edmonds_Karp
Edmonds.cpp.tar
- Edmonds算法，寻找网络最大流 算法流程: 在残余网络中, 通过广搜找到一条增广路 找出增广路上的最小权值的边 更新残余网络 直到找不到增广路为止 // 统计当前网络中汇点的流-Edmonds algorithm to find the maximum network flow algorithm process: in the residual network, through extensive sear
06178086
- When the measurement errors in Kalman filtering are time correlated, time-differencing approaches are conventionally applied to deal with the time-correlated errors, but they are subject to practical limitations, s
1087(A-Plug-for-UNIX)(SAPPGAPPBFS)
- poj1087,SAP+GAP+BFS，最快的基于增广路径的最大流算法-poj1087, SAP+GAP+BFS, the fastest maximum flow algorithm based on augmenting path
flower-tree
- 所谓的带花树算法就是，把整个圈缩成一个点，Edmonds称这个超级点为“花”，就是说，原圈里的所有点都作为外点，然后继续搜索。再之后的过程中，已经被缩的点还可能被嵌套地收缩。 当我们找到一条增广路之后，还要把路上的“花”展开。 总之，带花树的算法思想就是缩点-继续找增广路-找到之后把花展开。 这个算法的思想并不难理解、难的是实现。 -The algorithm is called with trees and flow
matlab_neat
- The Matlab NEAT package contains Matlab source code for the NeuroEvolution of Augmenting Topologies method (see the orig-The Matlab NEAT package contains Matlab source code for the NeuroEvolution of Augmenting Topologies
matlab_neat.tar
- The Matlab NEAT package contains Matlab source code for the NeuroEvolution of Augmenting Topologies method (see the orig-The Matlab NEAT package contains Matlab source code for the NeuroEvolution of Augmenting Topologies
network-graph-CPP-cometrue
- 最大流增广路算法的实现，本代码使用C++实现了最大流增广路算法-max-flow augmenting path algorithm cometure using C++.