Location:
Search - polynomial java
Search list
Description: 完善以前的JAVA实现的多项式相加
提供了输入系数和次数的控制-perfect before JAVA sum of the polynomial coefficients for the input and frequency control
Platform: |
Size: 7249 |
Author: 小样 |
Hits:
Description: 用JAVA写的多项式加法，用链表实现-written with Java polynomial addition, the use of chain to achieve
Platform: |
Size: 3866 |
Author: zy |
Hits:
Description: 一个一元曲线多项式数值演示例子，用于各种数据统计分析。-a one yuan polynomial curve Numerical examples demonstrate, for the statistical analysis of data.
Platform: |
Size: 594944 |
Author: 王小锋 |
Hits:
Description: 超级多项式计算器，什么都能算哦！包括字母多项式，括号，乘方都行的～-super-polynomial calculators, and what can count! Including letters polynomial, in brackets, involution are OK ~
Platform: |
Size: 17408 |
Author: 张海龙 |
Hits:
Description: 完善以前的JAVA实现的多项式相加
提供了输入系数和次数的控制-perfect before JAVA sum of the polynomial coefficients for the input and frequency control
Platform: |
Size: 7168 |
Author: 小样 |
Hits:
Description: 多项式拟合程序，开发环境，Jbuild2005-polynomial fitting procedures, development environment, Jbuild2005
Platform: |
Size: 198656 |
Author: 冯灿 |
Hits:
Description: shamir的秘密分享机制的原文。秘密分享门限机制中，利用拉格朗日插值多项式来恢复。-shamir secret-sharing mechanism in the original language. Threshold secret sharing mechanism, the use of Lagrange polynomial interpolation to restore.
Platform: |
Size: 184320 |
Author: 黄海凌 |
Hits:
Description: Shamir秘密分享算法的java实现，主要是使用平面上k点可以决定k-1次方的多项式，以k点为门槛值，应用Lagrange多项式插入方法的技术，回复原多项式，再求出主密钥。-Shamir secret sharing algorithm to achieve the java, is the use of the plane could be decided k k-1 power of the polynomial, a k-value of the threshold, Application of Lagrange polynomial method of technology insertion to restore the original polynomial, then calculated the main key.
Platform: |
Size: 5120 |
Author: linvg |
Hits:
Description: 用JAVA写的多项式加法，用链表实现-written with Java polynomial addition, the use of chain to achieve
Platform: |
Size: 3072 |
Author: zy |
Hits:
Description: matlab曲线拟合程序，可以得到函数具体解析式（多项式及精度）-matlab curve fitting procedures, can be a specific analytical function (polynomial and precision)
Platform: |
Size: 329728 |
Author: 牛犇 |
Hits:
Description: 1.n个节点分段Lagrange插值多项式；
2.使用格式y=lagrange(x0,y0,x,k)；
3.输入项x0为n维插值节点向量，y0为n维被插函数值向量；
4.x为m维插值点向量，k为分段插值多项式次数，不超过3，缺省为k=1；
5.输出y为插值点x处的函数值；- 1.n a sub-node Lagrange interpolation polynomial 2. The use of the format y = lagrange (x0, y0, x, k) 3. Input x0 of interpolation nodes for the n-dimensional vector, y0 for n-dimensional vector function to be inserted 4.x interpolation points for the m-dimensional vector, k is the number of sub-polynomial interpolation, not more than 3, the default for k = 1 5. output y for the interpolation points x Department of function
Platform: |
Size: 1024 |
Author: link |
Hits:
Description: This the polynomial function with Java,
adding, subbtracing & -This the polynomial function with Java,
adding, subbtracing & ...
Platform: |
Size: 20480 |
Author: Mehdi shakiba |
Hits:
Description: Polinomial.java编译 JAVA 课堂作业-Polinomial.java compile JAVA class operation
Platform: |
Size: 4096 |
Author: QING |
Hits:
Description: GA_Traffic
The Traveling Salesman Problem (TSP) is maybe the archetypical problem
in combinatorial optimization. This problem and its generalizations, vehicle
routing problems, have been studied for more than thirty years two entire
monographs are devoted to the subject [34, 26]. Since the TSP is NP-hard,
polynomial-time approximation algorithms are usually studied. However,
usually the approaches to the study of vehicle routing problems adopt an
offline point of view: the input is entirely known beforehand. In many
applications, this is actually not the case since the instance becomes known
in an online fashion, time after time. Even determining when the instance
is completely given could be impossible. The need for an online model then
arises naturally.-GA_Traffic
The Traveling Salesman Problem (TSP) is maybe the archetypical problem
in combinatorial optimization. This problem and its generalizations, vehicle
routing problems, have been studied for more than thirty years two entire
monographs are devoted to the subject [34, 26]. Since the TSP is NP-hard,
polynomial-time approximation algorithms are usually studied. However,
usually the approaches to the study of vehicle routing problems adopt an
offline point of view: the input is entirely known beforehand. In many
applications, this is actually not the case since the instance becomes known
in an online fashion, time after time. Even determining when the instance
is completely given could be impossible. The need for an online model then
arises naturally.
Platform: |
Size: 1024 |
Author: gardenia_roses |
Hits:
Description: 在JAVA 实现了一元稀疏多项式的加减乘除运算以及求职预算-Implemented in JAVA dollar sparse polynomial multiplication and division addition and subtraction operations and job budget
Platform: |
Size: 4096 |
Author: 刘浩源 |
Hits:
Description: It s a simple graph in java. For plot the polynomial equation.
Platform: |
Size: 5120 |
Author: AnOs |
Hits:
Description: 运用FFT计算多项式乘法：输入为两个多项式系数，输出为多项式乘积的系数。-Calculated using FFT polynomial multiplication: polynomial coefficients for both input and output coefficients of the polynomial product.
Platform: |
Size: 2048 |
Author: 李肖恩 |
Hits:
Description: 根据（0.0,0.0）（0.5,1.6）（1.0,2.0）（6.0,2.0）（7.0,1.5）（9.0,0.0）六个点使用三次样条差值求多项式并作图-According to (0.0,0.0) (0.5,1.6) (1.0,2.0) (6.0,2.0) (7.0,1.5) (9.0,0.0) using cubic spline six point margin and a polynomial mapping
Platform: |
Size: 2048 |
Author: 回忆 |
Hits:
Description: Java实现主曲线的生成过程，使用多项式线性算法。-Java implementation of the master curve generation process, using a linear polynomial algorithm.
Platform: |
Size: 116736 |
Author: 萧风 |
Hits:
Description: 可以计算多项式4则运算，这是一份完整的java计算器的大作业，可以直接使用。其中包含源代码和实验报告文档(Can calculate the polynomial 4 operation, this is a complete java calculator's large work, can be used directly. It contains the source code and the experimental report document)
Platform: |
Size: 151552 |
Author: 一路....
|
Hits: