全文获取类型
收费全文 | 13502篇 |
免费 | 1515篇 |
国内免费 | 395篇 |
专业分类
化学 | 1288篇 |
晶体学 | 28篇 |
力学 | 1078篇 |
综合类 | 150篇 |
数学 | 6738篇 |
物理学 | 1498篇 |
无线电 | 4632篇 |
出版年
2024年 | 40篇 |
2023年 | 202篇 |
2022年 | 350篇 |
2021年 | 470篇 |
2020年 | 378篇 |
2019年 | 362篇 |
2018年 | 361篇 |
2017年 | 500篇 |
2016年 | 543篇 |
2015年 | 482篇 |
2014年 | 831篇 |
2013年 | 856篇 |
2012年 | 967篇 |
2011年 | 833篇 |
2010年 | 639篇 |
2009年 | 768篇 |
2008年 | 788篇 |
2007年 | 827篇 |
2006年 | 669篇 |
2005年 | 594篇 |
2004年 | 443篇 |
2003年 | 421篇 |
2002年 | 373篇 |
2001年 | 339篇 |
2000年 | 304篇 |
1999年 | 231篇 |
1998年 | 254篇 |
1997年 | 216篇 |
1996年 | 156篇 |
1995年 | 172篇 |
1994年 | 142篇 |
1993年 | 132篇 |
1992年 | 109篇 |
1991年 | 89篇 |
1990年 | 76篇 |
1989年 | 63篇 |
1988年 | 50篇 |
1987年 | 41篇 |
1986年 | 38篇 |
1985年 | 57篇 |
1984年 | 52篇 |
1983年 | 15篇 |
1982年 | 22篇 |
1981年 | 20篇 |
1980年 | 18篇 |
1979年 | 31篇 |
1978年 | 20篇 |
1977年 | 29篇 |
1976年 | 18篇 |
1974年 | 5篇 |
排序方式: 共有10000条查询结果,搜索用时 804 毫秒
941.
Nenad Mladenović Milan Dražić Vera Kovačevic-Vujčić Mirjana Čangalović 《European Journal of Operational Research》2008
We suggest a new heuristic for solving unconstrained continuous optimization problems. It is based on a generalized version of the variable neighborhood search metaheuristic. Different neighborhoods and distributions, induced from different metrics are ranked and used to get random points in the shaking step. We also propose VNS for solving constrained optimization problems. The constraints are handled using exterior point penalty functions within an algorithm that combines sequential and exact penalty transformations. The extensive computer analysis that includes the comparison with genetic algorithm and some other approaches on standard test functions are given. With our approach we obtain encouraging results. 相似文献
942.
Chandra Sekhar Pedamallu Linet Özdamar Tibor Csendes Tamás Vinkó 《Journal of Global Optimization》2008,42(3):369-384
A new efficient interval partitioning approach to solve constrained global optimization problems is proposed. This involves
a new parallel subdivision direction selection method as well as an adaptive tree search. The latter explores nodes (intervals
in variable domains) using a restricted hybrid depth-first and best-first branching strategy. This hybrid approach is also
used for activating local search to identify feasible stationary points. The new tree search management technique results
in improved performance across standard solution and computational indicators when compared to previously proposed techniques.
On the other hand, the new parallel subdivision direction selection rule detects infeasible and suboptimal boxes earlier than
existing rules, and this contributes to performance by enabling earlier reliable deletion of such subintervals from the search
space. 相似文献
943.
In this paper, we study the Riemannian length of the primal central path in a convex set computed with respect to the local
metric defined by a self-concordant function. Despite some negative examples, in many important situations, the length of
this path is quite close to the length of a geodesic curve. We show that in the case of a bounded convex set endowed with
a ν-self-concordant barrier, the length of the central path is within a factor O(ν
1/4) of the length of the shortest geodesic curve.
This paper presents research results of the Belgian Program on Interuniversity Poles of Attraction initiated by the Belgian
State, Prime Minister’s Office, Science Policy Programming. 相似文献
944.
This paper deals with a new solution technique for approximately solving certain variational problems in elasticity by using discrete optimization techniques that were originally used in information theory. This allows us to easily and approximately solve large deformation buckling problems for slender cantilever beams (including post-buckling behavior) as well as problems where the strain energy function is non-convex.The core idea is to quantize or discretize the variables describing the possible configurations of the body. This, when combined with the fact that the variational problem has an inherent Markov structure allows us to use computationally efficient search techniques based on dynamic programming (equivalent to finding the shortest path in a weighted directed graph) to find optimal solutions within the quantized state space. The results can be used in two ways: (1) directly as a fast approximate solution to the variational problem (2) As a means for finding very good (nearly minimum energy) initial configurations for application of conventional minimization techniques, which might otherwise fail because of a poor starting configurations which are far from the global minimum. We demonstrate both these uses in the paper. 相似文献
945.
Portfolio Selection Problem with Minimax Type Risk Function 总被引:3,自引:0,他引:3
The investor's preference in risk estimation of portfolio selection problems is important as it influences investment strategies. In this paper a minimax risk criterion is considered. Specifically, the investor aims to restrict the standard deviation for each of the available stocks. The corresponding portfolio optimization problem is formulated as a linear program. Hence it can be implemented easily. A capital asset pricing model between the market portfolio and each individual return for this model is established using nonsmooth optimization methods. Some numerical examples are given to illustrate our approach for the risk estimation. 相似文献
946.
一种特殊设计约束面的有限元网格优化问题 总被引:3,自引:0,他引:3
网格设计质量的优劣是有限元分析的关键,对一些特殊的设计约束面,网格的优化设计是建模时需要首先研究解决的问题,本文对两种材料在几何尺寸差异很大情况下的有限元网格进行了优化设计并对其进行了讨论。 相似文献
947.
We have previously shown, by redundant Klee–Minty constructions, that the central path may arbitrarily closely visit every vertex of the Klee–Minty cube. In those constructions, the redundant constraints are far away from the feasible region. In this paper, we provide a construction in which all redundant constraints touch the feasible region. 相似文献
948.
Wai Kuan Foong Angus R. Simpson Holger R. Maier Stephen Stolp 《Annals of Operations Research》2008,159(1):433-450
A number of algorithms have been developed for the optimization of power plant maintenance schedules. However, the true test
of such algorithms occurs when they are applied to real systems. In this paper, the application of an Ant Colony Optimization
formulation to a hydropower system is presented. The formulation is found to be effective in handling various constraints
commonly encountered in practice. Overall, the results obtained using the ACO formulation are better than those given by traditional
methods using engineering judgment, which indicates the potential of ACO in solving realistic power plant maintenance scheduling
problems. 相似文献
949.
向量优化问题有效解的稳定性 总被引:1,自引:0,他引:1
运用标量化的方法,通过锥正定真有效解的上半连续性讨论了无限维赋范空间中锥有效解的部分上半连续性,证明了锥有效解的通有稳定性.在此基础上,进一步证明,在Baire纲的意义下,绝大多数的向量优化问题至少存在一个锥正定真有效解是本质的有效解,换句话说,绝大多数的向量优化问题锥有效解是几乎下半连续的. 相似文献
950.
The problem of multidimensional scaling with city-block distances in the embedding space is reduced to a two level optimization
problem consisting of a combinatorial problem at the upper level and a quadratic programming problem at the lower level. A
hybrid method is proposed combining randomized search for the upper level problem with a standard quadratic programming algorithm
for the lower level problem. Several algorithms for the combinatorial problem have been tested and an evolutionary global
search algorithm has been proved most suitable. An experimental code of the proposed hybrid multidimensional scaling algorithm
is developed and tested using several test problems of two- and three-dimensional scaling. 相似文献