全文获取类型
收费全文 | 15285篇 |
免费 | 1008篇 |
国内免费 | 911篇 |
专业分类
化学 | 237篇 |
晶体学 | 2篇 |
力学 | 1510篇 |
综合类 | 186篇 |
数学 | 14002篇 |
物理学 | 1267篇 |
出版年
2024年 | 31篇 |
2023年 | 149篇 |
2022年 | 194篇 |
2021年 | 214篇 |
2020年 | 337篇 |
2019年 | 347篇 |
2018年 | 404篇 |
2017年 | 407篇 |
2016年 | 390篇 |
2015年 | 287篇 |
2014年 | 632篇 |
2013年 | 1226篇 |
2012年 | 679篇 |
2011年 | 814篇 |
2010年 | 712篇 |
2009年 | 986篇 |
2008年 | 1030篇 |
2007年 | 1062篇 |
2006年 | 949篇 |
2005年 | 738篇 |
2004年 | 649篇 |
2003年 | 720篇 |
2002年 | 613篇 |
2001年 | 467篇 |
2000年 | 473篇 |
1999年 | 425篇 |
1998年 | 392篇 |
1997年 | 344篇 |
1996年 | 266篇 |
1995年 | 210篇 |
1994年 | 149篇 |
1993年 | 130篇 |
1992年 | 123篇 |
1991年 | 107篇 |
1990年 | 81篇 |
1989年 | 42篇 |
1988年 | 44篇 |
1987年 | 41篇 |
1986年 | 45篇 |
1985年 | 56篇 |
1984年 | 54篇 |
1983年 | 28篇 |
1982年 | 31篇 |
1981年 | 26篇 |
1980年 | 18篇 |
1979年 | 24篇 |
1978年 | 17篇 |
1977年 | 16篇 |
1976年 | 9篇 |
1974年 | 5篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
81.
单循环赛赛程安排的一个图论方法 总被引:2,自引:0,他引:2
唐保祥 《数学的实践与认识》2004,34(5):120-125
利用图论的边着色理论建立了一个赛程安排的数学模型 .首先建立 n支球队与完全图 Kn的 n个顶点间的一一对应 ,把球队 Ai和 Aj间的比赛关系抽象成 Kn的顶点 i和 j间的边 ( i,j) .然后分别构造出了图K2 m- 1和 K2 m的正常 2 m-1边着色 .从而给出了各球队每两场比赛间得到的休整时间最均等 ,休整的间隔场次数达到上限值 n2 的一个赛程安排方案 相似文献
82.
Manufacturing cell formation using similarity coefficients and a parallel genetic TSP algorithm: Formulation and comparison 总被引:2,自引:0,他引:2
J. BalakrishnanP. D. Jog 《Mathematical and Computer Modelling》1995,21(12):61-73
Many algorithms have been proposed to form manufacturing cells from component routings. However, many of these do not have the capability of solving large problems. We propose a procedure using similarity coefficients and a parallel genetic implementation of a TSP algorithm that is capable of solving large problems of up to 1000 parts and 1000 machines. In addition, we also compare our procedure with many existing procedures using nine well-known problems from the literature.
The results show that the proposed procedure compares well with the existing procedures and should be useful to practitioners and researchers. 相似文献
83.
This note outlines an algorithm for solving the complex ‘matrix Procrustes problem’. This is a least‐squares approximation over the cone of positive semi‐definite Hermitian matrices, which has a number of applications in the areas of Optimization, Signal Processing and Control. The work generalizes the method of Allwright (SIAM J. Control Optim. 1988; 26 (3):537–556), who obtained a numerical solution to the real‐valued version of the problem. It is shown that, subject to an appropriate rank assumption, the complex problem can be formulated in a real setting using a matrix‐dilation technique, for which the method of Allwright is applicable. However, this transformation results in an over‐parametrization of the problem and, therefore, convergence to the optimal solution is slow. Here, an alternative algorithm is developed for solving the complex problem, which exploits fully the special structure of the dilated matrix. The advantages of the modified algorithm are demonstrated via a numerical example. Copyright © 2007 John Wiley & Sons, Ltd. 相似文献
84.
Alexander J. Zaslavski 《Journal of Mathematical Analysis and Applications》2007,335(2):962-973
The Tonelli existence theorem in the calculus of variations and its subsequent modifications were established for integrands f which satisfy convexity and growth conditions. In this paper we consider a large class of optimal control problems which is identified with a complete metric space of integrands without convexity assumptions and show that for a generic integrand the corresponding optimal control problem possesses a unique solution and this solution is Lipschitzian. 相似文献
85.
In this paper we deal with nonlinear second-order boundary value problems with impulses. The impulsive functions depend implicitly on the different considered variables and the boundary value conditions are nonlinear. In both cases functional dependence on the solution is allowed. The existence results follow from the existence of a pair of well-ordered lower and upper solutions. 相似文献
86.
B. Ivorra A. M. Ramos B. Mohammadi 《Journal of Optimization Theory and Applications》2007,135(3):549-561
This paper has two objectives. We introduce a new global optimization algorithm reformulating optimization problems in terms
of boundary-value problems. Then, we apply this algorithm to a pointwise control problem of the viscous Burgers equation,
where the control weight coefficient is progressively decreased. The results are compared with those obtained with a genetic
algorithm and an LM-BFGS algorithm in order to check the efficiency of our method and the necessity of using global optimization
techniques. 相似文献
87.
An energy-dependent partitioning scheme is explored for extracting a small number of eigenvalues of a real symmetric matrix with the help of genetic algorithm. The proposed method is tested with matrices of different sizes (30 × 30 to 1000 × 1000). Comparison is made with Löwdin’s strategy for solving the problem. The relative advantages and disadvantages of the GA-based method are analyzed 相似文献
88.
V. S. Klimov 《Mathematical Notes》2007,81(1-2):61-71
We study homology characteristics of critical values and extremals of Lipschitz functionals defined on bounded closed convex subsets of a reflexive space that are invariant under deformations. Sufficient conditions for the existence of a bifurcation point of a multivalued potential operator (the switch principle for the typical number of an extremal) are established. 相似文献
89.
90.
We study a variation of the knapsack problem in which each item has a profit, a weight and a penalty; the sum of profits of the selected items minus the largest penalty associated with the selected items must be maximized. We present an ILP formulation and an exact optimization algorithm. 相似文献