全文获取类型
收费全文 | 2611篇 |
免费 | 321篇 |
国内免费 | 111篇 |
专业分类
化学 | 472篇 |
晶体学 | 6篇 |
力学 | 408篇 |
综合类 | 92篇 |
数学 | 973篇 |
物理学 | 1092篇 |
出版年
2024年 | 3篇 |
2023年 | 25篇 |
2022年 | 31篇 |
2021年 | 38篇 |
2020年 | 54篇 |
2019年 | 45篇 |
2018年 | 50篇 |
2017年 | 73篇 |
2016年 | 97篇 |
2015年 | 82篇 |
2014年 | 104篇 |
2013年 | 157篇 |
2012年 | 133篇 |
2011年 | 124篇 |
2010年 | 113篇 |
2009年 | 114篇 |
2008年 | 139篇 |
2007年 | 156篇 |
2006年 | 124篇 |
2005年 | 132篇 |
2004年 | 125篇 |
2003年 | 127篇 |
2002年 | 117篇 |
2001年 | 100篇 |
2000年 | 88篇 |
1999年 | 92篇 |
1998年 | 88篇 |
1997年 | 82篇 |
1996年 | 63篇 |
1995年 | 65篇 |
1994年 | 46篇 |
1993年 | 51篇 |
1992年 | 47篇 |
1991年 | 26篇 |
1990年 | 13篇 |
1989年 | 20篇 |
1988年 | 24篇 |
1987年 | 14篇 |
1986年 | 8篇 |
1985年 | 8篇 |
1984年 | 10篇 |
1983年 | 7篇 |
1982年 | 7篇 |
1981年 | 6篇 |
1980年 | 8篇 |
1979年 | 2篇 |
1978年 | 1篇 |
1977年 | 2篇 |
1976年 | 1篇 |
1967年 | 1篇 |
排序方式: 共有3043条查询结果,搜索用时 134 毫秒
21.
Mixed integer programming (MIP) models are extensively usedto aid strategic and tactical decision making in many businesssectors. Solving MIP models is a computationally intensive processand there is a need to develop solution approaches that enablelarger models to be solved within acceptable timeframes. Inthis paper, we describe the implementation of a two-stage parallelbranch and bound (PB & B) algorithm for MIP. In stage 1of the algorithm, a multiple heuristic search is implementedin which a number of alternative search trees are investigatedusing a forest search in the hope of finding a good solutionquickly. In stage 2, the search is reorganized so that the branchesof a chosen tree are investigated in parallel. A new heuristicis introduced, based on a best projection criterion, which evaluatesalternative B & B trees in order to choose one for investigationin stage 2 of the algorithm. The heuristic also serves as away of implementing a quality load balancing scheme for stage2 of the algorithm. The results of experimental investigationsare reported for a range of models taken from the MIPLIB libraryof benchmark problems. 相似文献
22.
We consider the generalization of the classical P||Cmax problem (assign n jobs to m identical parallel processors by minimizing the makespan) arising when the number of jobs that can be assigned to each processor cannot exceed a given integer k. The problem is strongly NP-hard for any fixed k > 2. We briefly survey lower and upper bounds from the literature. We introduce greedy heuristics, local search and a scatter search approach. The effectiveness of these approaches is evaluated through extensive computational comparison with a depth-first branch-and-bound algorithm that includes new lower bounds and dominance criteria. 相似文献
23.
关于非平行板电容器电容计算的讨论 总被引:4,自引:3,他引:1
用串联方法计算非平行板电容器的电容,简便地得到与其他方法相同的结果。 相似文献
24.
Capacity Constrained Transit Assignment with Common Lines 总被引:1,自引:0,他引:1
Fumitaka Kurauchi Michael G. H. Bell Jan-Dirk Schmöcker 《Journal of Mathematical Modelling and Algorithms》2003,2(4):309-327
This paper proposes the use of absorbing Markov chains to solve the capacity constrained transit network loading problem taking
common lines into account. The approach handles congested transit networks, where some passengers will not be able to board
because of the absence of sufficient space. The model also handles the common lines problem, where choice of route depends
on frequency of arrivals. The mathematical formulation of the problem is presented together with a numerical example.
This revised version was published online in July 2006 with corrections to the Cover Date. 相似文献
25.
This paper proposes a method for estimation of a class of partially linear single-index models with randomly censored samples. The method provides a flexible way for modelling the association between a response and a set of predictor variables when the response variable is randomly censored. It presents a technique for “dimension reduction” in semiparametric censored regression models and generalizes the existing accelerated failure-time models for survival analysis. The estimation procedure involves three stages: first, transform the censored data into synthetic data or pseudo-responses unbiasedly; second, obtain quasi-likelihood estimates of the regression coefficients in both linear and single-index components by an iteratively algorithm; finally, estimate the unknown nonparametric regression function using techniques for univariate censored nonparametric regression. The estimators for the regression coefficients are shown to be jointly root-n consistent and asymptotically normal. In addition, the estimator for the unknown regression function is a local linear kernel regression estimator and can be estimated with the same efficiency as all the parameters are known. Monte Carlo simulations are conducted to illustrate the proposed methodology. 相似文献
26.
In this paper, we consider a queueing system in which there are two exponential servers, each having his own queue, and arriving
customers will join the shorter queue. Based on the results given in Flatto and McKean, we rewrite the formula for the probability
that there are exactlyk customers in each queue, wherek = 0, 1,…. This enables us to present an algorithm for computing these probabilities and then to find the joint distribution
of the queue lengths in the system. A program and numerical examples are given. 相似文献
27.
A parallel inexact Newton method with a line search is proposed for two-stage quadratic stochastic programs with recourse. A lattice rule is used for the numerical evaluation of multi-dimensional integrals, and a parallel iterative method is used to solve the quadratic programming subproblems. Although the objective only has a locally Lipschitz gradient, global convergence and local superlinear convergence of the method are established. Furthermore, the method provides an error estimate which does not require much extra computation. The performance of the method is illustrated on a CM5 parallel computer.This work was supported by the Australian Research Council and the numerical experiments were done on the Sydney Regional Centre for Parallel Computing CM5. 相似文献
28.
Hossam A. Zaki 《Computational Optimization and Applications》1995,4(1):23-45
State-of-the-art computational results have shown that the shortest augmenting path (SAP) methods are more efficient than other primal-dual and primal-simplex based methods for solving the linear assignment problem on uniprocessor computers. There is, however, some controversy concerning their merits when compared with Bertsekas' auction algorithm on multiprocessor computers. In this study we investigate the performance of these competing methods on the Alliant FX/8. For each method, theoretical motivation, sources of parallelism and computational results are presented. 相似文献
29.
The method of demodulation with two parallel matched fiber Bragg gratings( FBGs)system is introduced to enlarge the range of strain that can be detected by the FBG sensor system. 相似文献
30.