全文获取类型
收费全文 | 1776篇 |
免费 | 138篇 |
国内免费 | 40篇 |
专业分类
化学 | 145篇 |
晶体学 | 2篇 |
力学 | 156篇 |
综合类 | 36篇 |
数学 | 1360篇 |
物理学 | 255篇 |
出版年
2024年 | 3篇 |
2023年 | 22篇 |
2022年 | 35篇 |
2021年 | 45篇 |
2020年 | 38篇 |
2019年 | 34篇 |
2018年 | 25篇 |
2017年 | 54篇 |
2016年 | 60篇 |
2015年 | 57篇 |
2014年 | 94篇 |
2013年 | 121篇 |
2012年 | 108篇 |
2011年 | 68篇 |
2010年 | 75篇 |
2009年 | 92篇 |
2008年 | 90篇 |
2007年 | 102篇 |
2006年 | 103篇 |
2005年 | 71篇 |
2004年 | 62篇 |
2003年 | 51篇 |
2002年 | 56篇 |
2001年 | 52篇 |
2000年 | 32篇 |
1999年 | 50篇 |
1998年 | 37篇 |
1997年 | 33篇 |
1996年 | 28篇 |
1995年 | 28篇 |
1994年 | 26篇 |
1993年 | 20篇 |
1992年 | 17篇 |
1991年 | 13篇 |
1990年 | 13篇 |
1989年 | 17篇 |
1988年 | 10篇 |
1987年 | 8篇 |
1986年 | 18篇 |
1985年 | 16篇 |
1984年 | 6篇 |
1983年 | 3篇 |
1982年 | 9篇 |
1981年 | 4篇 |
1980年 | 11篇 |
1979年 | 9篇 |
1978年 | 10篇 |
1977年 | 5篇 |
1976年 | 5篇 |
1974年 | 5篇 |
排序方式: 共有1954条查询结果,搜索用时 15 毫秒
101.
Y. Yavin 《Journal of Optimization Theory and Applications》1993,78(1):77-91
Stochastic optimal control techniques are applied to compare the performance of identical medium-range air-to-air missiles which have different thrust-mass profiles. The measure of the performance is the probability of reaching a lock-on-point with a favorable range of guidance and flight parameters, during a fixed time interval [0,t
f
], given that, during the flight, the trajectories of the missile are subjected to a variety of constraints including dynamic pressure constraints. 相似文献
102.
In this paper, we develop an interior point algorithm for quadratically constrained entropy problems. The algorithm uses a variation of Newton's method to follow a central path trajectory in the interior of the feasible set. The primal-dual gap is made less than a given in at most
steps, wheren is the dimension of the problem andm is the number of quadratic inequality constraints. 相似文献
103.
We present an introductory review of recent work on the control of open queueing networks. We assume that customers of different types arrive at a network and pass through the system via one of several possible routes; the set of routes available to a customer depends on its type. A route through the network is an ordered set of service stations: a customer queues for service at each station on its route and then leaves the system. The two methods of control we consider are the routing of customers through the network, and the sequencing of service at the stations, and our aim is to minimize the number of customers in the system. We concentrate especially on the insights which can be obtained from heavy traffic analysis, and in particular from Harrison's Brownian network models. Our main conclusion is that in many respects dynamic routingsimplifies the behaviour of networks, and that under good control policies it may well be possible to model the aggregate behaviour of a network quite straightforwardly.Supported by SERC grant GR/F 94194. 相似文献
104.
B. Rustem 《Journal of Optimization Theory and Applications》1993,76(3):429-453
In this paper, we consider two algorithms for nonlinear equality and inequality constrained optimization. Both algorithms utilize stepsize strategies based on differentiable penalty functions and quadratic programming subproblems. The essential difference between the algorithms is in the stepsize strategies used. The objective function in the quadratic subproblem includes a linear term that is dependent on the penalty functions. The quadratic objective function utilizes an approximate Hessian of the Lagrangian augmented by the penalty functions. In this approximation, it is possible to ignore the second-derivative terms arising from the constraints in the penalty functions.The penalty parameter is determined using a strategy, slightly different for each algorithm, that ensures boundedness as well as a descent property. In particular, the boundedness follows as the strategy is always satisfied for finite values of the parameter.These properties are utilized to establish global convergence and the condition under which unit stepsizes are achieved. There is also a compatibility between the quadratic objective function and the stepsize strategy to ensure the consistency of the properties for unit steps and subsequent convergence rates.This research was funded by SERC and ESRC research contracts. The author is grateful to Professors Laurence Dixon and David Mayne for their comments. The numerical results in the paper were obtained using a program written by Mr. Robin Becker. 相似文献
105.
In this paper we study the relationship between Constraint Programming (CP) and Shortest Path (SP) problems. In particular, we show that classical, multicriteria, partially ordered, and modality-based SP problems can be naturally modeled and solved within the Soft Constraint Logic Programming (SCLP) framework, where logic programming is coupled with soft constraints. In this way we provide this large class of SP problems with a high-level and declarative linguistic support whose semantics takes care of both finding the cost of the shortest path(s) and also of actually finding the path(s). On the other hand, some efficient algorithms for certain classes of SP problems can be exploited to provide some classes of SCLP programs with an efficient way to compute their semantics. 相似文献
106.
Mikhail Andramonov 《Journal of Global Optimization》2002,24(2):115-132
We consider applications of disjunctive programming to global optimization and problems with equilibrium constraints. We propose a modification of the algorithm of F. Beaumont for disjunctive programming problems and show its numerical efficiency. 相似文献
107.
在本文中,我们提出了双凹规划问题和更一般的广义凹规划问题。我们给出了双凹规划问题的整体最优性条件,并构造了一个有限终止外逼近算法。 相似文献
108.
We prove a result on the connectedness of (abstract) probabilistic constraints P(h(x,)0)p without any assumption on the distribution of . An application to storage level constraints is discussed briefly. Illustrating examples are provided and a simple criterion for the required condition is given in the case of linear h. 相似文献
109.
Z. Dostál A. Friedlander S.A. Santos K. Alesawi 《Computational Optimization and Applications》2002,23(1):127-133
In this paper we give corrections to our paper on an augmented Lagrangian type algorithm for strictly convex quadratic programming problems with equality constraints. 相似文献
110.
We use surrogate analysis and constraint pairing in multidimensional knapsack problems to fix some variables to zero and to separate the rest into two groups – those that tend to be zero and those that tend to be one, in an optimal integer solution. Using an initial feasible integer solution, we generate logic cuts based on our analysis before solving the problem with branch and bound. Computational testing, including the set of problems in the OR-library and our own set of difficult problems, shows our approach helps to solve difficult problems in a reasonable amount of time and, in most cases, with a fewer number of nodes in the search tree than leading commercial software. 相似文献