全文获取类型
收费全文 | 32639篇 |
免费 | 1090篇 |
国内免费 | 249篇 |
专业分类
化学 | 22671篇 |
晶体学 | 223篇 |
力学 | 768篇 |
数学 | 5422篇 |
物理学 | 4894篇 |
出版年
2022年 | 283篇 |
2021年 | 420篇 |
2020年 | 514篇 |
2019年 | 484篇 |
2018年 | 376篇 |
2017年 | 372篇 |
2016年 | 835篇 |
2015年 | 737篇 |
2014年 | 807篇 |
2013年 | 1725篇 |
2012年 | 1866篇 |
2011年 | 2352篇 |
2010年 | 1141篇 |
2009年 | 1004篇 |
2008年 | 2009篇 |
2007年 | 2020篇 |
2006年 | 1996篇 |
2005年 | 1862篇 |
2004年 | 1588篇 |
2003年 | 1383篇 |
2002年 | 1282篇 |
2001年 | 402篇 |
2000年 | 388篇 |
1999年 | 358篇 |
1998年 | 335篇 |
1997年 | 357篇 |
1996年 | 486篇 |
1995年 | 343篇 |
1994年 | 298篇 |
1993年 | 271篇 |
1992年 | 267篇 |
1991年 | 237篇 |
1990年 | 202篇 |
1989年 | 203篇 |
1988年 | 232篇 |
1987年 | 198篇 |
1986年 | 180篇 |
1985年 | 347篇 |
1984年 | 339篇 |
1983年 | 242篇 |
1982年 | 313篇 |
1981年 | 323篇 |
1980年 | 298篇 |
1979年 | 281篇 |
1978年 | 257篇 |
1977年 | 227篇 |
1976年 | 206篇 |
1975年 | 208篇 |
1974年 | 210篇 |
1973年 | 209篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
121.
122.
123.
David P. Williamson 《Mathematical Programming》2002,91(3):447-478
In this survey, we give an overview of a technique used to design and analyze algorithms that provide approximate solutions
to NP-hard problems in combinatorial optimization. Because of parallels with the primal-dual method commonly used in combinatorial
optimization, we call it the primal-dual method for approximation algorithms. We show how this technique can be used to derive
approximation algorithms for a number of different problems, including network design problems, feedback vertex set problems,
and facility location problems.
Received: June 19, 2000 / Accepted: February 7, 2001?Published online October 2, 2001 相似文献
124.
David Swanson William P. Ziemer 《Calculus of Variations and Partial Differential Equations》2002,14(1):69-84
Let be a connected open set, . We give a sufficient condition for a mapping , , to have the property that sgn is almost everywhere of one sign. Following the work of Müller, Spector, and Tang [MST], we give an application of our results
to the theory of non-linear elasticity.
Received: 13 October 2000 / Accepted: 23 January 2001 / Published online: 4 May 2001 相似文献
125.
126.
127.
Summary. We examine the convergence characteristics of iterative methods based on a new preconditioning operator for solving the linear
systems arising from discretization and linearization of the steady-state Navier-Stokes equations. With a combination of analytic
and empirical results, we study the effects of fundamental parameters on convergence. We demonstrate that the preconditioned
problem has an eigenvalue distribution consisting of a tightly clustered set together with a small number of outliers. The
structure of these distributions is independent of the discretization mesh size, but the cardinality of the set of outliers
increases slowly as the viscosity becomes smaller. These characteristics are directly correlated with the convergence properties
of iterative solvers.
Received August 5, 2000 / Published online June 20, 2001 相似文献
128.
Lisa Higham David Kirkpatrick Karl Abrahamson Andrew Adler 《Journal of Algorithms in Cognition, Informatics and Logic》1997,23(2):291-328
Probabilistic algorithms are developed for a basic problem in distributed computation, assuming anonymous, asynchronous, unidirectional rings of processors. The problem, known as Solitude Detection, requires that a nonempty subset of the processors, calledcontenders, determine whether or not there is exactly one contender. Monte Carlo algorithms are developed that err with probability bounded by a specified parameter and exhibit either message or processor termination. The algorithms transmit an optimal expected number of bits, to within a constant factor. Their bit complexities display a surprisingly rich dependence on the kind of termination exhibited and on the processors' knowledge of the size of the ring. Two probabilistic tools are isolated and then combined in various ways to achieve all our algorithms. 相似文献
129.
The G/M/1 queue is one of the classical models of queueing theory. The goal of this paper is two-fold: (a) To introduce new derivations
of some well-known results, and (b) to present some new results for the G/M/1 queue and its variants. In particular, we pay attention to the G/M/1 queue with a set-up time at the start of each busy period, and the G/M/1 queue with exceptional first service.
Dedicated to Arie Hordijk on his 65th birthday, in friendship and admiration. 相似文献
130.