首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   5102篇
  国内免费   166篇
  完全免费   155篇
  数学   5423篇
  2019年   9篇
  2018年   114篇
  2017年   86篇
  2016年   97篇
  2015年   126篇
  2014年   176篇
  2013年   218篇
  2012年   182篇
  2011年   303篇
  2010年   290篇
  2009年   364篇
  2008年   349篇
  2007年   265篇
  2006年   276篇
  2005年   185篇
  2004年   189篇
  2003年   160篇
  2002年   139篇
  2001年   153篇
  2000年   133篇
  1999年   139篇
  1998年   136篇
  1997年   125篇
  1996年   138篇
  1995年   102篇
  1994年   95篇
  1993年   93篇
  1992年   93篇
  1991年   72篇
  1990年   82篇
  1989年   58篇
  1988年   71篇
  1987年   54篇
  1986年   47篇
  1985年   40篇
  1984年   35篇
  1983年   4篇
  1982年   22篇
  1981年   23篇
  1980年   28篇
  1979年   22篇
  1978年   14篇
  1977年   21篇
  1976年   18篇
  1975年   6篇
  1974年   5篇
  1973年   18篇
  1972年   13篇
  1971年   11篇
  1970年   10篇
  1969年   6篇
  1968年   6篇
  1967年   2篇
