全文获取类型
收费全文 | 2021篇 |
免费 | 93篇 |
国内免费 | 125篇 |
专业分类
化学 | 794篇 |
晶体学 | 30篇 |
力学 | 111篇 |
综合类 | 11篇 |
数学 | 984篇 |
物理学 | 309篇 |
出版年
2024年 | 5篇 |
2023年 | 32篇 |
2022年 | 44篇 |
2021年 | 36篇 |
2020年 | 55篇 |
2019年 | 64篇 |
2018年 | 47篇 |
2017年 | 68篇 |
2016年 | 69篇 |
2015年 | 55篇 |
2014年 | 100篇 |
2013年 | 142篇 |
2012年 | 84篇 |
2011年 | 101篇 |
2010年 | 95篇 |
2009年 | 172篇 |
2008年 | 133篇 |
2007年 | 133篇 |
2006年 | 92篇 |
2005年 | 75篇 |
2004年 | 69篇 |
2003年 | 60篇 |
2002年 | 56篇 |
2001年 | 59篇 |
2000年 | 50篇 |
1999年 | 36篇 |
1998年 | 41篇 |
1997年 | 46篇 |
1996年 | 24篇 |
1995年 | 29篇 |
1994年 | 22篇 |
1993年 | 11篇 |
1992年 | 16篇 |
1991年 | 11篇 |
1990年 | 11篇 |
1989年 | 11篇 |
1988年 | 13篇 |
1987年 | 7篇 |
1986年 | 10篇 |
1985年 | 7篇 |
1984年 | 12篇 |
1983年 | 10篇 |
1982年 | 7篇 |
1981年 | 8篇 |
1980年 | 1篇 |
1979年 | 4篇 |
1978年 | 1篇 |
1977年 | 3篇 |
1976年 | 1篇 |
1969年 | 1篇 |
排序方式: 共有2239条查询结果,搜索用时 15 毫秒
1.
In this paper, we study the local linear convergence properties of a versatile class of Primal–Dual splitting methods for minimizing composite non-smooth convex optimization problems. Under the assumption that the non-smooth components of the problem are partly smooth relative to smooth manifolds, we present a unified local convergence analysis framework for these methods. More precisely, in our framework, we first show that (i) the sequences generated by Primal–Dual splitting methods identify a pair of primal and dual smooth manifolds in a finite number of iterations, and then (ii) enter a local linear convergence regime, which is characterized based on the structure of the underlying active smooth manifolds. We also show how our results for Primal–Dual splitting can be specialized to cover existing ones on Forward–Backward splitting and Douglas–Rachford splitting/ADMM (alternating direction methods of multipliers). Moreover, based on these obtained local convergence analysis result, several practical acceleration techniques are discussed. To exemplify the usefulness of the obtained result, we consider several concrete numerical experiments arising from fields including signal/image processing, inverse problems and machine learning. The demonstration not only verifies the local linear convergence behaviour of Primal–Dual splitting methods, but also the insights on how to accelerate them in practice. 相似文献
2.
超尺寸物品装箱问题及其算法 总被引:3,自引:0,他引:3
本文探讨一类新装箱问题-超尺寸物品装箱问题。针对实际解决该问题的两涉法,我们提出了一个评价效率更高的目标函数,证明了在此目标函数下两步法的渐近最坏比不小于2,并给出了渐近量坏比与拆分次数的关系。最后本文提出了一种不同于两步法的新在线算法MA,证明了在新目标函数下其渐近最坏比不超过7/4。 相似文献
3.
Robust linear optimization under general norms 总被引:1,自引:0,他引:1
We explicitly characterize the robust counterpart of a linear programming problem with uncertainty set described by an arbitrary norm. Our approach encompasses several approaches from the literature and provides guarantees for constraint violation under probabilistic models that allow arbitrary dependencies in the distribution of the uncertain coefficients. 相似文献
4.
Alvim Adriana C.F. Ribeiro Celso C. Glover Fred Aloise Dario J. 《Journal of Heuristics》2004,10(2):205-229
We propose in this work a hybrid improvement procedure for the bin packing problem. This heuristic has several features: the use of lower bounding strategies; the generation of initial solutions by reference to the dual min-max problem; the use of load redistribution based on dominance, differencing, and unbalancing; and the inclusion of an improvement process utilizing tabu search. Encouraging results have been obtained for a very wide range of benchmark instances, illustrating the robustness of the algorithm. The hybrid improvement procedure compares favourably with all other heuristics in the literature. It improved the best known solutions for many of the benchmark instances and found the largest number of optimal solutions with respect to the other available approximate algorithms. 相似文献
5.
Xu Tianzhou 《东北数学》1997,(1)
ModulesoverOperatorAlgebrasandItsModuleMapsXuTianzhou(许天周)(DepartmentofMathematics,NanjingUniersity,Nanjing,210093)AbstractLe... 相似文献
6.
YIN JIANXING 《高校应用数学学报(英文版)》1994,(4)
PACKINGPAIRSBYQUINTUPLES:THECASEOFZEROCONGRUENCEMOD4YINJIANXINGAbstract:LetD(v)denotethemaximumnumberofquintuplesofav-setofpo... 相似文献
7.
Characterizations of the containment of a convex set either in an arbitrary convex set or in the complement of a finite union
of convex sets (i.e., the set, described by reverse-convex inequalities) are given. These characterizations provide ways of
verifying the containments either by comparing their corresponding dual cones or by checking the consistency of suitable associated
systems. The convex sets considered in this paper are the solution sets of an arbitrary number of convex inequalities, which
can be either weak or strict inequalities. Particular cases of dual characterizations of set containments have played key
roles in solving large scale knowledge-based data classification problems where they are used to describe the containments
as inequality constraints in optimization problems. The idea of evenly convex set (intersection of open half spaces), which
was introduced by W. Fenchel in 1952, is used to derive the dual conditions, characterizing the set containments. 相似文献
8.
Dmitry I. Belov Ronald D. Armstrong 《Computational Optimization and Applications》2006,33(2-3):319-332
This paper introduces a novel approach for extracting the maximum number of non-overlapping test forms from a large collection
of overlapping test sections assembled from a given item bank. The approach involves solving maximum set packing problems
(MSPs). A branch-and-bound MSP algorithm is developed along with techniques adapted from constraint programming to estimate
lower and upper bounds on the optimal MSP solution. The algorithm is general and can be applied in other applications including
combinatorial auctions. The results of computer simulations and experiments with an operational item bank are presented.
An erratum to this article is available at . 相似文献
9.
Packing two disks into a polygonal environment 总被引:1,自引:0,他引:1
We consider the following problem. Given a polygon P, possibly with holes, and having n vertices, compute a pair of equal radius disks that do not intersect each other, are contained in P, and whose radius is maximized. Our main result is a simple randomized algorithm whose expected running time, on any input, is O(nlogn). This is optimal in the algebraic decision tree model of computation. 相似文献
10.
探讨了Z^d中离散填充指标的一些性质,给出了Z^d中离散填充维数的一个等价定义. 相似文献