全文获取类型
收费全文 | 1295篇 |
免费 | 107篇 |
国内免费 | 40篇 |
专业分类
化学 | 82篇 |
力学 | 37篇 |
综合类 | 18篇 |
数学 | 1049篇 |
物理学 | 256篇 |
出版年
2024年 | 1篇 |
2023年 | 15篇 |
2022年 | 33篇 |
2021年 | 72篇 |
2020年 | 39篇 |
2019年 | 28篇 |
2018年 | 25篇 |
2017年 | 24篇 |
2016年 | 40篇 |
2015年 | 33篇 |
2014年 | 37篇 |
2013年 | 70篇 |
2012年 | 54篇 |
2011年 | 73篇 |
2010年 | 52篇 |
2009年 | 100篇 |
2008年 | 94篇 |
2007年 | 90篇 |
2006年 | 72篇 |
2005年 | 51篇 |
2004年 | 44篇 |
2003年 | 45篇 |
2002年 | 41篇 |
2001年 | 38篇 |
2000年 | 56篇 |
1999年 | 32篇 |
1998年 | 26篇 |
1997年 | 32篇 |
1996年 | 21篇 |
1995年 | 11篇 |
1994年 | 18篇 |
1993年 | 13篇 |
1992年 | 9篇 |
1991年 | 7篇 |
1990年 | 6篇 |
1988年 | 5篇 |
1987年 | 4篇 |
1986年 | 9篇 |
1985年 | 12篇 |
1984年 | 7篇 |
1982年 | 2篇 |
1979年 | 1篇 |
排序方式: 共有1442条查询结果,搜索用时 31 毫秒
211.
The main goals of this paper are to: i) relate two iteration-complexity bounds derived for the Mizuno-Todd-Ye predictor-corrector
(MTY P-C) algorithm for linear programming (LP), and; ii) study the geometrical structure of the LP central path. The first
iteration-complexity bound for the MTY P-C algorithm considered in this paper is expressed in terms of the integral of a certain
curvature function over the traversed portion of the central path. The second iteration-complexity bound, derived recently
by the authors using the notion of crossover events introduced by Vavasis and Ye, is expressed in terms of a scale-invariant
condition number associated with m × n constraint matrix of the LP. In this paper, we establish a relationship between these bounds by showing that the first one
can be majorized by the second one. We also establish a geometric result about the central path which gives a rigorous justification
based on the curvature of the central path of a claim made by Vavasis and Ye, in view of the behavior of their layered least
squares path following LP method, that the central path consists of long but straight continuous parts while the remaining curved part is relatively “short”.
R. D. C. Monteiro was supported in part by NSF Grants CCR-0203113 and CCF-0430644 and ONR grant N00014-05-1-0183. T. Tsuchiya
was supported in part by Japan-US Joint Research Projects of Japan Society for the Promotion of Science “Algorithms for linear
programs over symmetric cones” and the Grants-in-Aid for Scientific Research (C) 15510144 of Japan Society for the Promotion
of Science. 相似文献
212.
Saugata Basu 《Discrete and Computational Geometry》2008,40(4):481-503
Let
be an o-minimal structure over ℝ,
a closed definable set, and
the projection maps as depicted below:
For any collection
of subsets of
, and
, let
denote the collection of subsets of
where
. We prove that there exists a constant C=C(T)>0 such that for any family
of definable sets, where each A
i
=π
1(T∩π
2−1(y
i
)), for some y
i
∈ℝ
ℓ
, the number of distinct stable homotopy types amongst the arrangements
is bounded by
while the number of distinct homotopy types is bounded by
This generalizes to the o-minimal setting, bounds of the same type proved in Basu and Vorobjov (J. Lond. Math. Soc. (2) 76(3):757–776,
2007) for semi-algebraic and semi-Pfaffian families. One technical tool used in the proof of the above results is a pair of topological
comparison theorems reminiscent of Helly’s theorem in convexity theory. These theorems might be of independent interest in
the quantitative study of arrangements.
The author was supported in part by NSF grant CCF-0634907. 相似文献
214.
In this article, we consider a mini‐max multi‐agent optimization problem where multiple agents cooperatively optimize a sum of local convex–concave functions, each of which is available to one specific agent in a network. To solve the problem, we propose a distributed optimization method by extending classical mirror descent algorithms to the distributed setting. We obtain the convergence of the algorithm under wild conditions that the agent communication follows a directed graph and the related weighted matrices are row stochastic. In particular, when the weighted matrices are restricted to be doubly stochastic, we provide the explicit convergence rate of the algorithm by choosing the stepsize in a suitable way. The proposed algorithm can be viewed as a generalization of the subgradient projection methods since it utilizes a customized Bregman divergence instead of the usual Euclidean squared distance. Finally, some simulation results on a matrix game are presented to illustrate the performance of the algorithm. © 2016 Wiley Periodicals, Inc. Complexity 21: 178–190, 2016 相似文献
215.
216.
217.
We present a general computation model inspired in the notion of information hiding in software engineering. This model has the form of a game which we call quiz game. It allows in a uniform way to prove exponential lower bounds for several complexity problems. 相似文献
218.
Dariusz Dereniowski 《Discrete Applied Mathematics》2007,155(18):2601-2611
In this paper we deal with the arc ranking problem of directed graphs. We give some classes of graphs for which the arc ranking problem is polynomially solvable. We prove that deciding whether , where G is an acyclic orientation of a 3-partite graph is an NP-complete problem. In this way we answer an open question stated by Kratochvil and Tuza in 1999. 相似文献
219.
Exclusion algorithms have been used recently to find all solutions of a system of nonlinear equations or to find the global minimum of a function over a compact domain. These algorithms are based on a minimization condition that can be applied to each cell in the domain. In this paper, we consider Lipschitz functions of order α and give a new minimization condition for the exclusion algorithm. Furthermore, convergence and complexity results are presented for such algorithm. 相似文献
220.
袁中扬 《纯粹数学与应用数学》2007,23(2):283-288
借助快速付立叶变换(FFT),本文给出一种求n阶鳞状因子循环矩阵的逆阵、自反g-逆、群逆、Moore-Penrose逆的快速算法,该算法的计算复杂性为O(nlog2n),最后给出的两个数值算例表明了该算法的有效性. 相似文献