全文获取类型
收费全文 | 13942篇 |
免费 | 1313篇 |
国内免费 | 588篇 |
专业分类
化学 | 1579篇 |
晶体学 | 34篇 |
力学 | 1083篇 |
综合类 | 351篇 |
数学 | 9481篇 |
物理学 | 3315篇 |
出版年
2024年 | 22篇 |
2023年 | 107篇 |
2022年 | 329篇 |
2021年 | 305篇 |
2020年 | 229篇 |
2019年 | 338篇 |
2018年 | 372篇 |
2017年 | 423篇 |
2016年 | 506篇 |
2015年 | 369篇 |
2014年 | 705篇 |
2013年 | 944篇 |
2012年 | 714篇 |
2011年 | 842篇 |
2010年 | 699篇 |
2009年 | 969篇 |
2008年 | 1003篇 |
2007年 | 933篇 |
2006年 | 764篇 |
2005年 | 611篇 |
2004年 | 544篇 |
2003年 | 462篇 |
2002年 | 444篇 |
2001年 | 386篇 |
2000年 | 338篇 |
1999年 | 363篇 |
1998年 | 297篇 |
1997年 | 239篇 |
1996年 | 240篇 |
1995年 | 199篇 |
1994年 | 174篇 |
1993年 | 153篇 |
1992年 | 123篇 |
1991年 | 80篇 |
1990年 | 82篇 |
1989年 | 66篇 |
1988年 | 53篇 |
1987年 | 45篇 |
1986年 | 45篇 |
1985年 | 55篇 |
1984年 | 56篇 |
1983年 | 20篇 |
1982年 | 38篇 |
1981年 | 38篇 |
1980年 | 28篇 |
1979年 | 21篇 |
1978年 | 12篇 |
1977年 | 13篇 |
1975年 | 9篇 |
1974年 | 9篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
91.
This paper is about algorithms that schedule tasks to be performed in a distributed failure‐prone environment, when processors communicate by message‐passing, and when tasks are independent and of unit length. The processors work under synchrony and may fail by crashing. Failure patterns are imposed by adversaries. Linearly‐bounded adversaries may fail up to a constant fraction of the processors. Weakly‐adaptive adversaries have to select, prior to the start of an execution, a subset of processors to be failure‐prone, and then may fail only the selected processors, at arbitrary steps, in the course of the execution. Strongly adaptive adversaries have a total number of failures as the only restriction on failure patterns. The measures of complexity are work, measured as the available processor steps, and communication, measured as the number of point‐to‐point messages. A randomized algorithm is developed, that attains both ??(n log*n) expected work and ??(n log*n) expected communication, against weakly‐adaptive linearly‐bounded adversaries, in the case when the numbers of tasks and processors are both equal to n. This is in contrast with performance of algorithms against strongly‐adaptive linearly‐bounded adversaries, which has to be Ω(n log n/log log n) in terms of work. © 2003 Wiley Periodicals, Inc. Random Struct. Alg., 2004 相似文献
92.
93.
94.
95.
Clemens Amstler 《Monatshefte für Mathematik》1995,119(3):177-186
In this paper we establish an inequality of Koksma-Hlawka-type for compact groups. We first define a discrepancy for compact groups based on discrepancy operators introduced by W. Fleischer and show the relation to the classicalL
2-discrepancy. Then we prove the inequality for functions in a weightedL
2-space. 相似文献
96.
97.
In this paper,we consider a class of quadratic maximization problems.For a subclass of the problems,we show that the SDP relaxation approach yields an approximation solution with the ratio is dependent on the data of the problem with α being a uniform lower bound.In light of this new bound,we show that the actual worst-case performance ratio of the SDP relaxation approach (with the triangle inequalities added) is at least α δd if every weight is strictly positive,where δd > 0 is a constant depending on the problem dimension and data. 相似文献
98.
This paper studies the problem of how changes in the design of the genetic algorithm (GA) have an effect on the results obtained in real-life applications. In this study, focused on the application of a GA to the tuning of technical trading rules in the context of financial markets, our tentative thesis is that the GA is robust with respect to design changes. The optimization of technical trading systems is a suitable area for the application of the GA metaheuristic, as the complexity of the problem grows exponentially as new technical rules are added to the system and as the answer time is crucial when applying the system to real-time data. Up to now, most of GAs applications to this subject obviated the question of possible “design dependence” in their results. The data we report, based on our experiments, do not allow us to refute the hypothesis of robustness of the GA to design implementation, when applying to technical trading systems tuning. 相似文献
99.
100.
This article introduces and analyzes a p-version FEM for variational inequalities resulting from obstacle problems for some quasi-linear elliptic partial differential
operators. We approximate the solution by controlling the obstacle condition in images of the Gauss–Lobatto points. We show
existence and uniqueness for the discrete solution u
p
from the p-version for the obstacle problem. We prove the convergence of u
p
towards the solution with respect to the energy norm, and assuming some additional regularity for the solution we derive
an a priori error estimate. In numerical experiments the p-version turns out to be superior to the h-version concerning the convergence rate and the number of unknowns needed to achieve a certain exactness of the approximation. 相似文献