期刊文献+
任意字段
题名或关键词
题名
关键词
摘要
作者
第一作者
机构
刊名
分类号
参考文献
作者简介
基金资助
栏目信息
共找到2篇文章
< 1 >
每页显示 20 50 100
已选0条
引用分析
参考文献
引证文献
 统计分析
检索结果
已选文献
显示方式：
Laminated Wave Turbulence: Generic Algorithms Ⅱ 认领 引用
1
作者 Elena Kartashova Alexey Kartashov 《Communications in Computational Physics》 SCIE 2007年第4期783-794,共12页
The model of laminated wave turbulence puts forth a novel computational problem–construction of fast algorithms for finding exact solutions of Diophantine equations in integers of order 1012 and more.The equations... The model of laminated wave turbulence puts forth a novel computational problem–construction of fast algorithms for finding exact solutions of Diophantine equations in integers of order 1012 and more.The equations to be solved in integers are resonant conditions for nonlinearly interacting waves and their form is defined by the wave dispersion.It is established that for the most common dispersion as an arbitrary function of a wave-vector length two different generic algorithms are necessary:(1)one-class-case algorithm for waves interacting through scales,and(2)two-class-case algorithm for waves interacting through phases.In our previous paper we described the one-class-case generic algorithm and in our present paper we present the two-classcase generic algorithm. 展开更多
关键词 Laminated wave turbulence discrete wave systems computations in integers transcendental algebraic equations complexity of algorithm.
A Study of Travelling Salesman Problem 认领 引用 被引量：1
2
作者 WANGLin-lin WANGJin 《The Journal of China Universities of Posts and Telecommunications》 2001年第1期15-19,共5页
The Travelling Salesman Problem ( TSP ) is one of the most difficult problems that many scholars all over the world are studying. This paper points out the disparity between the definition and the classical solution t... The Travelling Salesman Problem ( TSP ) is one of the most difficult problems that many scholars all over the world are studying. This paper points out the disparity between the definition and the classical solution to TSP and its practical applications, and then presents a new definition of TSP and its effective algorithm conforming to practical applications, thus making TSP practically more valuable. 展开更多
关键词 TSP algorithm complexity of algorithm
暂未订购 下载PDF
已选0条
引用分析
参考文献
引证文献
 统计分析
检索结果
已选文献
上一页 1 下一页 到第 页
在线咨询 使用帮助 返回顶部 意见反馈