全文获取类型
收费全文 | 20010篇 |
免费 | 2675篇 |
国内免费 | 546篇 |
专业分类
化学 | 794篇 |
晶体学 | 14篇 |
力学 | 1051篇 |
综合类 | 338篇 |
数学 | 5507篇 |
物理学 | 2851篇 |
无线电 | 12676篇 |
出版年
2024年 | 79篇 |
2023年 | 257篇 |
2022年 | 452篇 |
2021年 | 539篇 |
2020年 | 530篇 |
2019年 | 455篇 |
2018年 | 479篇 |
2017年 | 670篇 |
2016年 | 899篇 |
2015年 | 915篇 |
2014年 | 1456篇 |
2013年 | 1370篇 |
2012年 | 1406篇 |
2011年 | 1523篇 |
2010年 | 1063篇 |
2009年 | 1214篇 |
2008年 | 1345篇 |
2007年 | 1389篇 |
2006年 | 1183篇 |
2005年 | 984篇 |
2004年 | 841篇 |
2003年 | 723篇 |
2002年 | 633篇 |
2001年 | 474篇 |
2000年 | 429篇 |
1999年 | 315篇 |
1998年 | 304篇 |
1997年 | 249篇 |
1996年 | 224篇 |
1995年 | 152篇 |
1994年 | 106篇 |
1993年 | 115篇 |
1992年 | 101篇 |
1991年 | 45篇 |
1990年 | 55篇 |
1989年 | 35篇 |
1988年 | 40篇 |
1987年 | 23篇 |
1986年 | 31篇 |
1985年 | 33篇 |
1984年 | 30篇 |
1983年 | 10篇 |
1982年 | 18篇 |
1981年 | 5篇 |
1980年 | 5篇 |
1979年 | 5篇 |
1978年 | 3篇 |
1977年 | 5篇 |
1959年 | 5篇 |
1957年 | 2篇 |
排序方式: 共有10000条查询结果,搜索用时 10 毫秒
101.
本文利用二分演化思想和矩阵分解技术 ,重点讨论逆Walsh序三值Walsh变换的演化生成和快速算法 ,并将之推广至p值情形 . 相似文献
102.
Nguyen V. Thoai 《Journal of Global Optimization》2000,18(4):321-336
The problem of optimizing some contiuous function over the efficient set of a multiple objective programming problem can be formulated as a nonconvex global optimization problem with special structure. Based on the conical branch and bound algorithm in global optimization, we establish an algorithm for optimizing over efficient sets and discuss about the implementation of this algorithm for some interesting special cases including the case of biobjective programming problems. 相似文献
103.
In location-routing problems, the objective is to locate one or many depots within a set of sites (representing customer locations or cities) and to construct delivery routes from the selected depot or depots to the remaining sites at least system cost. The objective function is the sum of depot operating costs, vehicle acquisition costs and routing costs. This paper considers one such problem in which a weight is assigned to each site and where sites are to be visited by vehicles having a given capacity. The solution must be such that the sum of the weights of sites visited on any given route does not exceed the capacity of the visiting vehicle. The formulation of an integer linear program for this problem involves degree constraints, generalized subtour elimination constraints, and chain barring constraints. An exact algorithm, using initial relaxation of most of the problem constraints, is presented which is capable of solving problems with up to twenty sites within a reasonable number of iterations. 相似文献
104.
We give a -approximation algorithm for minimizing total weighted completion time on a single machine under release time and precedence constraints. This settles a recent conjecture on the approximability of this scheduling problem (Skutella, 2016). 相似文献
105.
Hédy Attouch Juan Peypouquet Patrick Redont 《Journal of Mathematical Analysis and Applications》2018,457(2):1095-1117
In this paper, we study the backward–forward algorithm as a splitting method to solve structured monotone inclusions, and convex minimization problems in Hilbert spaces. It has a natural link with the forward–backward algorithm and has the same computational complexity, since it involves the same basic blocks, but organized differently. Surprisingly enough, this kind of iteration arises when studying the time discretization of the regularized Newton method for maximally monotone operators. First, we show that these two methods enjoy remarkable involutive relations, which go far beyond the evident inversion of the order in which the forward and backward steps are applied. Next, we establish several convergence properties for both methods, some of which were unknown even for the forward–backward algorithm. This brings further insight into this well-known scheme. Finally, we specialize our results to structured convex minimization problems, the gradient-projection algorithms, and give a numerical illustration of theoretical interest. 相似文献
106.
Monte Carlo study of the universal area distribution of clusters in the honeycomb O(n) loop model 下载免费PDF全文
We investigate the area distribution of clusters (loops) in the honeycomb O(n) loop model by means of the worm algorithm with n = 0.5, 1, 1.5, and 2. At the critical point, the number of clusters, whose enclosed area is greater than A, is proportional to A-1 with a proportionality constant C. We confirm numerically that C is universal, and its value agrees well with the predictions based on the Coulomb gas method. 相似文献
108.
Genetic algorithm based approach for the integrated airline crew-pairing and rostering problem 总被引:1,自引:0,他引:1
Airline crew scheduling problem is a complex and difficult problem faced by all airline companies.To tackle this problem, it was often decomposed into two subproblems solved successively. First, the airline crew-pairing problem, which consists on finding a set of trips – called pairings – i.e. sequences of flights, starting and ending at a crew base, that cover all the flights planned for a given period of time. Secondly, the airline crew rostering problem, which consists on assigning the pairings found by solving the first subproblem, to the named airline crew members. For both problems, several rules and regulations must be respected and costs minimized.It is sure that this decomposition provides a convenient tool to handle the numerous and complex restrictions, but it lacks, however, of a global treatment of the problem. For this purpose, in this study we took the challenge of proposing a new way to solve both subproblems simultaneously. The proposed approach is based on a hybrid genetic algorithm. In fact, three heuristics are developed here to tackle the restriction rules within the GA’s process. 相似文献
109.
Svante Janson 《Annals of Combinatorics》2009,12(4):417-447
We study the space requirements of a sorting algorithm where only items that at the end will be adjacent are kept together. This is equivalent to the following combinatorial problem: Consider a string of fixed length n that starts as a string of 0’s, and then evolves by changing each 0 to 1, with the n changes done in random order. What is the maximal number of runs of 1’s? We give asymptotic results for the distribution and mean. It turns out that, as in many problems involving a maximum, the maximum is asymptotically normal, with fluctuations of order n 1/2, and to the first order well approximated by the number of runs at the instance when the expectation is maximized, in this case when half the elements have changed to 1; there is also a second order term of order n 1/3. We also treat some variations, including priority queues and sock-sorting. The proofs use methods originally developed for random graphs. 相似文献
110.
M. Zandieh M. Amiri B. Vahdani R. Soltani 《Journal of Computational and Applied Mathematics》2009,230(2):463-476
Most real world search and optimization problems naturally involve multiple responses. In this paper we investigate a multiple response problem within desirability function framework and try to determine values of input variables that achieve a target value for each response through three meta-heuristic algorithms such as genetic algorithm (GA), simulated annealing (SA) and tabu search (TS). Each algorithm has some parameters that need to be accurately calibrated to ensure the best performance. For this purpose, a robust calibration is applied to the parameters by means of Taguchi method. The computational results of these three algorithms are compared against each others. The superior performance of SA over TS and TS over GA is inferred from the obtained results in various situations. 相似文献