全文获取类型
收费全文 | 541篇 |
免费 | 9篇 |
国内免费 | 11篇 |
专业分类
化学 | 61篇 |
力学 | 4篇 |
综合类 | 1篇 |
数学 | 294篇 |
物理学 | 18篇 |
综合类 | 183篇 |
出版年
2023年 | 2篇 |
2022年 | 1篇 |
2021年 | 3篇 |
2020年 | 4篇 |
2019年 | 4篇 |
2018年 | 5篇 |
2017年 | 6篇 |
2016年 | 6篇 |
2015年 | 6篇 |
2014年 | 20篇 |
2013年 | 24篇 |
2012年 | 23篇 |
2011年 | 24篇 |
2010年 | 21篇 |
2009年 | 26篇 |
2008年 | 22篇 |
2007年 | 26篇 |
2006年 | 38篇 |
2005年 | 21篇 |
2004年 | 17篇 |
2003年 | 20篇 |
2002年 | 49篇 |
2001年 | 19篇 |
2000年 | 10篇 |
1999年 | 9篇 |
1998年 | 15篇 |
1997年 | 14篇 |
1996年 | 15篇 |
1995年 | 16篇 |
1994年 | 4篇 |
1993年 | 11篇 |
1992年 | 9篇 |
1991年 | 6篇 |
1990年 | 8篇 |
1989年 | 8篇 |
1988年 | 2篇 |
1987年 | 8篇 |
1986年 | 8篇 |
1985年 | 5篇 |
1984年 | 3篇 |
1982年 | 4篇 |
1981年 | 3篇 |
1980年 | 4篇 |
1978年 | 2篇 |
1977年 | 5篇 |
1976年 | 2篇 |
1975年 | 1篇 |
1972年 | 1篇 |
1970年 | 1篇 |
排序方式: 共有561条查询结果,搜索用时 656 毫秒
1.
对一类Minimax分式规划问题(MFP)提出一个迭代算法.首先通过引进变量和指数变换,将问题(MFP)等价转化为问题(Q),然后利用代数-几何平均不等式以及合适的转化过程,将等价问题(Q)压缩为凸规划问题(Q).从而根据选择不同的点所对应的压缩问题(Q),将原问题的求解过程转化为求解一系列的凸规划问题.数值实验表明算法是可行有效的. 相似文献
2.
An Improved Gradient Projection-based Decomposition Technique for Support Vector Machines 总被引:2,自引:0,他引:2
Luca Zanni 《Computational Management Science》2006,3(2):131-145
In this paper we propose some improvements to a recent decomposition technique for the large quadratic program arising in
training support vector machines. As standard decomposition approaches, the technique we consider is based on the idea to
optimize, at each iteration, a subset of the variables through the solution of a quadratic programming subproblem. The innovative
features of this approach consist in using a very effective gradient projection method for the inner subproblems and a special
rule for selecting the variables to be optimized at each step. These features allow to obtain promising performance by decomposing
the problem into few large subproblems instead of many small subproblems as usually done by other decomposition schemes. We
improve this technique by introducing a new inner solver and a simple strategy for reducing the computational cost of each
iteration. We evaluate the effectiveness of these improvements by solving large-scale benchmark problems and by comparison
with a widely used decomposition package. 相似文献
3.
带有回报计划的动态客户关系管理模型及实验应用分析 总被引:1,自引:0,他引:1
在客户最大化效用及公司最大化CLV的动态环境下。对所提的带有回报计划的动态客户关系管理模型用于某超市的客户数据库中,发现模型的结果对这类客户是适用的。并给出了不同的客户状态空间对应的有效营销组合策略。结果表明:合适的回报计划可以促进客户的购买、提高公司的利润及缓解价格竞争。回报极限应该比客户的平均购买水平偏高,回报率应该与回报极限的改变方向一致。计划的时间范围应定在一年左右比较合适。对于累积购买水平较高的客户一般不邮寄商品信息。在回报计划的初期与末期不用打折。中期对那些购买次数很少的客户可以实行相应的降价策略。 相似文献
4.
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. 相似文献
5.
Inexact Newton methods for the nonlinear complementarity problem 总被引:2,自引:0,他引:2
Jong-Shi Pang 《Mathematical Programming》1986,36(1):54-71
An exact Newton method for solving a nonlinear complementarity problem consists of solving a sequence of linear complementarity
subproblems. For problems of large size, solving the subproblems exactly can be very expensive. In this paper we study inexact
Newton methods for solving the nonlinear, complementarity problem. In such an inexact method, the subproblems are solved only
up to a certain degree of accuracy. The necessary accuracies that are needed to preserve the nice features of the exact Newton
method are established and analyzed. We also discuss some extensions as well as an application.
This research was based on work supported by the National Science Foundation under grant ECS-8407240. 相似文献
6.
本文我们利用一个可微函数给出了一对高阶对称规划问题 ,其中目标函数包含了Rn 中一紧凸集的支撑函数 .在引入高阶F 凸性 (F 伪凸性 ,F 拟凸性 )后 ,证明了高阶弱、高阶强及高阶逆对称对偶性质 . 相似文献
7.
The classes ofL
1-matrices,L
2-matrices,L
3-matrices andW-matrices are introduced to study solvability of a linear complementarity problem via solving a linear program. Three sufficient
conditions are presented to guarantee that a linear complementarity problem is solvable via a linear program. The new sufficient
conditions are weaker than the ones introduced by Mangasarian. This fact is also illustrated by an example.
Partially supported by NSFC.
This author is also with College of Business Administration of Human University as a Lotus chair professor. 相似文献
8.
The purpose of this paper is to present general approaches for bounding some multi-stage stochastic programs from above. The results are based on restricting the solution set, such that the remaining multi-stage stochastic program is easy to solve. An example where the methods can be applied is presented.Supported in part by NATO Collaborative Research Grant No. 0785/87. 相似文献
9.
We present a new approach, requiring the solution of a SemiDefinite Program, for decomposing the Hessian of a nonseparable mixed-integer quadratic problem to permit using perspective cuts to improve its continuous relaxation bound. The new method favorably compares with a previously proposed one requiring a minimum eigenvalue computation. 相似文献
10.
We exhibit a probabilistic algorithm which computes a rational point of an absolutely irreducible variety over a finite field defined by a reduced regular sequence. Its time-space complexity is roughly quadratic in the logarithm of the cardinality of the field and a geometric invariant of the input system. This invariant, called the degree, is bounded by the Bézout number of the system. Our algorithm works for fields of any characteristic, but requires the cardinality of the field to be greater than a quantity which is roughly the fourth power of the degree of the input variety.