搜索资源列表
rs32_28_v1_1_tar
- RS码是Reed-Solomon 码（理德－所罗门码）的简称，它是一类非二进制BCH码，在RS码中，输入信号分成k·m比特一组，每组包括k个符号，每个符号由m个比特组成-RS Reed-Solomon codes (Li-teh-Solomon code) in the short, it is a non-binary BCH, the RS code, the input signal into a bit k m groups,
imp.tar
- 一个求网络K最短路的计算程序，用Fortran语言写的。-a network K for the most short-circuit the computational procedures used to write the Fortran language.
Senfore_DragDrop_v4.1
- Drag and Drop Component Suite Version 4.1 Field test 5, released 16-dec-2001 ?1997-2001 Angus Johnson & Anders Melander http://www.melander.dk/delphi/dragdrop/ ------------------------------------------- Table of Co
rs32_28_v1_1_tar
- RS码是Reed-Solomon 码（理德－所罗门码）的简称，它是一类非二进制BCH码，在RS码中，输入信号分成k·m比特一组，每组包括k个符号，每个符号由m个比特组成-RS Reed-Solomon codes (Li-teh-Solomon code) in the short, it is a non-binary BCH, the RS code, the input signal into a bit k m groups,
imp.tar
- 一个求网络K最短路的计算程序，用Fortran语言写的。-a network K for the most short-circuit the computational procedures used to write the Fortran language.
k-shortpath
- 本程序是K条最短路算法测试程序,陈艳艳老师的K条路算法。程序求3条最短路，约束条件值可以设定,约束值越小，多路径共用路段越多。-Article K of the procedure is the shortest path algorithm to test procedures, Yan-Yan Chen K teacher path algorithm. Procedures for the three short-circuit,
R-Opt-Lin-Kernighan
- Lin-Kernighan的R-Opt算法。主要思想是CLK，小规模的TSP可以在很短的时间内都到最优解。-Lin-Kernighan algorithm for the R-Opt. The main idea is CLK, small-scale TSP can be in a very short period of time have gone to the optimal solution.
KD_Tree
- KD_Tree In computer science, a kd-tree (short for k-dimensional tree) is a space-partitioning data structure for organizing points in a k-dimensional space. kd-trees are a useful data structure for several applications,
kdtree
- In computer science, a kd-tree (short for k-dimensional tree) is a space-partitioning data structure for organizing points in a k-dimensional space. kd-trees are a useful data structure for several applications, such as
short-path
- 运筹学中求最短路，k短路，或网路中的排序问题。-Operations research, seeking the shortest path, k short circuit, or network in the scheduling problem.
19_M-W-K-D-D_SPA2010_final
- This paper presents results of speaker recognition experiments using short Polish sentences. We developed and analyzed various vector quantization representations in order to first maximize identification effectiveness a
k-way
- K最短路问题。大家现在已经知道了如何求单源点最短路径问题，但在实际应用中，有时候需要除了需要知道最短路径外，尚需求解次最短路或第三最短路，即要知道多条最短路，并排出其长度增加的顺序。如在通信网络中，有时候某条线路中断，则需要找一个替代的方案，这就需要找到几条最短路以备不时之需。这样一类多条最短路问题即称为K最短路问题。-K shortest path problem. We now know how to find single sou
KSP
- dijkstra第k条最短路径算法 Dijkstra(迪杰斯特拉)算法是典型的最短路径路由算法，用于计算一个节点到其他所有节点的最短路径。-dijkstra Kth shortest path algorithm
K-match
- K-近似匹配，动态规划法。输入两个文本和编辑距离k，找出k以内的文本匹配情况。代码很短短，没有相当算法功底很难看懂。最好参考经典的算法设计书籍。-K-approximate matching, dynamic programming method. Two input text and edit distance k, find k within the text to match. The code is a short, not q
the_k_shortest_path
- 第k短路算法，用A*算法和优先队列实现。查找任意两点间的第k短路，时间复杂度O(NLOGN)-K-shortest path algorithm, A* algorithm and priority queue. Find the first k short circuit between any two points, the time complexity of O (NLOGN)
k-SHORT
- 自己编写的matlab程序，通过分类寻找实现了K最短路算法-Looking through the classification algorithm to achieve the shortest K
ikvStockChart-master
- Features 当前最新版本：0.1.5 支持在 XML 布局文件和代码中设置各个线条颜色、大小配置 支持左滑、右滑加载 支持长按高亮、短按点击、双指缩放事件 支持 fling 滑动 支持 MACD、RSI、KDJ、BOLL 四个指标 支持自定义的指标显示方式(Features Current version: 0.1.5 Supports setting the line color a
九阴真经 2018 8 18
- 九阴真经交易系统，以1-5---15--30--60---4小时--日--周--月-周期为主。 所有的技术分析软件中都可以在某一时间周期的K线图中找到相对应的macd。 由于macd对价格趋势有一定的比照作用，所以，它对于技术分析相当重要。 一般以1--5--15--30分钟周期分析短期走势， 以60、4小时-日线--周线分析中长期走势， 而以1--30分钟K线的macd做短线操作，以周、月、年K线
三色线交易助手
- 在K显示画趋势线 价格碰到了自动成交 ,可以设置止盈止损等，红色线做多黄色线做空，白色线平仓(In K shows that the trend line prices encountered automatic transactions, you can set the stop gain stop loss, red line to do more than the yellow line short, white line liq
趋势一次一单
- 自己正在用的趋势EA，一次一单，目前的成功率高达89.8%，每单带止损止盈，不网格，不加仓，，每单带止损止盈。 策略主要是根据布林带来作为开单条件的，该策略主要运行在30分钟，基于M30来 判断短线趋势，当波动性发生变化时，趋势触发，EA将在这个点位进场。EA有固定的止损止盈，同时也增加了移动的止损止盈。(I am using the trend EA, one order at a time, the current succ