登录
首页 » AI-NN-PR » 求最优值的一个算法

求最优值的一个算法

于 2022-11-07 发布 文件大小:1.39 kB
0 133
下载积分: 2 下载次数: 1

代码说明:

求最优值的一个算法-seeking an optimal value of the algorithm

下载说明:请别用迅雷下载,失败请重下,重下不扣分!

发表评论

0 个回复

  • 机器博弈机器搜索算法的研究,做acm与人工智能的可以参考下...
    机器博弈机器搜索算法的研究,做acm与人工智能的可以参考下-Machine Game Machine search algorithm research, acm to do with artificial intelligence can refer to the next
    2022-01-25 20:46:40下载
    积分:1
  • application of nsga
    这是一个nsga的应用问题。算法可能不是最优的。-application of nsga
    2022-12-21 17:15:04下载
    积分:1
  • 一种图像源文本识别软件,以确定给定的文本和图像…
    一个图像文字识别软件源码,可以识别给定图像上的文字并导出文档-An image source text recognition software to identify a given text and images on export documentation
    2023-02-22 04:25:03下载
    积分:1
  • an artificial intelligence platforms can be very convenient to some of your code...
    人工智能一个运行平台,可以很方便的将你的一些代码的执行-an artificial intelligence platforms can be very convenient to some of your code implementation
    2022-09-29 03:20:10下载
    积分:1
  • K-均值聚类算法的编程实现。包括逐点聚类和批处理聚类。K-均值聚类的的时间复杂度是n*k*m,其中n为样本数,k为类别数,m为样本维数。这个时间复杂度是相当客观的。因为如果用每秒10亿次的计算机对50个样本采用穷举法分两类,寻找最优,列举一遍约66.7天,分成3类,则要约3500万年。针对算法局部最优的缺点,本人正在编制模拟退火程序进行改进。希望及早奉给大家,倾听高手教诲。-K-means clustering algorithm programming. Point by point, including clustering and clustering batch. K-means clustering of the time complexity of n* k* m, n samples, several types of k, m sample dimension. The time complexity is a very objective. Because if we use one billion times per second the computer using 50 samples of two exhaustive method to find the optimal set out again about 66.7 days, divided into three categories, offering 3,500 years. Local optimal algorithm against the shortcomings, I was prepared simulated annealing process improvements. Early Feng hope for everyone, listen to the master teachings.
    2022-01-28 00:58:44下载
    积分:1
  • Locally weighted polynomial regression LWPR is a popular instance based al go...
    Locally weighted polynomial regression LWPR is a popular instance based al gorithm for learning continuous non linear mappings For more than two or three in puts and for more than a few thousand dat apoints the computational expense of pre dictions is daunting We discuss drawbacks with previous approaches to dealing with this problem
    2022-04-07 03:30:50下载
    积分:1
  • VC中利用人工智能解决八迷宫问题。这是一个很有趣的人工智能小程序,不妨试试看。...
    VC中利用人工智能解决八迷宫问题。这是一个很有趣的人工智能小程序,不妨试试看。-use artificial intelligence to solve eight problems maze. This is a very interesting small artificial intelligence procedures, it may try.
    2022-03-19 18:15:34下载
    积分:1
  • 此程序用于测试神经元的库函数 // 它展示了怎样用这个库所生成的多层BP网络来求解宇称问题...
    此程序用于测试神经元的库函数 // 它展示了怎样用这个库所生成的多层BP网络来求解宇称问题-this procedure for testing neuronal function of the library// it tells how to use this library generated by the multi-storey BP network to solve problems Parity
    2022-01-24 10:08:12下载
    积分:1
  • 可用于bp,elman,rbf,grnn四种神经网络的预测命令
    可用于bp,elman,rbf,grnn四种神经网络的预测命令-Can be used for bp, elman, rbf, grnn four types of neural network prediction order
    2022-04-29 11:16:17下载
    积分:1
  • Genetic Algorithm NSGA
    NSGA-II遗传算法的文档,里面的内容比较好理解,是学习遗传算法的必备知识-Genetic Algorithm NSGA-II of the document, which is better understanding of the content is a genetic algorithm to learn the knowledge necessary
    2022-06-27 09:55:23下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载