全文获取类型
收费全文 | 11872篇 |
免费 | 871篇 |
国内免费 | 439篇 |
专业分类
化学 | 1303篇 |
晶体学 | 32篇 |
力学 | 1179篇 |
综合类 | 188篇 |
数学 | 8905篇 |
物理学 | 1575篇 |
出版年
2024年 | 16篇 |
2023年 | 112篇 |
2022年 | 223篇 |
2021年 | 365篇 |
2020年 | 227篇 |
2019年 | 261篇 |
2018年 | 276篇 |
2017年 | 368篇 |
2016年 | 360篇 |
2015年 | 262篇 |
2014年 | 540篇 |
2013年 | 723篇 |
2012年 | 693篇 |
2011年 | 547篇 |
2010年 | 532篇 |
2009年 | 674篇 |
2008年 | 674篇 |
2007年 | 734篇 |
2006年 | 599篇 |
2005年 | 544篇 |
2004年 | 429篇 |
2003年 | 418篇 |
2002年 | 411篇 |
2001年 | 340篇 |
2000年 | 343篇 |
1999年 | 274篇 |
1998年 | 289篇 |
1997年 | 254篇 |
1996年 | 181篇 |
1995年 | 200篇 |
1994年 | 171篇 |
1993年 | 142篇 |
1992年 | 129篇 |
1991年 | 110篇 |
1990年 | 103篇 |
1989年 | 88篇 |
1988年 | 64篇 |
1987年 | 49篇 |
1986年 | 62篇 |
1985年 | 88篇 |
1984年 | 65篇 |
1983年 | 22篇 |
1982年 | 29篇 |
1981年 | 30篇 |
1980年 | 20篇 |
1979年 | 37篇 |
1978年 | 24篇 |
1977年 | 35篇 |
1976年 | 21篇 |
1974年 | 5篇 |
排序方式: 共有10000条查询结果,搜索用时 24 毫秒
141.
安全质量费用工期在网络计划中的系统优化研究 总被引:1,自引:0,他引:1
施工网络计划中安全、质量、费用、工期达到综合优化是工程管理决策追求的目标,在工程项目管理中对这4个指标进行全面系统分析,并且进行综合均衡优化,对于提高工程项目的综合效益至关重要.采取在网络计划所有可行的施工方案中寻求最优的方案组合,从而达到总目标的优化.并且通过一个实例来说明本方法的应用. 相似文献
142.
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. 相似文献
143.
Pure adaptive search constructs a sequence of points uniformly distributed within a corresponding sequence of nested regions of the feasible space. At any stage, the next point in the sequence is chosen uniformly distributed over the region of feasible space containing all points that are equal or superior in value to the previous points in the sequence. We show that for convex programs the number of iterations required to achieve a given accuracy of solution increases at most linearly in the dimension of the problem. This compares to exponential growth in iterations required for pure random search. 相似文献
144.
??We study the linear quadratic optimal stochastic control problem which is jointly driven by Brownian motion and L\'{e}vy processes. We prove that the new affine stochastic differential adjoint equation exists an inverse process by applying the profound section theorem. Applying for the Bellman's principle of quasilinearization and a monotone iterative convergence method, we prove the existence and uniqueness of the solution of the backward Riccati differential equation. Finally, we prove that the optimal feedback control exists, and the value function is composed of the initial value of the solution of the related backward Riccati differential equation and the related adjoint equation. 相似文献
145.
Kenneth Sörensen 《Central European Journal of Operations Research》2006,14(2):193-207
In this paper, we argue that vehicle routing solutions are often tactical decisions, that should not be changed too often
or too much. For marketing or other reasons, vehicle routing solutions should be stable, i.e. a new solution (when e.g. new customers require service) should be as similar as possible to a solution already in
use. Simultaneously however, this new solution should still have a good quality in the traditional sense (e.g. small total
travel cost). In this paper, we develop a way to measure the difference between two vehicle routing solutions. We use this
distance measure to create a metaheuristic approach that will find solutions that are “close” (in the solution space) to a
given baseline solution and at the same time have a high quality in the sense that their total distance traveled is small.
By using this approach, the dispatcher is offered a choice of Pareto-optimal solutions, allowing him to make a trade-off between
changing his existing solution and allowing a longer travel distance. Some experiments are performed to show the effectiveness
of the approach. 相似文献
146.
本主要介绍原木经销商在周期内原木变价销售情况下的最佳期初贮存量的决策方法,在建立期望机会成本的数学模型基础上,探讨原木随机存贮策略的最优化问题。 相似文献
147.
Ronald H. Nickel Igor Mikolic-Torreira Jon W. Tolle 《Computational Optimization and Applications》2006,35(1):109-126
Deployed US Navy aircraft carriers must stock a large number of spare parts to support the various types of aircraft embarked
on the ship. The sparing policy determines the spares that will be stocked on the ship to keep the embarked aircraft ready
to fly. Given a fleet of ten or more aircraft carriers and a cost of approximately 50 million dollars per carrier plus the
cost of spares maintained in warehouses in the United States, the sparing problem constitutes a significant portion of the
Navy’s resources. The objective of this work is to find a minimum-cost sparing policy that meets the readiness requirements
of the embarked aircraft. This is a very large, nonlinear, integer optimization problem. The cost function is piecewise linear
and convex while the constraint mapping is highly nonlinear. The distinguishing characteristics of this problem from an optimization
viewpoint are that a large number of decision variables are required to be integer and that the nonlinear constraint functions
are essentially “black box” functions; that is, they are very difficult (and expensive) to evaluate and their derivatives
are not available. Moreover, they are not convex. Integer programming problems with a large number of variables are difficult
to solve in general and most successful approaches to solving nonlinear integer problems have involved linear approximation
and relaxation techniques that, because of the complexity of the constraint functions, are inappropriate for attacking this
problem. We instead employ a pattern search method to each iteration of an interior point-type algorithm to solve the relaxed
version of the problem. From the solution found by the pattern search on each interior point iteration, we begin another pattern
search on the integer lattice to find a good integer solution. The best integer solution found across all interations is returned
as the optimal solution. The pattern searches are distributed across a local area network of non-dedicated, heterogeneous
computers in an office environment, thus, drastically reducing the time required to find the solution. 相似文献
148.
In this paper, a locally computed suboptimal control strategy for a class of interconnected systems is introduced. First, optimal statefeedback control equations are derived for a finite-horizon quadratic cost. Then, the control for each subsystem is separated into two portions. The first portion stabilizes the isolated subsystem, and the second portion corresponds to the interactions. To achieve a locally calculable control, an approximation to the optimal control equations is introduced, and two iterative suboptimal control algorithms are developed. In the first algorithm, the initial conditions of subsystems are assumed to be known; in the second algorithm, this information is replaced by statistical distributions. The orders of errors in the iterations of the algorithm and in the suboptimality are given in terms of interconnections. An example with comparisons is also included to show the performance of the approach. 相似文献
149.
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. 相似文献
150.
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.
相似文献