登录
首页 » Visual C++ » PowerElick

PowerElick

于 2013-10-17 发布 文件大小:5KB
0 224
下载积分: 1 下载次数: 12

代码说明:

  for PSCAD softwear it can be very easy and coming soon challenger in this soft

文件列表:

PowerElick.psc,53347,2013-04-15

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

发表评论

0 个回复

  • Tin_Method
    离散数据生成tin的优秀代码,注释多,易于学习和移植(Discrete data generated tin excellent code, comments, easy to learn and transplantation)
    2012-05-18 13:12:23下载
    积分:1
  • VC++.NET
    一本不错的VC.net控件书,可以对你的开发有所启发(A good book VC.net controls can be a source of inspiration to develop your)
    2008-08-01 22:37:28下载
    积分:1
  • OpenGL_1
    OpenGL实现变压器油气分析的立体图示法(OpenGL to achieve three-dimensional analysis of transformer oil and gas law Icon)
    2009-06-17 08:00:51下载
    积分:1
  • 2D-TM
    fdtd arithmetic 计算二维tm波(fdtd arithmetic calculation of two-dimensional wave tm)
    2007-04-25 11:40:26下载
    积分:1
  • splinewidget
    VTK对格式为DICOM医学数据重建后,利用VTKsplinewidget类对其作进行曲线,并能利用鼠标对其人机操作。(VTK format for DICOM medical data reconstruction after VTKsplinewidget class its for the curve, and can use the mouse to its man-machine.)
    2020-10-27 10:29:59下载
    积分:1
  • shutdown
    说明:  VC++6.0编译,实现关机、重启、注销功能的实现(VC++6.0 compiler to achieve shutdown, restart, log off function of the realization)
    2011-04-12 20:06:48下载
    积分:1
  • TCP-UDP
    TCP与UDP源代码测试程序,方便初学者观看,理解。用VC写的,容易读懂。。(TCP and UDP code for ABC to use)
    2012-06-17 11:38:04下载
    积分:1
  • ipopt-3.1.0.tar
    线性、非线性规划的一个算法 ipopt算法,解决非线性优化的一个算法,www.coin.org,非常有效率(ipopt算法,解决非线性优化的一个算法,www.coin.org,非常有效率)
    2010-12-12 11:51:49下载
    积分:1
  • zoj1094
    zoj094 Matrix multiplication problem is a typical example of dynamical programming. Suppose you have to evaluate an expression like A*B*C*D*E where A,B,C,D and E are matrices. Since matrix multiplication is associative, the order in which multiplications are performed is arbitrary. However, the number of elementary multiplications needed strongly depends on the evaluation order you choose. For example, let A be a 50*10 matrix, B a 10*20 matrix and C a 20*5 matrix. There are two different strategies to compute A*B*C, namely (A*B)*C and A*(B*C). The first one takes 15000 elementary multiplications, but the second one only 3500. Your job is to write a program that determines the number of elementary multiplications needed for a given evaluation strategy. (Matrix multiplication problem is a typical example of dynamical programming. Suppose you have to evaluate an expression like A*B*C*D*E where A,B,C,D and E are matrices. Since matrix multiplication is associative, the order in which multiplications are performed is arbitrary. However, the number of elementary multiplications needed strongly depends on the evaluation order you choose. For example, let A be a 50*10 matrix, B a 10*20 matrix and C a 20*5 matrix. There are two different strategies to compute A*B*C, namely (A*B)*C and A*(B*C). The first one takes 15000 elementary multiplications, but the second one only 3500. Your job is to write a program that determines the number of elementary multiplications needed for a given evaluation strategy. )
    2012-06-10 10:38:53下载
    积分:1
  • utlab
    模糊规划,模糊优化模拟,神经网络,遗传算法,matlab与VC交互(Optimize fuzzy simulation, neural networks, genetic algorithms)
    2009-02-21 20:00:07下载
    积分:1
  • 696518资源总数
  • 106182会员总数
  • 24今日下载