全文获取类型
收费全文 | 1294篇 |
免费 | 63篇 |
国内免费 | 50篇 |
专业分类
化学 | 75篇 |
力学 | 12篇 |
综合类 | 23篇 |
数学 | 1181篇 |
物理学 | 116篇 |
出版年
2023年 | 4篇 |
2022年 | 11篇 |
2021年 | 22篇 |
2020年 | 15篇 |
2019年 | 17篇 |
2018年 | 20篇 |
2017年 | 30篇 |
2016年 | 30篇 |
2015年 | 19篇 |
2014年 | 51篇 |
2013年 | 64篇 |
2012年 | 56篇 |
2011年 | 54篇 |
2010年 | 53篇 |
2009年 | 75篇 |
2008年 | 83篇 |
2007年 | 80篇 |
2006年 | 67篇 |
2005年 | 65篇 |
2004年 | 37篇 |
2003年 | 55篇 |
2002年 | 75篇 |
2001年 | 41篇 |
2000年 | 36篇 |
1999年 | 26篇 |
1998年 | 32篇 |
1997年 | 23篇 |
1996年 | 65篇 |
1995年 | 22篇 |
1994年 | 15篇 |
1993年 | 13篇 |
1992年 | 14篇 |
1991年 | 6篇 |
1990年 | 10篇 |
1989年 | 11篇 |
1988年 | 8篇 |
1987年 | 6篇 |
1986年 | 15篇 |
1985年 | 38篇 |
1984年 | 8篇 |
1983年 | 3篇 |
1982年 | 6篇 |
1981年 | 6篇 |
1980年 | 4篇 |
1978年 | 3篇 |
1977年 | 6篇 |
1976年 | 3篇 |
1975年 | 2篇 |
1972年 | 1篇 |
1970年 | 1篇 |
排序方式: 共有1407条查询结果,搜索用时 31 毫秒
21.
A hybrid technique using constraint programming and linear programming is applied to the problem of scheduling with earliness and tardiness costs. The linear model maintains a set of relaxed optimal start times which are used to guide the constraint programming search heuristic. In addition, the constraint programming problem model employs the strong constraint propagation techniques responsible for many of the advances in constraint programming for scheduling in the past few years. Empirical results validate our approach and show, in particular, that creating and solving a subproblem containing only the activities with direct impact on the cost function and then using this solution in the main search, significantly increases the number of problems that can be solved to optimality while significantly decreasing the search time. 相似文献
22.
The purpose of this paper is to present general approaches for bounding some multi-stage stochastic programs from above. The results are based on restricting the solution set, such that the remaining multi-stage stochastic program is easy to solve. An example where the methods can be applied is presented.Supported in part by NATO Collaborative Research Grant No. 0785/87. 相似文献
23.
24.
We consider a class of non-linear mixed integer programs with n integer variables and k continuous variables. Solving instances from this class to optimality is an NP-hard problem. We show that for the cases with
k=1 and k=2, every optimal solution is integral. In contrast to this, for every k≥3 there exist instances where every optimal solution takes non-integral values.
Received: August 2001 / Accepted: January 2002?Published online March 27, 2002 相似文献
25.
Hua Ning LIU Wen Peng ZHANG 《数学学报(英文版)》2007,23(5):915-924
The main purpose of this paper is to use the generalized Bernoulli numbers, Gauss sums and the mean value theorems of Dirichlet L-functions between a quadratic residue and its inverse modulo p value formula. to study the asymptotic property of the difference (a prime), and to give an interesting hybrid mean 相似文献
26.
We present a new approach, requiring the solution of a SemiDefinite Program, for decomposing the Hessian of a nonseparable mixed-integer quadratic problem to permit using perspective cuts to improve its continuous relaxation bound. The new method favorably compares with a previously proposed one requiring a minimum eigenvalue computation. 相似文献
27.
We exhibit a probabilistic algorithm which computes a rational point of an absolutely irreducible variety over a finite field defined by a reduced regular sequence. Its time-space complexity is roughly quadratic in the logarithm of the cardinality of the field and a geometric invariant of the input system. This invariant, called the degree, is bounded by the Bézout number of the system. Our algorithm works for fields of any characteristic, but requires the cardinality of the field to be greater than a quantity which is roughly the fourth power of the degree of the input variety.
28.
We show that for any optimal solution
for a given separable quadratic integer programming problem there exist an optimal solution
for its continuous relaxation such that
wheren is the number of variables and(A) is the largest absolute subdeterminant of the integer constraint matrixA. Also for any feasible solutionz, which is not optimal for the separable quadratic integer programming problem, there exists a feasible solution
having greater objective function value and with
. We further prove, under some additional assumptions, that the distance between a pair of optimal solutions to an integer quadratic programming problem with right hand side vectorsb andb, respectively, depends linearly on b–b1. Finally the validity of all the results for nonseparable mixed-integer quadratic programs is established. The proximity results obtained in this paper are extensions of some of the results described in Cook et al. (1986) for linear integer programming.This research was partially supported by Natural Sciences and Engineering Research Council of Canada Grant 5-83998. 相似文献
29.
Ab initio calculations of the orbital and the ground state energies of some open- and closed-shell atoms over Slater type orbitals with quantum numbers integer and Slater type orbitals with quantum numbers noninteger have been performed. In order to increase the efficiency of these calculations the atomic two-electron integrals were expressed in terms of incomplete beta function. Results were observed to be in good agreement with the literature. 相似文献
30.
Different classes of on-line algorithms are developed and analyzed for the solution of {0, 1} and relaxed stochastic knapsack problems, in which both profit and size coefficients are random variables. In particular, a linear time on-line algorithm is proposed for which the expected difference between the optimum and the approximate solution value isO(log3/2
n). An(1) lower bound on the expected difference between the optimum and the solution found by any on-line algorithm is also shown to hold.Corresponding author.Partially supported by the Basic Research Action of the European Communities under Contract 3075 (Alcom).Partially supported by research project Models and Algorithms for Optimization of the Italian Ministry of University and Scientific and Technological Research (MURST 40%). 相似文献