关于复数计算的简单程序

应用背景 拼图小游戏源码说明 主要用于C#算法的学习与应用 面向对象的编程方法 拼图的事件处理 判断是否过关的最方便的算法 键盘控制和鼠标控制的方法 关键技术GDI+ 绘图方法、鼠标和键盘事件处理、面向对象、最优的判断是否过关的方法、拼图随机打乱方法

kelebihan, namun manusia tetap memiliki berbagai kelemahan seperti mudah lelah, mudah lupa, dipengaruhi emosi, subjektif, kurang teliti, malas, dan sebagainya. Kemudian muncul ide untuk menciptakan komputer sebagai alat bantu kerja agar lebih cepat, dan lebih akurat. Namun saat ini komputer tidak hanya mampu bertindak tetapi juga mampu berfikir sehingga muncul istilah Artificial Intellegence (AI) atau Kecerdasan Buatan. Minimax merupakan salah satu contoh dari Kecerdasan Buatan, minimax adalah suatu algoritma yang menggunakan teknik pencarian Depth-First Search dengan kedalaman terbatas. Adapun media yang cocok untuk penerapan algoritma minimax adalah permainan Tic-Tac-Toe, beberapa alasan mengapa Tic- Tac-Toe

PQ分解法潮流计算程序。既可以用于高压输电网的潮流解算，又可以用于低压配电网的潮流解算，还可以同时解算输电网 加配电网的混合潮流问题。-PQ decomposition process flow calculation. Both high-voltage transmission networks can be used to calculate the trend, but also can be used in the trend of low voltage distribution network solver, but also at the same time increase the supply grid solver distribution network issues mixed trend.

under Gcc compiler，sd card and mmc card basic functions-under may refer compiler, sd card and basic functions mmc card

全选主元高斯消去法agaus.c--返回零表示原方程组的系数矩阵奇异，返回的标志值不为零，则表示正常返回。-entire election PCA Gaussian Elimination agaus.c--return to the original equation is expressed by the coefficient matrix, a sign of the return value is not zero, then returned to normal.

It s a simple Parser That calculates mathematic operations.You give an input and it starts the calculation by showing you the parsing operation in real-time.

数学经典算法应用:贪婪算法的应用实例-Application of the classical algorithm: the application of the greedy algorithm

禁忌搜索法对初始解、邻域个数及禁忌列表的大小等参数有比较严格的要求, 这些参数直接影响着算法的优化能 力。文章提出了一种改进的禁忌搜索法, 它用有效空间来压缩搜索范围, 这样可以提高搜索效率和全局搜索能力。用短期 和长期禁忌列表存储器来保证算法能搜索到全局空间的每一点, 并且不重复搜索。经过验算和分析, 证明它是一种较好的 全局启发式搜索法-Tabu search method, the initial solution, neighborhood and tabu list size of the number of parameters such as have more stringent requirements, these parameters directly affect the ability to optimize the algorithm. This paper presents an improved tabu search method, it is used effectively to compress the search space, so that can improve search efficiency and global search capabilities. Short-term and long-term memory tabu list to ensure the algorithm to search to the global space, each point, and do not repeat the search. After checking and analysis, to prove that it is a good global heuristic search method

最速下降法是以负梯度方向作为下降方向的极小化算法，本程序用该方法求解n元正定二次函数的极小值-Steepest descent method is based on the negative gradient direction as a decline in the direction of the minimization algorithm, this procedure using this method for solving n-positive definite quadratic function of the minimum

浙江大学程序设计大赛ACM2478题我自己收集的-Zhejiang University Design Competition ACM2478 that my own collection