登录
首页 » Java » callender

callender

于 2014-09-16 发布 文件大小:19KB
0 171
下载积分: 1 下载次数: 1

代码说明:

  It is a call ender application

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

发表评论

0 个回复

  • Q1_3
    bellman 方程的matlab实现,十分不错的源代码(bellman function matlab)
    2009-12-18 20:53:09下载
    积分:1
  • tls_esprit
    总体最小二乘的esprit的一种编程方法,主要按照其原理来编写的程序(Total least squares of a kind of esprit programming method, and according to the principle of the main to program)
    2021-02-25 16:39:38下载
    积分:1
  • IntroductiontoMATLAB
    a good introduction to Matlab for enginnering and to the student in university as well.
    2010-05-11 09:24:24下载
    积分:1
  • duocemian
    多侧面程序,相关问题参加粗糙集条件属性约简程序,相关问题参加粗糙集条件属性约简程序,相关问题参加粗糙集(duocem)
    2010-06-01 22:51:37下载
    积分:1
  • consumer
    信号量同步之生产者代码,使用c写的,希望对你们有用(Semaphore synchronization of the producer code, using c write, I hope useful to you)
    2014-12-13 12:30:34下载
    积分:1
  • Fingerprint_Minutiae_Extraction
    指纹识别      (FingerPrint Recognition )
    2015-04-10 22:56:25下载
    积分:1
  • lap_dynp
    transformée de laplace dynamique
    2014-01-08 12:57:52下载
    积分:1
  • 2009
    水库新分配入厂人员培训计划书(培训计划)(The new distribution reservoir into the plant personnel training plan (training plan))
    2010-08-11 17:05:39下载
    积分:1
  • Software-IA-03-Particle-swarm-optimization-em-Mat
    In computer science, particle swarm optimization (PSO) is a computational method that optimizes a problem by iteratively trying to improve a candidate solution with regard to a given measure of quality.
    2014-09-18 21:10:52下载
    积分:1
  • gradient descent
    说明:  梯度下降法是一個一階最佳化算法,通常也稱為最速下降法。 要使用梯度下降法找到一個函數的局部極小值,必須向函數上當前點對應梯度(或者是近似梯度)的反方向的規定步長距離點進行疊代搜索。如果相反地向梯度正方向疊代進行搜索,則會接近函數的局部極大值點;這個過程則被稱為梯度上升法。(The gradient descent method is a first-order optimization algorithm, also commonly referred to as the steepest descent method. To find the local minimum of a function using the gradient descent method, an iterative search must be performed to the specified step distance point in the opposite direction of the gradient (or approximate gradient) of the current point on the function. If the search is reversed in the opposite direction to the positive direction of the gradient, it will approach the local maximum point of the function; this process is called the gradient ascent method.)
    2019-02-21 23:13:19下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载