-
1
说明： GN算法是一种分裂型的社区结构发现算法。该算法根据网络中社区内部高内聚、社区之间低内聚的特点，逐步去除社区之间的边，取得相对内聚的社区结构。(GN algorithm is a divisive community structure discovery algorithm. According to the characteristics of high cohesion within the community and low cohesion between communities, the algorithm gradually removes the edges between the communities and achieves a relatively cohesive community structure.)
- 2017-07-21 19:54:42下载
- 积分：1
-
IIVQZLY2
用蚁群算法求解TSP问题,最大的特点是有详细的中文注释()
- 2018-05-12 06:09:40下载
- 积分：1
-
hnaegrity
这是LSSVM最小二乘仿真程序,希望对大家有用！()
- 2018-03-15 23:13:39下载
- 积分：1
-
logminer总结
如何使用logminer做oracle日志分析(How to use logminer to do Oracle log analysis)
- 2020-06-18 16:20:02下载
- 积分：1
-
Xztration-Multicondition-Research
运筹学大作业：实现多条件最大运筹与最小运筹的最佳方案计算与价值预测(Operational Research Big Operation: the Best Scheme calculation and value Prediction for realizing Multi-condition maximum and minimum operational Research)
- 2018-11-22 08:59:06下载
- 积分：1
-
2002－2017地级市资本存量数据集
说明： 此压缩文件包含2002年-2017年200多个地级市资本存量的数据，里面有详细的计算过程与说明。(This document contains the capital stock data of more than 200 cities in 2002-2017, including detailed calculation process and description, which is convenient for scholars to understand and master)
- 2021-01-08 09:28:52下载
- 积分：1
-
AUXB
实现了克里金插值算法,在地质钻孔的加密和其他工程应用方面有重要的作用()
- 2018-02-05 09:18:22下载
- 积分：1
-
edge
工程算法 这是一个很有用的工程数值算法集锦(Engineering algorithm this is a useful collection of engineering numerical algorithms.)
- 2018-09-05 06:04:58下载
- 积分：1
-
216663
对二进制序列进行失配滤波算法,使相对有效性最大()
- 2018-05-13 11:30:14下载
- 积分：1
-
Python-for-Finance-Second-Edition-master
Python是一种面向对象、解释型计算机程序设计语言，其应用领域非常广泛，包括数据分析、自然语言处理、机器学习、科学计算以及推荐系统构建等。 本书用Python语言来讲解算法的分析和设计。本书主要关注经典的算法，但同时会为读者理解基本算法问题和解决问题打下很好的基础。(Python is an object-oriented, interpretive computer programming language. It has a wide range of applications, including data analysis, natural language processing, machine learning, scientific computing and recommendation system construction. This book uses Python language to explain the analysis and design of algorithms. This book focuses on classical algorithms, but at the same time it will lay a good foundation for readers to understand basic algorithms and solve problems. The book consists of 11 chapters. The tree, graph, counting problem, inductive recursion, traversal, decomposition and merging, greedy algorithm, complex dependency, Dijkstra algorithm, matching and cutting problem, difficult problem and its dilution are introduced. The book has exercises and reference materials at the end of each chapter, which provides readers with more convenience for self-examination and further stu)
- 2018-11-24 15:20:49下载
- 积分：1
|
联系客服（QQ：3324461878）
