全文获取类型
收费全文 | 21023篇 |
免费 | 1305篇 |
国内免费 | 1008篇 |
专业分类
化学 | 1589篇 |
晶体学 | 33篇 |
力学 | 1177篇 |
综合类 | 149篇 |
数学 | 6928篇 |
物理学 | 1639篇 |
综合类 | 11821篇 |
出版年
2024年 | 117篇 |
2023年 | 308篇 |
2022年 | 572篇 |
2021年 | 626篇 |
2020年 | 502篇 |
2019年 | 482篇 |
2018年 | 490篇 |
2017年 | 623篇 |
2016年 | 604篇 |
2015年 | 602篇 |
2014年 | 1081篇 |
2013年 | 1127篇 |
2012年 | 1313篇 |
2011年 | 1241篇 |
2010年 | 1006篇 |
2009年 | 1145篇 |
2008年 | 1139篇 |
2007年 | 1374篇 |
2006年 | 1173篇 |
2005年 | 969篇 |
2004年 | 790篇 |
2003年 | 698篇 |
2002年 | 646篇 |
2001年 | 573篇 |
2000年 | 529篇 |
1999年 | 435篇 |
1998年 | 428篇 |
1997年 | 372篇 |
1996年 | 296篇 |
1995年 | 291篇 |
1994年 | 239篇 |
1993年 | 237篇 |
1992年 | 211篇 |
1991年 | 186篇 |
1990年 | 149篇 |
1989年 | 147篇 |
1988年 | 116篇 |
1987年 | 86篇 |
1986年 | 59篇 |
1985年 | 64篇 |
1984年 | 53篇 |
1983年 | 16篇 |
1982年 | 28篇 |
1981年 | 22篇 |
1980年 | 22篇 |
1979年 | 40篇 |
1978年 | 27篇 |
1977年 | 31篇 |
1976年 | 19篇 |
1955年 | 7篇 |
排序方式: 共有10000条查询结果,搜索用时 0 毫秒
91.
In single-objective optimization it is possible to find a global optimum, while in the multi-objective case no optimal solution is clearly defined, but several that simultaneously optimize all the objectives. However, the majority of this kind of problems cannot be solved exactly as they have very large and highly complex search spaces. Recently, meta-heuristic approaches have become important tools for solving multi-objective problems encountered in industry as well as in the theoretical field. Most of these meta-heuristics use a population of solutions, and hence the runtime increases when the population size grows. An interesting way to overcome this problem is to apply parallel processing. This paper analyzes the performance of several parallel paradigms in the context of population-based multi-objective meta-heuristics. In particular, we evaluate four alternative parallelizations of the Pareto simulated annealing algorithm, in terms of quality of the solutions, and speedup. 相似文献
92.
Ivan Nunes da Silva Wagner Caradori do AmaralLucia Valeria de Arruda 《Applied Mathematical Modelling》2007
This paper presents an efficient approach based on recurrent neural network for solving nonlinear optimization. More specifically, a modified Hopfield network is developed and its internal parameters are computed using the valid subspace technique. These parameters guarantee the convergence of the network to the equilibrium points that represent an optimal feasible solution. The main advantage of the developed network is that it treats optimization and constraint terms in different stages with no interference with each other. Moreover, the proposed approach does not require specification of penalty and weighting parameters for its initialization. A study of the modified Hopfield model is also developed to analyze its stability and convergence. Simulation results are provided to demonstrate the performance of the proposed neural network. 相似文献
93.
94.
In this paper we characterize the local maxima of a continuous global optimization formulation for finding the independence
number of a graph. Classical Karush-Kuhn-Tucker conditions and simple combinatorial arguments are found sufficient to deduce
several interesting properties of the local and global maxima. These properties can be utilized in developing new approaches
to the maximum independent set problem. 相似文献
95.
Effect of the subdivision strategy on convergence and efficiency of some global optimization algorithms 总被引:2,自引:0,他引:2
Hoang Tuy 《Journal of Global Optimization》1991,1(1):23-36
We investigate subdivision strategies that can improve the convergence and efficiency of some branch and bound algorithms of global optimization. In particular, a general class of so called weakly exhaustive simplicial subdivision processes is introduced that subsumes all previously known radial exhaustive processes. This result provides the basis for constructing flexible subdivision strategies that can be adapted to take advantage of various problem conditions. 相似文献
96.
本主要介绍原木经销商在周期内原木变价销售情况下的最佳期初贮存量的决策方法,在建立期望机会成本的数学模型基础上,探讨原木随机存贮策略的最优化问题。 相似文献
97.
A domain partitioning algorithm for minimizing or maximizing a Lipschitz continuous function is enhanced to yield two new, more efficient algorithms. The use of interval arithmetic in the case of rational functions and the estimates of Lipschitz constants valid in subsets of the domain in the case of others and the addition of local optimization have resulted in an algorithm which, in tests on standard functions, performs well. 相似文献
98.
Dirk P. Kroese Sergey Porotsky Reuven Y. Rubinstein 《Methodology and Computing in Applied Probability》2006,8(3):383-407
In recent years, the cross-entropy method has been successfully applied to a wide range of discrete optimization tasks. In
this paper we consider the cross-entropy method in the context of continuous optimization. We demonstrate the effectiveness
of the cross-entropy method for solving difficult continuous multi-extremal optimization problems, including those with non-linear
constraints.
相似文献
99.
C. Zălinescu 《Mathematical Methods of Operations Research》1991,35(4):291-298
In this paper there is stated a result on sets in ordered linear spaces which can be used to show that some properties of the sets are inherited by their convex hulls under suitable conditions. As applications one gives a characterization of weakly efficient points and a duality result for nonconvex vector optimization problems. 相似文献
100.
We give a concise review and extension of S-procedure that is an instrumental tool in control theory and robust optimization analysis. We also discuss the approximate S-Lemma as well as its applications in robust optimization.The many suggestions and detailed corrections of an anonymous referee are gratefully acknowledged. 相似文献