全文获取类型
收费全文 | 3561篇 |
免费 | 449篇 |
国内免费 | 159篇 |
专业分类
化学 | 542篇 |
晶体学 | 10篇 |
力学 | 758篇 |
综合类 | 113篇 |
数学 | 1527篇 |
物理学 | 1219篇 |
出版年
2024年 | 10篇 |
2023年 | 35篇 |
2022年 | 83篇 |
2021年 | 82篇 |
2020年 | 95篇 |
2019年 | 83篇 |
2018年 | 80篇 |
2017年 | 121篇 |
2016年 | 149篇 |
2015年 | 110篇 |
2014年 | 176篇 |
2013年 | 250篇 |
2012年 | 183篇 |
2011年 | 195篇 |
2010年 | 149篇 |
2009年 | 169篇 |
2008年 | 189篇 |
2007年 | 222篇 |
2006年 | 168篇 |
2005年 | 163篇 |
2004年 | 163篇 |
2003年 | 148篇 |
2002年 | 141篇 |
2001年 | 140篇 |
2000年 | 97篇 |
1999年 | 96篇 |
1998年 | 115篇 |
1997年 | 87篇 |
1996年 | 78篇 |
1995年 | 78篇 |
1994年 | 49篇 |
1993年 | 56篇 |
1992年 | 55篇 |
1991年 | 26篇 |
1990年 | 12篇 |
1989年 | 16篇 |
1988年 | 20篇 |
1987年 | 10篇 |
1986年 | 10篇 |
1985年 | 8篇 |
1984年 | 12篇 |
1983年 | 3篇 |
1982年 | 10篇 |
1980年 | 4篇 |
1979年 | 3篇 |
1976年 | 3篇 |
1975年 | 2篇 |
1973年 | 5篇 |
1970年 | 2篇 |
1969年 | 2篇 |
排序方式: 共有4169条查询结果,搜索用时 9 毫秒
11.
Approximation algorithms for scheduling unrelated parallel machines 总被引:10,自引:0,他引:10
We consider the following scheduling problem. There arem parallel machines andn independent jobs. Each job is to be assigned to one of the machines. The processing of jobj on machinei requires timep
ij
. The objective is to find a schedule that minimizes the makespan.Our main result is a polynomial algorithm which constructs a schedule that is guaranteed to be no longer than twice the optimum. We also present a polynomial approximation scheme for the case that the number of machines is fixed. Both approximation results are corollaries of a theorem about the relationship of a class of integer programming problems and their linear programming relaxations. In particular, we give a polynomial method to round the fractional extreme points of the linear program to integral points that nearly satisfy the constraints.In contrast to our main result, we prove that no polynomial algorithm can achieve a worst-case ratio less than 3/2 unlessP = NP. We finally obtain a complexity classification for all special cases with a fixed number of processing times.A preliminary version of this paper appeared in theProceedings of the 28th Annual IEEE Symposium on the Foundations of Computer Science (Computer Society Press of the IEEE, Washington, D.C., 1987) pp. 217–224. 相似文献
12.
Richard H. Byrd Cornelius L. Dert Alexander H. G. Rinnooy Kan Robert B. Schnabel 《Mathematical Programming》1990,46(1-3):1-29
The global optimization problem, finding the lowest minimizer of a nonlinear function of several variables that has multiple local minimizers, appears well suited to concurrent computation. This paper presents a new parallel algorithm for the global optimization problem. The algorithm is a stochastic method related to the multi-level single-linkage methods of Rinnooy Kan and Timmer for sequential computers. Concurrency is achieved by partitioning the work of each of the three main parts of the algorithm, sampling, local minimization start point selection, and multiple local minimizations, among the processors. This parallelism is of a coarse grain type and is especially well suited to a local memory multiprocessing environment. The paper presents test results of a distributed implementation of this algorithm on a local area network of computer workstations. It also summarizes the theoretical properties of the algorithm.Research supported by AFOSR grant AFOSR-85-0251, ARO contract DAAG 29-84-K-0140, NSF grant DCR-8403483, and NSF cooperative agreement DCR-8420944. 相似文献
13.
The concept of weighted discrepancy of sequences was introduced by Sloan and Woniakowski when they proved a general form of a Koksma–Hlawka inequality for the numerical integration of functions. This version takes imbalances in the importance of the projections of the integrand into account.In this paper we give estimates for the weighted discrepancy of several important point sets. Further we carry out various (high-dimensional) numerical integration experiments and we compare the results with the error bounds provided by the generalized Koksma–Hlawka inequality and by the estimates for the weighted discrepancy. Finally we discuss various consequences. 相似文献
14.
Parallel Newton two-stage iterative methods to solve nonlinear systems are studied. These algorithms are based on both the multisplitting technique and the two-stage iterative methods. Convergence properties of these methods are studied when the Jacobian matrix is either monotone or an H-matrix. Furthermore, in order to illustrate the performance of the algorithms studied, computational results about these methods on a distributed memory multiprocessor are discussed.This revised version was published online in October 2005 with corrections to the Cover Date. 相似文献
15.
Mathematical Notes - 相似文献
16.
A parallel method for time discretization of parabolic equations based on Laplace transformation and quadrature 总被引:5,自引:0,他引:5
We consider the discretization in time of an inhomogeneous parabolicequation in a Banach space setting, using a representation ofthe solution as an integral along a smooth curve in the complexleft half-plane which, after transformation to a finite interval,is then evaluated to high accuracy by a quadrature rule. Thisreduces the problem to a finite set of elliptic equations withcomplex coefficients, which may be solved in parallel. The paperis a further development of earlier work by the authors, wherewe treated the homogeneous equation in a Hilbert space framework.Special attention is given here to the treatment of the forcingterm. The method is combined with finite-element discretizationin spatial variables. 相似文献
17.
Sparse approximate inverse (SAI) techniques have recently emerged as a new class of parallel preconditioning techniques for
solving large sparse linear systems on high performance computers. The choice of the sparsity pattern of the SAI matrix is
probably the most important step in constructing an SAI preconditioner. Both dynamic and static sparsity pattern selection
approaches have been proposed by researchers. Through a few numerical experiments, we conduct a comparable study on the properties
and performance of the SAI preconditioners using the different sparsity patterns for solving some sparse linear systems.
This revised version was published online in July 2006 with corrections to the Cover Date. 相似文献
18.
In this paper, we introduce a new concept of semi-preemptive scheduling and we show how it can be used to derive a maximum-flow-based lower bound for the P|rj|Lmax which dominates the well-known preemptive lower bound. We show that, in some cases, the proposed bound strictly dominates the preemptive one while having the same complexity. 相似文献
19.
Suppose r ≥ 2 is a real number. A proper r‐flow of a directed multi‐graph is a mapping such that (i) for every edge , ; (ii) for every vertex , . The circular flow number of a graph G is the least r for which an orientation of G admits a proper r‐flow. The well‐known 5‐flow conjecture is equivalent to the statement that every bridgeless graph has circular flow number at most 5. In this paper, we prove that for any rational number r between 2 and 5, there exists a graph G with circular flow number r. © 2003 Wiley Periodicals, Inc. J Graph Theory 43: 304–318, 2003 相似文献
20.
Hijazi Oussama Montiel Sebastin Roldn Antonio 《Annals of Global Analysis and Geometry》2003,23(3):247-264
We give a sharp extrinsic lower bound for the first eigenvaluesof the intrinsic Dirac operator of certain hypersurfaces boundinga compact domain in a spin manifold of negative scalar curvature.Limiting-cases are characterized by the existence, on the domain,of imaginary Killing spinors. Some geometrical applications, as anAlexandrov type theorem, are given. 相似文献