全文获取类型
收费全文 | 9414篇 |
免费 | 573篇 |
国内免费 | 266篇 |
专业分类
化学 | 237篇 |
晶体学 | 7篇 |
力学 | 520篇 |
综合类 | 100篇 |
数学 | 8403篇 |
物理学 | 986篇 |
出版年
2023年 | 43篇 |
2022年 | 79篇 |
2021年 | 106篇 |
2020年 | 107篇 |
2019年 | 141篇 |
2018年 | 138篇 |
2017年 | 173篇 |
2016年 | 191篇 |
2015年 | 151篇 |
2014年 | 374篇 |
2013年 | 515篇 |
2012年 | 496篇 |
2011年 | 392篇 |
2010年 | 394篇 |
2009年 | 556篇 |
2008年 | 584篇 |
2007年 | 651篇 |
2006年 | 431篇 |
2005年 | 419篇 |
2004年 | 330篇 |
2003年 | 327篇 |
2002年 | 353篇 |
2001年 | 280篇 |
2000年 | 308篇 |
1999年 | 263篇 |
1998年 | 228篇 |
1997年 | 208篇 |
1996年 | 210篇 |
1995年 | 200篇 |
1994年 | 155篇 |
1993年 | 161篇 |
1992年 | 155篇 |
1991年 | 134篇 |
1990年 | 112篇 |
1989年 | 80篇 |
1988年 | 94篇 |
1987年 | 59篇 |
1986年 | 87篇 |
1985年 | 115篇 |
1984年 | 83篇 |
1983年 | 26篇 |
1982年 | 51篇 |
1981年 | 46篇 |
1980年 | 36篇 |
1979年 | 31篇 |
1978年 | 52篇 |
1977年 | 52篇 |
1976年 | 28篇 |
1975年 | 12篇 |
1974年 | 13篇 |
排序方式: 共有10000条查询结果,搜索用时 31 毫秒
61.
基于SUN5500小型计算机并行开发环境,给出了消息传递模型和蕴式行模型的实现方法,通过实例分析了SUNMPI实际编程,并对选取不同模型有不同参数的运算时间进行了比较,结果表明,在SUN5500计算机上MPI模型和蕴式并行模型均能较大地提高运算速度,而且MPI在灵活性和并行程度方面更优。 相似文献
62.
M.V. Devyaterikova 《Operations Research Letters》2006,34(2):149-154
In the present paper we develop our approach for studying the stability of integer programming problems. We prove that the L-class enumeration method is stable on integer linear programming problems in the case of bounded relaxation sets [9]. The stability of some cutting plane algorithms is discussed. 相似文献
63.
The Dantzig-Wolfe reformulation principle is presented based on the concept of generating sets. The use of generating sets allows for an easy extension to mixed integer programming. Moreover, it provides a unifying framework for viewing various column generation practices, such as relaxing or tightening the column generation subproblem and introducing stabilization techniques. 相似文献
64.
In this paper we propose a general integration scheme for a Multi-Criteria Decision Making model of the Multi-Attribute Utility
Theory in Constraint Programming. We introduce the Choquet integral as a general aggregation function for multi-criteria optimization
problems and define the Choquet global constraint that propagates this function during the Branch-and-Bound search. Finally the benefits of the propagation
of the Choquet constraint are evaluated on the examination timetabling problem. 相似文献
65.
Dmitry I. Belov Ronald D. Armstrong 《Computational Optimization and Applications》2006,33(2-3):319-332
This paper introduces a novel approach for extracting the maximum number of non-overlapping test forms from a large collection
of overlapping test sections assembled from a given item bank. The approach involves solving maximum set packing problems
(MSPs). A branch-and-bound MSP algorithm is developed along with techniques adapted from constraint programming to estimate
lower and upper bounds on the optimal MSP solution. The algorithm is general and can be applied in other applications including
combinatorial auctions. The results of computer simulations and experiments with an operational item bank are presented.
An erratum to this article is available at . 相似文献
66.
Regina S. Burachik Rafail N. Gasimov Nergiz A. Ismayilova C. Yalçin. Kaya 《Journal of Global Optimization》2006,34(1):55-78
We study convergence properties of a modified subgradient algorithm, applied to the dual problem defined by the sharp augmented
Lagrangian. The primal problem we consider is nonconvex and nondifferentiable, with equality constraints. We obtain primal
and dual convergence results, as well as a condition for existence of a dual solution. Using a practical selection of the
step-size parameters, we demonstrate the algorithm and its advantages on test problems, including an integer programming and
an optimal control problem.
*Partially Supported by 2003 UniSA ITEE Small Research Grant Ero2.
Supported by CAPES, Brazil, Grant No. 0664-02/2, during her visit to the School of Mathematics and Statistics, UniSA. 相似文献
67.
全生寅 《数学的实践与认识》2006,36(1):253-256
证明了线性规划的K uhn-Tucker条件蕴含着它的对偶问题,解释了L agrange乘子的意义.进而显示了K-T条件中的互补松驰性与对偶线性规划的互补松紧定理之间的联系. 相似文献
68.
Hadi Mohammadi Bidhandi 《Annals of Operations Research》2006,143(1):237-250
This paper develops a mathematical model for project time compression problems in CPM/PERT type networks. It is noted this
formulation of the problem will be an adequate approximation for solving the time compression problem with any continuous
and non-increasing time-cost curve. The kind of this model is Mixed Integer Linear Program (MILP) with zero-one variables,
and the Benders' decomposition procedure for analyzing this model has been developed. Then this paper proposes a new approach
based on the surrogating method for solving these problems. In addition, the required computer programs have been prepared
by the author to execute the algorithm. An illustrative example solved by the new algorithm, and two methods are compared
by several numerical examples. Computational experience with these data shows the superiority of the new approach. 相似文献
69.
Ivan Kojadinovic 《4OR: A Quarterly Journal of Operations Research》2007,5(2):117-142
The application of multi-attribute utility theory based on the Choquet integral requires the prior identification of a capacity
if the utility scale is unipolar, or of a bi-capacity if the utility scale is bipolar. In order to implement a minimum distance
principle for capacity or bi-capacity approximation or identification, quadratic distances between capacities and bi-capacities
are studied. The proposed approach, consisting in solving a strictly convex quadratic program, has been implemented within
the GNU R kappalab package for capacity and nonadditive integral manipulation. Its application is illustrated on two examples.
相似文献
70.
Valentin Brimkov 《Discrete Applied Mathematics》2007,155(14):1812-1825
We consider the problem of computing the Lovász theta function for circulant graphs Cn,J of degree four with n vertices and chord length J, 2?J?n. We present an algorithm that takes O(J) operations if J is an odd number, and O(n/J) operations if J is even. On the considered class of graphs our algorithm strongly outperforms the known algorithms for theta function computation. We also provide explicit formulas for the important special cases J=2 and J=3. 相似文献