排序方式: 共有5423条查询结果,搜索用时 171 毫秒
1.
Shortest paths algorithms: Theory and experimental evaluation   总被引:37,自引:0,他引:37  
We conduct an extensive computational study of shortest paths algorithms, including some very recent algorithms. We also suggest new algorithms motivated by the experimental results and prove interesting theoretical results suggested by the experimental data. Our computational study is based on several natural problem classes which identify strengths and weaknesses of various algorithms. These problem classes and algorithm implementations form an environment for testing the performance of shortest paths algorithms. The interaction between the experimental evaluation of algorithm behavior and the theoretical analysis of algorithm performance plays an important role in our research. This work was done while Boris V. Cherkassky was visiting Stanford University Computer Science Department and supported by the NSF and Powell Foundation grants mentioned below. Andrew V. Goldberg was supported in part by ONR Young Investigator Award N00014-91-J-1855, NSF Presidential Young Investigator Grant CCR-8858097 with matching funds from AT&T, DEC, and 3M, and a grant from Powell Foundation. Corresponding author. This work was done while Tomasz Radzik was a Postdoctoral Fellow at SORIE, Cornell University, and supported by the National Science Foundation, the Air Force Office of Scientific Research, and the Office of Naval Research, through NSF grant DMS-8920550, and by the Packard Fellowship of éva Tardos.  相似文献
2.
二阶非线性中立型泛函微分方程周期解的存在性   总被引:25,自引:1,他引:24       下载免费PDF全文
王根强  燕居让 《数学学报》2004,47(2):379-384
本文利用重合度理论,研究二阶非线性中立型泛函微分方程[x(t)+cx(t- τ)]11+g(t,x(t-σ)=p(t)的周期解的存在性,给出该方程存在周期解的充分性定理.  相似文献
3.
A globally convergent method for nonlinear programming   总被引:20,自引:0,他引:20  
Recently developed Newton and quasi-Newton methods for nonlinear programming possess only local convergence properties. Adopting the concept of the damped Newton method in unconstrained optimization, we propose a stepsize procedure to maintain the monotone decrease of an exact penalty function. In so doing, the convergence of the method is globalized.This research was supported in part by the National Science Foundation under Grant No. ENG-75-10486.  相似文献
4.
k紧优双环网络及其无限族   总被引:19,自引:0,他引:19       下载免费PDF全文
周建钦 《数学学报》2005,48(6):1213-1220
在L形瓦理论的基础上,结合中国余数定理,证明了任给非负整数m,存在整数k(k>m),可以构造k紧优双环网络的无限族;给出了判断N个节点存在k(k≥0)紧优双环网络的一个算法。  相似文献
5.
Constraint Programming typically uses the technique of depth-first branch and bound as the method of solving optimization problems. Although this method can give the optimal solution, for large problems, the time needed to find the optimal can be prohibitive. This paper introduces a method for using local search techniques within a Constraint Programming framework, and applies this technique to vehicle routing problems. We introduce a Constraint Programming model for vehicle routing, and a system for integrating Constraint Programming and local search techniques. We then describe how the method can be accelerated by handling core constraints using fast local checks, while other more complex constraints are left to the constraint propagation system. We have coupled our local search method with a meta-heuristic to avoid the search being trapped in local minima. Several meta-heuristics are investigated ranging from a simple Tabu Search method to Guided Local Search. An empirical study over benchmark problems shows the relative merits of these techniques. Investigations indicate that the specific long-term memory technique used by Guided Local Search can be used as a diversification method for Tabu Search, resulting in significant benefit. Several new best solutions on the Solomon problems are found in relatively few iterations of our algorithm.  相似文献
6.
On the Local and Superlinear Convergence of Quasi-Newton Methods   总被引:13,自引:0,他引:13  
This paper presents a local convergence analysis for severalwell-known quasi-Newton methods when used, without line searches,in an iteration of the form to solve for x* such that Fx* = 0. The basic idea behind theproofs is that under certain reasonable conditions on xo, Fand xo, the errors in the sequence of approximations {Hk} toF'(x*)–1 can be shown to be of bounded deterioration inthat these errors, while not ensured to decrease, can increaseonly in a controlled way. Despite the fact that Hk is not shownto approach F'(x*)–1, the methods considered, includingthose based on the single-rank Broyden and double-rank Davidon-Fletcher-Powellformulae, generate locally Q-superlinearly convergent sequences{xk}.  相似文献
7.
Integration and approximation in arbitrary dimensions   总被引:13,自引:0,他引:13  
We study multivariate integration and approximation for various classes of functions of d variables with arbitrary d. We consider algorithms that use function evaluations as the information about the function. We are mainly interested in verifying when integration and approximation are tractable and strongly tractable. Tractability means that the minimal number of function evaluations needed to reduce the initial error by a factor of ɛ is bounded by C(dp for some exponent p independent of d and some function C(d). Strong tractability means that C(d) can be made independent of d. The ‐exponents of tractability and strong tractability are defined as the smallest powers of ɛ{-1} in these bounds. We prove that integration is strongly tractable for some weighted Korobov and Sobolev spaces as well as for the Hilbert space whose reproducing kernel corresponds to the covariance function of the isotropic Wiener measure. We obtain bounds on the ‐exponents, and for some cases we find their exact values. For some weighted Korobov and Sobolev spaces, the strong ‐exponent is the same as the ‐exponent for d=1, whereas for the third space it is 2. For approximation we also consider algorithms that use general evaluations given by arbitrary continuous linear functionals as the information about the function. Our main result is that the ‐exponents are the same for general and function evaluations. This holds under the assumption that the orthonormal eigenfunctions of the covariance operator have uniformly bounded L∞ norms. This assumption holds for spaces with shift-invariant kernels. Examples of such spaces include weighted Korobov spaces. For a space with non‐shift‐invariant kernel, we construct the corresponding space with shift-invariant kernel and show that integration and approximation for the non-shift-invariant kernel are no harder than the corresponding problems with the shift-invariant kernel. If we apply this construction to a weighted Sobolev space, whose kernel is non-shift-invariant, then we obtain the corresponding Korobov space. This enables us to derive the results for weighted Sobolev spaces. This revised version was published online in June 2006 with corrections to the Cover Date.  相似文献
8.
The trust region problem, minimization of a quadratic function subject to a spherical trust region constraint, occurs in many optimization algorithms. In a previous paper, the authors introduced an inexpensive approximate solution technique for this problem that involves the solution of a two-dimensional trust region problem. They showed that using this approximation in an unconstrained optimization algorithm leads to the same theoretical global and local convergence properties as are obtained using the exact solution to the trust region problem. This paper reports computational results showing that the two-dimensional minimization approach gives nearly optimal reductions in then-dimension quadratic model over a wide range of test cases. We also show that there is very little difference, in efficiency and reliability, between using the approximate or exact trust region step in solving standard test problems for unconstrained optimization. These results may encourage the application of similar approximate trust region techniques in other contexts.Research supported by ARO contract DAAG 29-84-K-0140, NSF grant DCR-8403483, and NSF cooperative agreement DCR-8420944.  相似文献
9.
A learning process for fuzzy control rules using genetic algorithms   总被引:10,自引:0,他引:10  
The purpose of this paper is to present a genetic learning process for learning fuzzy control rules from examples. It is developed in three stages: the first one is a fuzzy rule genetic generating process based on a rule learning iterative approach, the second one combines two kinds of rules, experts rules if there are and the previously generated fuzzy control rules, removing the redundant fuzzy rules, and the thrid one is a tuning process for adjusting the membership functions of the fuzzy rules. The three components of the learning process are developed formulating suitable genetic algorithms.  相似文献
10.
Solving large quadratic assignment problems on computational grids   总被引:10,自引:0,他引:10  
The quadratic assignment problem (QAP) is among the hardest combinatorial optimization problems. Some instances of size n = 30 have remained unsolved for decades. The solution of these problems requires both improvements in mathematical programming algorithms and the utilization of powerful computational platforms. In this article we describe a novel approach to solve QAPs using a state-of-the-art branch-and-bound algorithm running on a federation of geographically distributed resources known as a computational grid. Solution of QAPs of unprecedented complexity, including the nug30, kra30b, and tho30 instances, is reported. Received: September 29, 2000 / Accepted: June 5, 2001?Published online October 2, 2001  相似文献
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号