搜索结果: 91-101 共查到“数学 Algorithms”相关记录101条 . 查询时间(0.132 秒)
Convergence of cascade algorithms in Sobolev spaces associated with multiviate refinement equations
2007/7/28
专著信息
书名
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...
Applied Numerical Algorithms Group at Lawrence Berkeley National Laboratory
numerical algorithms software 计算数学
2007/12/26
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 ...
Ali Ghodsi has successfully defended his Ph.D. thesis "Distributed k-ary System: Algorithms for Distributed Hash Tables"
algorithms hash tables dynamism
2006/12/26
Simulating Undirected st-Connectivity Algorithms on Uniform JAGs and NNJAGs
Simulating Undirected st-Connectivity
2012/11/29
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...
Linear Time Algorithms to the Minimum All-Ones Problem for Unicyclic and Bicyclic Graphs
(Minimum) All-Ones Problem graph-theoretic algorithm linear time
2014/6/3
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 ...
Local tree-width, excluded minors, and approximation algorithms
Local tree-width excluded minors approximation algorithms
2010/11/1
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 ...