全文获取类型
收费全文 | 1420篇 |
免费 | 207篇 |
国内免费 | 62篇 |
专业分类
化学 | 312篇 |
晶体学 | 2篇 |
力学 | 185篇 |
综合类 | 57篇 |
数学 | 400篇 |
物理学 | 733篇 |
出版年
2024年 | 2篇 |
2023年 | 26篇 |
2022年 | 78篇 |
2021年 | 58篇 |
2020年 | 55篇 |
2019年 | 45篇 |
2018年 | 34篇 |
2017年 | 58篇 |
2016年 | 68篇 |
2015年 | 68篇 |
2014年 | 102篇 |
2013年 | 116篇 |
2012年 | 69篇 |
2011年 | 71篇 |
2010年 | 79篇 |
2009年 | 78篇 |
2008年 | 77篇 |
2007年 | 69篇 |
2006年 | 56篇 |
2005年 | 59篇 |
2004年 | 39篇 |
2003年 | 48篇 |
2002年 | 48篇 |
2001年 | 41篇 |
2000年 | 20篇 |
1999年 | 26篇 |
1998年 | 29篇 |
1997年 | 21篇 |
1996年 | 17篇 |
1995年 | 19篇 |
1994年 | 21篇 |
1993年 | 16篇 |
1992年 | 14篇 |
1991年 | 15篇 |
1990年 | 2篇 |
1989年 | 5篇 |
1988年 | 3篇 |
1987年 | 4篇 |
1986年 | 3篇 |
1984年 | 3篇 |
1983年 | 2篇 |
1982年 | 2篇 |
1980年 | 2篇 |
1979年 | 4篇 |
1978年 | 3篇 |
1977年 | 3篇 |
1976年 | 6篇 |
1975年 | 2篇 |
1974年 | 3篇 |
排序方式: 共有1689条查询结果,搜索用时 15 毫秒
1.
Solving large scale linear systems efficiently plays an important role in a petroleum reservoir simulator, and the key part is how to choose an effective parallel preconditioner. Properly choosing a good preconditioner has been beyond the pure algebraic field. An integrated preconditioner should include such components as physical background, characteristics of PDE mathematical model, nonlinear solving method, linear 相似文献
2.
3.
4.
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. 相似文献
5.
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. 相似文献
6.
Madhu V. Nayakkankuppam 《Mathematical Programming》2007,109(2-3):477-504
We describe an approach to the parallel and distributed solution of large-scale, block structured semidefinite programs using
the spectral bundle method. Various elements of this approach (such as data distribution, an implicitly restarted Lanczos
method tailored to handle block diagonal structure, a mixed polyhedral-semidefinite subdifferential model, and other aspects
related to parallelism) are combined in an implementation called LAMBDA, which delivers faster solution times than previously
possible, and acceptable parallel scalability on sufficiently large problems.
This work was supported in part by NSF grants DMS-0215373 and DMS-0238008. 相似文献
8.
Ronald H. Nickel Igor Mikolic-Torreira Jon W. Tolle 《Computational Optimization and Applications》2006,35(1):109-126
Deployed US Navy aircraft carriers must stock a large number of spare parts to support the various types of aircraft embarked
on the ship. The sparing policy determines the spares that will be stocked on the ship to keep the embarked aircraft ready
to fly. Given a fleet of ten or more aircraft carriers and a cost of approximately 50 million dollars per carrier plus the
cost of spares maintained in warehouses in the United States, the sparing problem constitutes a significant portion of the
Navy’s resources. The objective of this work is to find a minimum-cost sparing policy that meets the readiness requirements
of the embarked aircraft. This is a very large, nonlinear, integer optimization problem. The cost function is piecewise linear
and convex while the constraint mapping is highly nonlinear. The distinguishing characteristics of this problem from an optimization
viewpoint are that a large number of decision variables are required to be integer and that the nonlinear constraint functions
are essentially “black box” functions; that is, they are very difficult (and expensive) to evaluate and their derivatives
are not available. Moreover, they are not convex. Integer programming problems with a large number of variables are difficult
to solve in general and most successful approaches to solving nonlinear integer problems have involved linear approximation
and relaxation techniques that, because of the complexity of the constraint functions, are inappropriate for attacking this
problem. We instead employ a pattern search method to each iteration of an interior point-type algorithm to solve the relaxed
version of the problem. From the solution found by the pattern search on each interior point iteration, we begin another pattern
search on the integer lattice to find a good integer solution. The best integer solution found across all interations is returned
as the optimal solution. The pattern searches are distributed across a local area network of non-dedicated, heterogeneous
computers in an office environment, thus, drastically reducing the time required to find the solution. 相似文献
9.
10.