全文获取类型
收费全文 | 7164篇 |
免费 | 431篇 |
国内免费 | 502篇 |
专业分类
化学 | 295篇 |
晶体学 | 2篇 |
力学 | 362篇 |
综合类 | 80篇 |
数学 | 3730篇 |
物理学 | 672篇 |
综合类 | 2956篇 |
出版年
2024年 | 11篇 |
2023年 | 57篇 |
2022年 | 90篇 |
2021年 | 89篇 |
2020年 | 109篇 |
2019年 | 105篇 |
2018年 | 104篇 |
2017年 | 103篇 |
2016年 | 141篇 |
2015年 | 152篇 |
2014年 | 265篇 |
2013年 | 360篇 |
2012年 | 320篇 |
2011年 | 350篇 |
2010年 | 326篇 |
2009年 | 470篇 |
2008年 | 484篇 |
2007年 | 592篇 |
2006年 | 478篇 |
2005年 | 417篇 |
2004年 | 371篇 |
2003年 | 345篇 |
2002年 | 353篇 |
2001年 | 260篇 |
2000年 | 242篇 |
1999年 | 203篇 |
1998年 | 197篇 |
1997年 | 158篇 |
1996年 | 160篇 |
1995年 | 130篇 |
1994年 | 97篇 |
1993年 | 85篇 |
1992年 | 73篇 |
1991年 | 53篇 |
1990年 | 52篇 |
1989年 | 39篇 |
1988年 | 50篇 |
1987年 | 31篇 |
1986年 | 31篇 |
1985年 | 23篇 |
1984年 | 29篇 |
1983年 | 7篇 |
1982年 | 18篇 |
1981年 | 10篇 |
1980年 | 12篇 |
1979年 | 10篇 |
1978年 | 14篇 |
1977年 | 9篇 |
1976年 | 7篇 |
1975年 | 2篇 |
排序方式: 共有8097条查询结果,搜索用时 15 毫秒
31.
This paper presents a unified analysis of decomposition algorithms for continuously differentiable optimization problems defined on Cartesian products of convex feasible sets. The decomposition algorithms are analyzed using the framework of cost approx imation algorithms. A convergence analysis is made for three decomposition algorithms: a sequential algorithm which extends the classical Gauss-Seidel scheme, a synchronized parallel algorithm which extends the Jacobi method, and a partially asynchronous parallel algorithm. The analysis validates inexact computations in both the subproblem and line search phases, and includes convergence rate results. The range of feasible step lengths within each algorithm is shown to have a direct correspondence to the increasing degree of parallelism and asynchronism, and the resulting usage of more outdated information in the algorithms. 相似文献
32.
We present a numerical implementation of the parallel gradient distribution (PGD) method for the solution of large-scale unconstrained optimization problems. The proposed parallel algorithm is characterized by a parallel phase which exploits the portions of the gradient of the objective function assigned to each processor; then, a coordination phase follows which, by a synchronous interaction scheme, optimizes over the partial results obtained by the parallel phase. The parallel and coordination phases are implemented using a quasi-Newton limited-memory BFGS approach. The computational experiments, carried out on a network of UNIX workstations by using the parallel software tool PVM, show that parallelization efficiency was problem dependent and ranged between 0.15 and 8.75. For the 150 problems solved by PGD on more than one processor, 85 cases had parallelization efficiency below 1, while 65 cases had a parallelization efficiency above 1. 相似文献
33.
该文给出了帐篷映射产生的迭代序列Cesaro平均收敛的条件.研究了它与实数二进展式度量性质之间的联系. 相似文献
34.
Joseph Y.-T. Leung 《Discrete Applied Mathematics》2007,155(8):945-970
We consider the problem of scheduling orders for multiple different product types in an environment with m dedicated machines in parallel. The objective is to minimize the total weighted completion time. Each product type is produced by one and only one of the m dedicated machines; that is, each machine is dedicated to a specific product type. Each order has a weight and may also have a release date. Each order asks for certain amounts of various different product types. The different products for an order can be produced concurrently. Preemptions are not allowed. Even when all orders are available at time 0, the problem has been shown to be strongly NP-hard for any fixed number (?2) of machines. This paper focuses on the design and analysis of efficient heuristics for the case without release dates. Occasionally, however, we extend our results to the case with release dates. The heuristics considered include some that have already been proposed in the literature as well as several new ones. They include various static and dynamic priority rules as well as two more sophisticated LP-based algorithms. We analyze the performance bounds of the priority rules and of the algorithms and present also an in-depth comparative analysis of the various rules and algorithms. The conclusions from this empirical analysis provide insights into the trade-offs with regard to solution quality, speed, and memory space. 相似文献
35.
A. A. Dokukin 《Computational Mathematics and Mathematical Physics》2006,46(5):914-918
To validate approximate optimization schemes for estimate calculation algorithms (ECAs), it is necessary to compute the optimal height, which cannot be done in a reasonable amount of time. A variety of samples are built for which the optimal height of the ECAs is known by construction. 相似文献
36.
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. 相似文献
37.
Jian‐guo Tang 《Mathematical Methods in the Applied Sciences》2006,29(11):1327-1338
An implicit iterative method is applied to solving linear ill‐posed problems with perturbed operators. It is proved that the optimal convergence rate can be obtained after choosing suitable number of iterations. A generalized Morozov's discrepancy principle is proposed for the problems, and then the optimal convergence rate can also be obtained by an a posteriori strategy. The convergence results show that the algorithm is a robust regularization method. Copyright © 2006 John Wiley & Sons, Ltd. 相似文献
38.
现代优化计算方法在蛋白质结构预测中的应用 总被引:2,自引:1,他引:1
现代优化计算方法在蛋白质结构预测中占有重要地位.简要地介绍了模拟退火算法,遗传算法,人工神经网络和图论算法在蛋白质结构预测中的应用.对国内外近年来应用这些算法,特别是在蛋白质构象搜索问题中,解决蛋白质结构预测的研究作了回顾,并分析、比较了这几种算法的效果和特点. 相似文献
39.
M.Z. Arslanov 《Operations Research Letters》2007,35(5):636-644
We consider the problem of guillotine cutting a rectangular sheet into two rectangular pieces without rotations. The question is whether there exists a cutting pattern with given numbers of occurrences of both rectangular pieces. A polynomial time algorithm is described to construct the convex hull of solutions to this problem. 相似文献
40.
Alexander Kolokolov Nikolay Kosarev 《Journal of Mathematical Modelling and Algorithms》2006,5(2):189-199
In this paper the algorithms for solving the p-median problem based on the Benders decomposition are investigated. A family of problems hard for solving with such algorithms is constructed and then generalized to a special NP-hard case of the p-median problem. It is shown that the effectiveness of the considered algorithms depends on the choice of the optimal values of the dual variables used in Benders cuts. In particular, the depth of the cuts can be equal to one. 相似文献