理学 >>> 数学 >>> 数理逻辑与数学基础 数论 代数学 代数几何学 几何学 拓扑学 数学分析 非标准分析 函数论 常微分方程 偏微分方程 动力系统 积分方程 泛函分析 计算数学 概率论 数理统计学 应用统计数学 运筹学 组合数学 离散数学 模糊数学 应用数学 数学其他学科
搜索结果: 91-101 共查到数学 Algorithms相关记录101条 . 查询时间(0.132 秒)
专著信息 书名 Convergence of cascade algorithms in Sobolev spaces associated with multiviate refinement equations 语种 英文 撰写或编译 作者 李松 第一作者单位 出版社 Journal of mathematical analysis and applications,257,154-169,2...
期刊信息 篇名 Inertial algorithms for the stationary Navier-Stokes equations 语种 英文 撰写或编译 作者 Yanren Hou,R.M.M. Mattheij 第一作者单位 刊物名称 Acta Mathematica Scientia B 页面 23(2), 219—238, 2003 出版日期 2003年 月 日 文章标识(ISS...
期刊信息 篇名 A Class of Genetic Algorithms On Bilevel Multi-Objective Decision Making Problem 语种 英文 撰写或编译 撰写 作者 滕春贤,李磊,李皓白 第一作者单位 哈尔滨理工大学 刊物名称 J.Systems Science and Systems 页面 2000,Vol.9,No.3,P290-296 出版日期...
We develop the theory of holographic algorithms. We give characterizations of algebraic varieties of realizable symmetric generators and recognizers on the basis manifold, and a polynomial time decisi...
The journal Numerical Algorithms is devoted to numerical algorithms. It publishes original and review papers on all the aspects of numerical algorithms: new algorithms, theoretical results, implementa...
The mission of the Applied Numerical Algorithms Group (ANAG) is the development of advanced numerical algorithms and software for partial differential equations integrated with the application of the ...
The Numerical Algorithms Group (NAG) specializes in the provision of software for the solution of mathematical, statistical and data mining problems. These components, together with the visualization ...
2006-12-07,This dissertation presents algorithms for data structures called distributed hash tables (DHT) or structured overlay networks, which are used to build scalable self-managing distributed sys...
In a breakthrough result, Reingold showed that the Undirected st-Connectivity problem can be solved in O(log n) space. The next major challenge in this direction is whether one can extend it to direct...
In this paper, we give graph-theoretic algorithms of linear time to the Minimum All-Ones Problem for unicyclic and bicyclic graphs. These algorithms are based on a graph-theoretic algorithm of linear ...
The local tree-width of a graph G=(V,E) is the function ltw^G: N -> N that associates with every natural number r the maximal tree-width of an r-neighborhood in G. Our main graph theoretic result is ...

中国研究生教育排行榜-

正在加载...

中国学术期刊排行榜-

正在加载...

世界大学科研机构排行榜-

正在加载...

中国大学排行榜-

正在加载...

人 物-

正在加载...

课 件-

正在加载...

视听资料-

正在加载...

研招资料 -

正在加载...

知识要闻-

正在加载...

国际动态-

正在加载...

会议中心-

正在加载...

学术指南-

正在加载...

学术站点-

正在加载...