全文获取类型
收费全文 | 1434篇 |
免费 | 85篇 |
国内免费 | 33篇 |
专业分类
化学 | 70篇 |
晶体学 | 1篇 |
力学 | 136篇 |
综合类 | 11篇 |
数学 | 1180篇 |
物理学 | 154篇 |
出版年
2023年 | 14篇 |
2022年 | 17篇 |
2021年 | 25篇 |
2020年 | 23篇 |
2019年 | 23篇 |
2018年 | 18篇 |
2017年 | 29篇 |
2016年 | 27篇 |
2015年 | 36篇 |
2014年 | 62篇 |
2013年 | 96篇 |
2012年 | 77篇 |
2011年 | 58篇 |
2010年 | 52篇 |
2009年 | 73篇 |
2008年 | 82篇 |
2007年 | 99篇 |
2006年 | 83篇 |
2005年 | 57篇 |
2004年 | 52篇 |
2003年 | 44篇 |
2002年 | 49篇 |
2001年 | 44篇 |
2000年 | 29篇 |
1999年 | 44篇 |
1998年 | 35篇 |
1997年 | 36篇 |
1996年 | 27篇 |
1995年 | 28篇 |
1994年 | 24篇 |
1993年 | 18篇 |
1992年 | 15篇 |
1991年 | 13篇 |
1990年 | 13篇 |
1989年 | 14篇 |
1988年 | 10篇 |
1987年 | 7篇 |
1986年 | 18篇 |
1985年 | 15篇 |
1984年 | 5篇 |
1983年 | 2篇 |
1982年 | 9篇 |
1981年 | 4篇 |
1980年 | 11篇 |
1979年 | 9篇 |
1978年 | 10篇 |
1977年 | 5篇 |
1976年 | 5篇 |
1975年 | 1篇 |
1974年 | 5篇 |
排序方式: 共有1552条查询结果,搜索用时 339 毫秒
61.
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. 相似文献
62.
We describe a technique for generating a special class, called QPEC, of mathematical programs with equilibrium constraints, MPEC. A QPEC is a quadratic MPEC, that is an optimization problem whose objective function is quadratic, first-level constraints are linear, and second-level (equilibrium) constraints are given by a parametric affine variational inequality or one of its specialisations. The generator, written in MATLAB, allows the user to control different properties of the QPEC and its solution. Options include the proportion of degenerate constraints in both the first and second level, ill-conditioning, convexity of the objective, monotonicity and symmetry of the second-level problem, and so on. We believe these properties may substantially effect efficiency of existing methods for MPEC, and illustrate this numerically by applying several methods to generator test problems. Documentation and relevant codes can be found by visiting http://www.ms.unimelb.edu.au/danny/qpecgendoc.html. 相似文献
63.
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. 相似文献
64.
A. Y. Lee 《Journal of Optimization Theory and Applications》1988,57(3):519-536
Neighboring extremals of dynamic optimization problems with path equality constraints and with an unknown parameter vector
are considered in this paper. With some simplifications, the problem is reduced to solving a linear, time-varying two-point
boundary-value problem with integral path equality constraints. A modified backward sweep method is used to solve this problem.
Two example problems are solved to illustrate the validity and usefulness of the solution technique.
This research was supported in part by the National Aeronautics and Space Administration under NASA Grant No. NCC-2-106.
The author is indebted to Professor A. E. Bryson, Jr., Department of Aeronautics and Astronautics, Stanford University, for
many stimulating discussions. 相似文献
65.
66.
An algorithm is presented for the design of optimal detection filters in radar and communications systems, subject to inequality constraints on the maximum output sidelobe levels. This problem was reduced in an earlier paper (Ref. 1) to an unconstrained one in the dual space of regular Borel measures, with a nondifferentiable cost functional. Here, the dual problem is solved via steepest descent, using the directional Gateaux differential. The algorithm is shown to be convergent, and numerical results are presented.This research was supported by the Australian Research Grants Committee. 相似文献
67.
68.
A multiple objective waste-disposal model is developed and analysed. The model is a modification of the single objective waste-disposal model of Alley, Aguado and Remson. The solution structure is obtained using the method of constraints so that dual variables (shadow prices) are available with the solutions. 相似文献
69.
Roman Barták 《Annals of Operations Research》2003,118(1-4):101-119
Global constraints provide strong filtering algorithms to reduce the search space when solving large combinatorial problems. In this paper we propose to make the global constraints dynamic, i.e., to allow extending the set of constrained variables during search. We describe a generic dynamisation technique for an arbitrary monotonic global constraint and we compare it with the semantic-based dynamisation for the alldifferent constraint. At the end we sketch a dynamisation technique for non-monotonic global constraints. A comparison with existing methods to model dynamic problems is given as well. 相似文献
70.
线性约束最优化的一个共轭投影梯度法 总被引:1,自引:0,他引:1
本结合共轭梯度法及梯度投影法的思想,建立线性等式约束最优化的一个新算法,称之为共轭投影梯度法。分别对二次凸目标函数和一般目标函数分析和论证了算法的重要性质和收敛性。 相似文献