全文获取类型
收费全文 | 10644篇 |
免费 | 1063篇 |
国内免费 | 713篇 |
专业分类
化学 | 1617篇 |
晶体学 | 23篇 |
力学 | 738篇 |
综合类 | 192篇 |
数学 | 7771篇 |
物理学 | 2079篇 |
出版年
2024年 | 17篇 |
2023年 | 67篇 |
2022年 | 135篇 |
2021年 | 197篇 |
2020年 | 189篇 |
2019年 | 215篇 |
2018年 | 220篇 |
2017年 | 286篇 |
2016年 | 341篇 |
2015年 | 241篇 |
2014年 | 462篇 |
2013年 | 775篇 |
2012年 | 552篇 |
2011年 | 526篇 |
2010年 | 496篇 |
2009年 | 602篇 |
2008年 | 683篇 |
2007年 | 697篇 |
2006年 | 605篇 |
2005年 | 576篇 |
2004年 | 500篇 |
2003年 | 417篇 |
2002年 | 448篇 |
2001年 | 423篇 |
2000年 | 375篇 |
1999年 | 369篇 |
1998年 | 285篇 |
1997年 | 252篇 |
1996年 | 221篇 |
1995年 | 184篇 |
1994年 | 143篇 |
1993年 | 121篇 |
1992年 | 112篇 |
1991年 | 92篇 |
1990年 | 68篇 |
1989年 | 59篇 |
1988年 | 52篇 |
1987年 | 51篇 |
1986年 | 47篇 |
1985年 | 55篇 |
1984年 | 59篇 |
1983年 | 20篇 |
1982年 | 36篇 |
1981年 | 22篇 |
1980年 | 21篇 |
1979年 | 27篇 |
1978年 | 12篇 |
1977年 | 22篇 |
1976年 | 14篇 |
1973年 | 6篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
71.
72.
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. 相似文献
73.
The objective of this paper is to analyze under what well-known operations the class of quasipolyhedral convex functions,
which can be regarded as an extension of that of polyhedral convex functions, is closed. The operations that will be considered
are those that preserve polyhedral convexity, such that the image and the inverse image under linear transformations, right
scalar multiplication (including the case where λ=0+) and pointwise addition.
相似文献
74.
A. A. Maleev 《Computational Mathematics and Mathematical Physics》2006,46(12):2031-2039
Stationary and nonstationary Jacobi-like iterative processes for solving systems of linear algebraic equations are examined. For a system whose coefficient matrix A is an H-matrix, it is shown that the convergence rate of any Jacobi-like process is at least as high as that of the point Jacobi method as applied to a system with 〈A〉 as the coefficient matrix, where 〈A〉 is a comparison matrix of A. 相似文献
75.
76.
Patrizio Frosini 《Geometriae Dedicata》2004,108(1):105-110
In this paper we prove that for every real-valued Morse function φ on a smooth closed manifold ℳ and every neighborhood U of its critical points a suitable Riemannian metric μ
U
exists such that φ is linear outside
U 相似文献
77.
This paper develops a theory for the global solution of nonconvex optimization problems with parameter-embedded linear dynamic systems. A quite general problem formulation is introduced and a solution is shown to exists. A convexity theory for integrals is then developed to construct convex relaxations for utilization in a branch-and-bound framework to calculate a global minimum. Interval analysis is employed to generate bounds on the state variables implied by the bounds on the embedded parameters. These bounds, along with basic integration theory, are used to prove convergence of the branch-and-bound algorithm to the global minimum of the optimization problem. The implementation of the algorithm is then considered and several numerical case studies are examined thoroughly 相似文献
78.
We consider the generalization of the classical P||Cmax problem (assign n jobs to m identical parallel processors by minimizing the makespan) arising when the number of jobs that can be assigned to each processor cannot exceed a given integer k. The problem is strongly NP-hard for any fixed k > 2. We briefly survey lower and upper bounds from the literature. We introduce greedy heuristics, local search and a scatter search approach. The effectiveness of these approaches is evaluated through extensive computational comparison with a depth-first branch-and-bound algorithm that includes new lower bounds and dominance criteria. 相似文献
79.
In this work, the NP-hard maximum clique problem on graphs is considered. Starting from basic greedy heuristics, modifications and improvements are proposed and combined in a two-phase heuristic procedure. In the first phase an improved greedy procedure is applied starting from each node of the graph; on the basis of the results of this phase a reduced subset of nodes is selected and an adaptive greedy algorithm is repeatedly started to build cliques around such nodes. In each restart the selection of nodes is biased by the maximal clique generated in the previous execution. Computational results are reported on the DIMACS benchmarks suite. Remarkably, the two-phase procedure successfully solves the difficult Brockington-Culberson instances, and is generally competitive with state-of-the-art much more complex heuristics. 相似文献
80.