全文获取类型
收费全文 | 84篇 |
免费 | 17篇 |
国内免费 | 4篇 |
专业分类
化学 | 7篇 |
晶体学 | 2篇 |
力学 | 3篇 |
综合类 | 2篇 |
数学 | 42篇 |
物理学 | 49篇 |
出版年
2020年 | 1篇 |
2019年 | 1篇 |
2018年 | 2篇 |
2017年 | 2篇 |
2016年 | 3篇 |
2015年 | 4篇 |
2014年 | 9篇 |
2013年 | 3篇 |
2012年 | 3篇 |
2011年 | 3篇 |
2010年 | 4篇 |
2009年 | 4篇 |
2008年 | 4篇 |
2007年 | 6篇 |
2006年 | 3篇 |
2005年 | 5篇 |
2004年 | 3篇 |
2003年 | 5篇 |
2002年 | 5篇 |
2001年 | 6篇 |
2000年 | 3篇 |
1999年 | 5篇 |
1998年 | 2篇 |
1997年 | 5篇 |
1996年 | 3篇 |
1995年 | 4篇 |
1994年 | 1篇 |
1993年 | 3篇 |
1992年 | 1篇 |
1986年 | 1篇 |
1981年 | 1篇 |
排序方式: 共有105条查询结果,搜索用时 31 毫秒
1.
COSEARCH: A Parallel Cooperative Metaheuristic 总被引:1,自引:0,他引:1
In order to design a well-balanced metaheuristic for robustness, we propose the COSEARCH approach which manages the cooperation
of complementary heuristic methods via an adaptive memory which contains a history of the search already done. In this paper,
we present the idiosyncrasies of the COSEARCH approach and its application for solving large scale instances of the quadratic
assignment problem (QAP). We propose an original design of the adaptive memory in order to focus on high quality regions of
the search and avoid attractive but deceptive areas. For the QAP, we have hybridized three heuristic agents of complementary
behaviours: a Tabu Search is used as the main search algorithm, a Genetic Algorithm is in charge of the diversification and
a Kick Operator is applied to intensify the search. The evaluations have been executed on large scale network of workstations
via a parallel environment which supports fault tolerance and adaptive dynamic scheduling of tasks. 相似文献
2.
For the parallel integration of stiff initial value problems (IVPs) three main approaches can be distinguished: approaches based on parallelism across the problem, on parallelism across the method and on parallelism across the steps. The first type of parallelism does not require special integration methods can be exploited within any available IVP solver. The methodparallel approach received some attention in the case of Runge-Kutta based methods. For these methods, the required number of processors is roughly half the order of the generating Runge-Kutta method and the speed-up with respect to a good sequential IVP solver is about a factor 2. The third type of parallelism (step-parallelism) can be achieved in any IVP solver based on predictor-corrector iteration. Most step-parallel methods proposed so far employ a large number of processors, but lack the property of robustness, due to a poor convergence behaviour in the iteration process. Hence, the effective speed-up is rather poor. The step-parallel iteraction process proposed in the present paper is less massively parallel, but turns out to be sufficiently robust to solve the four-stage Radau IIA corrector used in our experiments within a few effective iterations per step and to achieve speed-up factors up to 10 with respect to the best sequential codes.The research reported in this paper was partly supported by the Technology Foundation (STW) in the Netherlands. 相似文献
3.
Nahid Emad 《Numerical Algorithms》1996,11(1):159-179
We make use of the Padé approximants and the Krylov sequencex, Ax,,...,A
m–1
x in the projection methods to compute a few Ritz values of a large hermitian matrixA of ordern. This process consists in approaching the poles ofR
x()=((I–A)–1
x,x), the mean value of the resolvant ofA, by those of [m–1/m]Rx(), where [m–1/m]Rx() is the Padé approximant of orderm of the functionR
x(). This is equivalent to approaching some eigenvalues ofA by the roots of the polynomial of degreem of the denominator of [m–1/m]Rx(). This projection method, called the Padé-Rayleigh-Ritz (PRR) method, provides a simple way to determine the minimum polynomial ofx in the Krylov subspace methods for the symmetrical case. The numerical stability of the PRR method can be ensured if the projection subspacem is sufficiently small. The mainly expensive portion of this method is its projection phase, which is composed of the matrix-vector multiplications and, consequently, is well suited for parallel computing. This is also true when the matrices are sparse, as recently demonstrated, especially on massively parallel machines. This paper points out a relationship between the PRR and Lanczos methods and presents a theoretical comparison between them with regard to stability and parallelism. We then try to justify the use of this method under some assumptions. 相似文献
4.
5.
6.
7.
从原子到大分子体系的计算机模拟——计算化学50年 总被引:2,自引:0,他引:2
本文综述并修订了从20世纪50年代末至今,我们在计算化学领域所做的一些有意义的工作。序言部分把我们的工作置于当代科学的背景之下。然后我们以一种经典的基准测试体系——一种新的单粒子表象(即替代传统的原子和分子自旋轨道的化学自旋轨道)所构建的氢分子(H2)波函数——作为开始。用Hartree-Fock-Heitler-Lo... 相似文献
8.
Parallel local search 总被引:2,自引:0,他引:2
We present a survey of parallel local search algorithms in which we review the concepts that can be used to incorporate parallelism
into local search. For this purpose we distinguish between single-walk and multiple-walk parallel local search and between
asynchronous and synchronous parallelism. Within the class of single-walk algorithms we differentiate between multiple-step
and single-step parallelism. To describe parallel local search we introduce the concepts of hyper neighborhood structures
and distributed neighborhood structures. Furthermore, we present templates that capture most of the parallel local search
algorithms proposed in the literature. Finally, we discuss some complexity issues related to parallel local search. 相似文献
9.
Mathematical stencil and its application in finite difference approximation to the poisson equation 总被引:1,自引:0,他引:1
FENG Hui~ ZHANG Baolin~ 《中国科学A辑(英文版)》2005,48(10):1421-1429
The concept of mathematical stencil and the strategy of stencil elimination for solving the finite difference equation is presented,and then a new type of the iteration algo- rithm is established for the Poisson equation.The new algorithm has not only the obvious property of parallelism,but also faster convergence rate than that of the classical Jacobi iteration.Numerical experiments show that the time for the new algorithm is less than that of Jacobi and Gauss-Seidel methods to obtain the same precision,and the computational velocity increases obviously when the new iterative method,instead of Jacobi method,is applied to polish operation in multi-grid method,furthermore,the polynomial acceleration method is still applicable to the new iterative method. 相似文献
10.