全文获取类型
收费全文 | 696篇 |
免费 | 12篇 |
国内免费 | 11篇 |
专业分类
化学 | 44篇 |
力学 | 24篇 |
综合类 | 7篇 |
数学 | 519篇 |
物理学 | 125篇 |
出版年
2023年 | 8篇 |
2022年 | 9篇 |
2021年 | 11篇 |
2020年 | 10篇 |
2019年 | 10篇 |
2018年 | 3篇 |
2017年 | 17篇 |
2016年 | 18篇 |
2015年 | 19篇 |
2014年 | 31篇 |
2013年 | 38篇 |
2012年 | 30篇 |
2011年 | 26篇 |
2010年 | 28篇 |
2009年 | 52篇 |
2008年 | 51篇 |
2007年 | 37篇 |
2006年 | 36篇 |
2005年 | 21篇 |
2004年 | 25篇 |
2003年 | 17篇 |
2002年 | 13篇 |
2001年 | 18篇 |
2000年 | 30篇 |
1999年 | 18篇 |
1998年 | 10篇 |
1997年 | 15篇 |
1996年 | 12篇 |
1995年 | 13篇 |
1994年 | 8篇 |
1993年 | 7篇 |
1992年 | 9篇 |
1991年 | 2篇 |
1989年 | 1篇 |
1988年 | 3篇 |
1987年 | 2篇 |
1986年 | 5篇 |
1985年 | 9篇 |
1984年 | 9篇 |
1983年 | 8篇 |
1982年 | 5篇 |
1981年 | 6篇 |
1980年 | 5篇 |
1979年 | 5篇 |
1978年 | 5篇 |
1977年 | 2篇 |
1973年 | 1篇 |
1966年 | 1篇 |
排序方式: 共有719条查询结果,搜索用时 15 毫秒
61.
The Symmetric Rectilinear Steiner Arborescence (SRStA) problem is defined as follows: given a set of terminals in the positive quadrant of the plane, connect them using horizontal and vertical lines such that each terminal can be reached from the origin via a y-monotone path and the total length of all the line segments is the minimum possible. Finding an SRStA has applications in VLSI design, in data structures used in some optimization algorithms and in dynamic server problems. In this paper, we provide a polynomial time approximation scheme for the SRStA problem, improving the previous best approximation ratio of 3 for this problem. 相似文献
62.
带约束的平行机排序的一个近似算法 总被引:3,自引:0,他引:3
何勇 《高校应用数学学报(A辑)》2001,16(1):114-118
讨论有资源约束和有机器准备时间的平行机排序问题,资源约束为每个机器至多可加工k个工件,在极小化makespan的上给出了一个匹配算法,证明其最坏情况最紧界是2-m^-1,并进一步给出了它的两个带参数的最坏情况界。 相似文献
63.
本文中我们将研究语言,上素数阶群理论T的量词消去及相应的复杂性.我们证明理论T有量词消去性质,并利用该性质给出理论T判定问题的一个复杂性上界. 相似文献
64.
This paper presents a new generic Evolutionary Algorithm (EA) for retarding the unwanted effects of premature convergence. This is accomplished by a combination of interacting generic methods. These generalizations of a Genetic Algorithm (GA) are inspired by population genetics and take advantage of the interactions between genetic drift and migration. In this regard a new selection scheme is introduced, which is designed to directedly control genetic drift within the population by advantageous self-adaptive selection pressure steering. Additionally this new selection model enables a quite intuitive heuristics to detect premature convergence. Based upon this newly postulated basic principle the new selection mechanism is combined with the already proposed Segregative Genetic Algorithm (SEGA), an advanced Genetic Algorithm (GA) that introduces parallelism mainly to improve global solution quality. As a whole, a new generic evolutionary algorithm (SASEGASA) is introduced. The performance of the algorithm is evaluated on a set of characteristic benchmark problems. Computational results show that the new method is capable of producing highest quality solutions without any problem-specific additions. 相似文献
65.
该文通过构造特殊形式的有效集来逼近KKT点处的有效集,给出了一个任意初始点下的序列线性方程组新算法,并证明了该算法在没有严格互补松驰条件的情况下具有全局收敛性和一步超线性收敛性。
相似文献
66.
本文考虑一类半线性双曲系统的状态观测问题,给出了一个(求解)算法并证明了其在某种相当强的意义上的有效性. 相似文献
67.
68.
Fast pattern-matching on indeterminate strings 总被引:2,自引:0,他引:2
In a string x on an alphabet Σ, a position i is said to be indeterminate iff x[i] may be any one of a specified subset {λ1,λ2,…,λj} of Σ, 2j|Σ|. A string x containing indeterminate positions is therefore also said to be indeterminate. Indeterminate strings can arise in DNA and amino acid sequences as well as in cryptological applications and the analysis of musical texts. In this paper we describe fast algorithms for finding all occurrences of a pattern p=p[1..m] in a given text x=x[1..n], where either or both of p and x can be indeterminate. Our algorithms are based on the Sunday variant of the Boyer–Moore pattern-matching algorithm, one of the fastest exact pattern-matching algorithms known. The methodology we describe applies more generally to all variants of Boyer–Moore (such as Horspool's, for example) that depend only on calculation of the δ (“rightmost shift”) array: our method therefore assumes that Σ is indexed (essentially, an integer alphabet), a requirement normally satisfied in practice. 相似文献
69.
Layne T. Watson 《Mathematical Programming》1980,19(1):92-101
The Chow—Yorke algorithm is a nonsimplicial homotopy type method for computing Brouwer fixed points that is globally convergent. It is efficient and accurate for fixed point problems. L.T. Watson, T.Y. Li, and C.Y. Wang have adapted the method for zero finding problems, the nonlinear complementarity problem, and nonlinear two-point boundary value problems. Here theoretical justification is given for applying the method to some mathematical programming problems, and computational results are presented.This work was partially supported by NSF Grant MCS 7821337. 相似文献
70.