全文获取类型
收费全文 | 605篇 |
免费 | 2篇 |
专业分类
化学 | 7篇 |
力学 | 11篇 |
综合类 | 4篇 |
数学 | 567篇 |
物理学 | 18篇 |
出版年
2023年 | 1篇 |
2022年 | 1篇 |
2021年 | 2篇 |
2020年 | 3篇 |
2018年 | 1篇 |
2017年 | 2篇 |
2016年 | 3篇 |
2015年 | 2篇 |
2014年 | 14篇 |
2013年 | 28篇 |
2012年 | 75篇 |
2011年 | 15篇 |
2010年 | 9篇 |
2009年 | 28篇 |
2008年 | 13篇 |
2007年 | 23篇 |
2006年 | 25篇 |
2005年 | 14篇 |
2004年 | 10篇 |
2003年 | 7篇 |
2002年 | 17篇 |
2001年 | 14篇 |
2000年 | 11篇 |
1999年 | 9篇 |
1998年 | 10篇 |
1997年 | 6篇 |
1996年 | 15篇 |
1995年 | 6篇 |
1994年 | 11篇 |
1993年 | 6篇 |
1992年 | 8篇 |
1991年 | 2篇 |
1990年 | 1篇 |
1989年 | 2篇 |
1988年 | 1篇 |
1987年 | 2篇 |
1986年 | 15篇 |
1985年 | 26篇 |
1984年 | 25篇 |
1983年 | 19篇 |
1982年 | 24篇 |
1981年 | 15篇 |
1980年 | 28篇 |
1979年 | 19篇 |
1978年 | 30篇 |
1977年 | 5篇 |
1972年 | 2篇 |
1969年 | 1篇 |
1967年 | 1篇 |
排序方式: 共有607条查询结果,搜索用时 31 毫秒
31.
A multiplier method with automatic limitation of penalty growth 总被引:3,自引:0,他引:3
This paper presents a multiplier method for solving optimization problems with equality and inequality constraints. The method realizes all the good features that were foreseen by R. Fletcher for this type of algorithm in the past, but which suffers from none of the drawbacks of the earlier attempts.Research sponsored by the National Science Foundation (RANN) Grant ENV76-04264 the National Science Foundation Grant ENG73-08214-A01 and the Sweden-American Foundation. 相似文献
32.
Fern Sassower Sisser 《Mathematical Programming》1981,20(1):110-121
The problem of minimizing a nonlinear objective function ofn variables, with continuous first and second partial derivatives, subject to nonnegativity constraints or upper and lower bounds on the variables is studied. The advisability of solving such a constrained optimization problem by making a suitable transformation of its variables in order to change the problem into one of unconstrained minimization is considered. A set of conditions which guarantees that every local minimum of the new unconstrained problem also satisfies the first-order necessary (Kuhn—Tucker) conditions for a local minimum of the original constrained problem is developed. It is shown that there are certain conditions under which the transformed objective function will maintain the convexity of the original objective function in a neighborhood of the solution. A modification of the method of transformations which moves away from extraneous stationary points is introduced and conditions under which the method generates a sequence of points which converges to the solution at a superlinear rate are given. 相似文献
33.
Our model is a generalized linear programming relaxation of a much studied random K-SAT problem. Specifically, a set of linear constraints on K variables is fixed. From a pool of n variables, K variables are chosen uniformly at random and a constraint is chosen from also uniformly at random. This procedure is repeated m times independently. We are interested in whether the resulting linear programming problem is feasible. We prove that the feasibility property experiences a linear phase transition, when n and m = cn for a constant c. Namely, there exists a critical value c* such that, when c < c*, the problem is feasible or is asymptotically almost feasible, as n, but, when c>c*, the distance to feasibility is at least a positive constant independent of n. Our result is obtained using the combination of a powerful local weak convergence method developed in Aldous [Ald92], [Ald01], Aldous and Steele [AS03], Steele [Ste02] and martingale techniques. By exploiting a linear programming duality, our theorem implies the following result in the context of sparse random graphs G(n, cn) on n nodes with cn edges, where edges are equipped with randomly generated weights. Let (n, c) denote maximum weight matching in G(n, cn). We prove that when c is a constant and n , the limit limn (n, c)/n, exists, with high probability. We further extend this result to maximum weight b-matchings also in G(n, cn). 相似文献
34.
A binary relation R does not always possess the desirable property of transitivity. Consequently, this needs to be imposed artificially by deviating
as little as possible from R. In this paper, three approaches to transitive approximation are analyzed within a common distance-based framework: exterior
(transitive closure), interior (openings or maximal transitive sub-relations contained in R) and mixed (transitive fittings) approximation. Additionally, we propose a method for obtaining all these transitive approximations.
The method is based on a distance function optimization framework that leads to straightforward goal programming models. 相似文献
35.
The Level of Repair Analysis – LORA – is an analytic methodology aimed at determining: (i) the optimal location of facilities that compose a maintenance structure; (ii) the quantity of required resources in each facility; and (iii) the best repair policies, i.e., rules that determine if a given component should be discarded or repaired, and where those actions should take place. This work presents a mixed-integer programming model for LORA that is more comprehensive than others in the literature, being suitable to many practical situations. The model was applied to 15 substantial real world problems, and considering distinct maintenance policies to some of them, resulted in 22 different solutions, all of which could be achieved by a commercial Mixed-Integer Programming (MIP) solver in reasonable times. 相似文献
36.
The duality between facets of the convex hull of disjunctive sets and the extreme points of reverse polars of these sets is utilized to establish simple rules for the derivation of all facet cuts for simple disjunctions, namely, elementary disjunctions in nonnegative variables. These rules generalize the cut generation procedure underlying polyhedral convexity cuts with negative edge extensions. The latter are also shown to possess some interesting properties with respect to a biextremal problem that maximizes the distance, from the origin, of the nearest point feasible to the cut. A computationally inexpensive procedure is given to generate facet cuts for simple disjunctions which are dominant with respect to any specified preemptive ordering of variables. 相似文献
37.
We consider two-stage pure integer programs with discretely distributed stochastic right-hand sides. We present an equivalent
superadditive dual formulation that uses the value functions in both stages. We give two algorithms for finding the value
functions. To solve the reformulation after obtaining the value functions, we develop a global branch-and-bound approach and
a level-set approach to find an optimal tender. We show that our method can solve randomly generated instances whose extensive
forms are several orders of magnitude larger than the extensive forms of those instances found in the literature.
This work is supported by National Science Foundation grants DMI-0217190 and DMI-0355433. 相似文献
38.
用Matlab编程的方法对长周期光栅功率特性进行了研究,数值模拟了长周期光栅入射角度、光栅长度与功率分布的图像关系.研究结论为长周期光纤光栅的设计提供理论依据. 相似文献
39.
用Matlab编程的方法对长周期光纤光栅的透射光谱谱线特性进行了研究,数值模拟了长周期光纤光栅周期对光谱谱线的影响.研究结论为长周期光纤光栅的设计提供了理论依据. 相似文献
40.
《International Journal of Approximate Reasoning》2014,55(5):1269-1300
When the information about uncertainty cannot be quantified in a simple, probabilistic way, the topic of possibilistic decision theory is often a natural one to consider. The development of possibilistic decision theory has lead to the proposition a series of possibilistic criteria, namely: optimistic and pessimistic possibilistic qualitative criteria [7], possibilistic likely dominance [2], [9], binary possibilistic utility [11] and possibilistic Choquet integrals [24]. This paper focuses on sequential decision making in possibilistic decision trees. It proposes a theoretical study on the complexity of the problem of finding an optimal strategy depending on the monotonicity property of the optimization criteria – when the criterion is transitive, this property indeed allows a polytime solving of the problem by Dynamic Programming. We show that most possibilistic decision criteria, but possibilistic Choquet integrals, satisfy monotonicity and that the corresponding optimization problems can be solved in polynomial time by Dynamic Programming. Concerning the possibilistic likely dominance criteria which is quasi-transitive but not fully transitive, we propose an extended version of Dynamic Programming which remains polynomial in the size of the decision tree. We also show that for the particular case of possibilistic Choquet integrals, the problem of finding an optimal strategy is NP-hard. It can be solved by a Branch and Bound algorithm. Experiments show that even not necessarily optimal, the strategies built by Dynamic Programming are generally very good. 相似文献