全文获取类型
收费全文 | 1739篇 |
免费 | 243篇 |
国内免费 | 58篇 |
专业分类
化学 | 290篇 |
晶体学 | 3篇 |
力学 | 328篇 |
综合类 | 77篇 |
数学 | 721篇 |
物理学 | 621篇 |
出版年
2024年 | 2篇 |
2023年 | 17篇 |
2022年 | 26篇 |
2021年 | 25篇 |
2020年 | 42篇 |
2019年 | 30篇 |
2018年 | 32篇 |
2017年 | 56篇 |
2016年 | 74篇 |
2015年 | 52篇 |
2014年 | 76篇 |
2013年 | 101篇 |
2012年 | 95篇 |
2011年 | 87篇 |
2010年 | 69篇 |
2009年 | 65篇 |
2008年 | 80篇 |
2007年 | 94篇 |
2006年 | 84篇 |
2005年 | 88篇 |
2004年 | 90篇 |
2003年 | 90篇 |
2002年 | 83篇 |
2001年 | 77篇 |
2000年 | 47篇 |
1999年 | 59篇 |
1998年 | 66篇 |
1997年 | 66篇 |
1996年 | 40篇 |
1995年 | 50篇 |
1994年 | 34篇 |
1993年 | 36篇 |
1992年 | 34篇 |
1991年 | 17篇 |
1990年 | 5篇 |
1989年 | 11篇 |
1988年 | 15篇 |
1987年 | 5篇 |
1986年 | 4篇 |
1985年 | 4篇 |
1984年 | 6篇 |
1983年 | 1篇 |
1982年 | 2篇 |
1980年 | 2篇 |
1979年 | 1篇 |
排序方式: 共有2040条查询结果,搜索用时 15 毫秒
11.
12.
基于SUN5500小型计算机并行开发环境,给出了消息传递模型和蕴式行模型的实现方法,通过实例分析了SUNMPI实际编程,并对选取不同模型有不同参数的运算时间进行了比较,结果表明,在SUN5500计算机上MPI模型和蕴式并行模型均能较大地提高运算速度,而且MPI在灵活性和并行程度方面更优。 相似文献
13.
M. A. Posypkin I. Kh. Sigal 《Computational Mathematics and Mathematical Physics》2006,46(12):2187-2202
The efficiency of parallel implementations of the branch-and-bound method in discrete optimization problems is considered. A theoretical analysis and comparison of two parallel implementations of this method is performed. A mathematical model of the computation process is constructed and used to obtain estimates of the maximum possible speedup. Examples of problems in which none of these two parallel implementations can speed up the computations are considered. 相似文献
14.
In this paper, we introduce a new concept of semi-preemptive scheduling and we show how it can be used to derive a maximum-flow-based lower bound for the P|rj|Lmax which dominates the well-known preemptive lower bound. We show that, in some cases, the proposed bound strictly dominates the preemptive one while having the same complexity. 相似文献
15.
Mixed integer programming (MIP) models are extensively usedto aid strategic and tactical decision making in many businesssectors. Solving MIP models is a computationally intensive processand there is a need to develop solution approaches that enablelarger models to be solved within acceptable timeframes. Inthis paper, we describe the implementation of a two-stage parallelbranch and bound (PB & B) algorithm for MIP. In stage 1of the algorithm, a multiple heuristic search is implementedin which a number of alternative search trees are investigatedusing a forest search in the hope of finding a good solutionquickly. In stage 2, the search is reorganized so that the branchesof a chosen tree are investigated in parallel. A new heuristicis introduced, based on a best projection criterion, which evaluatesalternative B & B trees in order to choose one for investigationin stage 2 of the algorithm. The heuristic also serves as away of implementing a quality load balancing scheme for stage2 of the algorithm. The results of experimental investigationsare reported for a range of models taken from the MIPLIB libraryof benchmark problems. 相似文献
16.
We consider the generalization of the classical P||Cmax problem (assign n jobs to m identical parallel processors by minimizing the makespan) arising when the number of jobs that can be assigned to each processor cannot exceed a given integer k. The problem is strongly NP-hard for any fixed k > 2. We briefly survey lower and upper bounds from the literature. We introduce greedy heuristics, local search and a scatter search approach. The effectiveness of these approaches is evaluated through extensive computational comparison with a depth-first branch-and-bound algorithm that includes new lower bounds and dominance criteria. 相似文献
17.
关于非平行板电容器电容计算的讨论 总被引:4,自引:3,他引:1
用串联方法计算非平行板电容器的电容,简便地得到与其他方法相同的结果。 相似文献
18.
In this paper, we consider a queueing system in which there are two exponential servers, each having his own queue, and arriving
customers will join the shorter queue. Based on the results given in Flatto and McKean, we rewrite the formula for the probability
that there are exactlyk customers in each queue, wherek = 0, 1,…. This enables us to present an algorithm for computing these probabilities and then to find the joint distribution
of the queue lengths in the system. A program and numerical examples are given. 相似文献
19.
A parallel inexact Newton method with a line search is proposed for two-stage quadratic stochastic programs with recourse. A lattice rule is used for the numerical evaluation of multi-dimensional integrals, and a parallel iterative method is used to solve the quadratic programming subproblems. Although the objective only has a locally Lipschitz gradient, global convergence and local superlinear convergence of the method are established. Furthermore, the method provides an error estimate which does not require much extra computation. The performance of the method is illustrated on a CM5 parallel computer.This work was supported by the Australian Research Council and the numerical experiments were done on the Sydney Regional Centre for Parallel Computing CM5. 相似文献
20.
Hossam A. Zaki 《Computational Optimization and Applications》1995,4(1):23-45
State-of-the-art computational results have shown that the shortest augmenting path (SAP) methods are more efficient than other primal-dual and primal-simplex based methods for solving the linear assignment problem on uniprocessor computers. There is, however, some controversy concerning their merits when compared with Bertsekas' auction algorithm on multiprocessor computers. In this study we investigate the performance of these competing methods on the Alliant FX/8. For each method, theoretical motivation, sources of parallelism and computational results are presented. 相似文献