全文获取类型
收费全文 | 1471篇 |
免费 | 69篇 |
国内免费 | 80篇 |
专业分类
化学 | 448篇 |
晶体学 | 29篇 |
力学 | 52篇 |
综合类 | 9篇 |
数学 | 957篇 |
物理学 | 125篇 |
出版年
2024年 | 2篇 |
2023年 | 11篇 |
2022年 | 33篇 |
2021年 | 22篇 |
2020年 | 39篇 |
2019年 | 29篇 |
2018年 | 26篇 |
2017年 | 34篇 |
2016年 | 35篇 |
2015年 | 26篇 |
2014年 | 56篇 |
2013年 | 94篇 |
2012年 | 80篇 |
2011年 | 61篇 |
2010年 | 69篇 |
2009年 | 105篇 |
2008年 | 81篇 |
2007年 | 116篇 |
2006年 | 93篇 |
2005年 | 55篇 |
2004年 | 53篇 |
2003年 | 47篇 |
2002年 | 50篇 |
2001年 | 51篇 |
2000年 | 57篇 |
1999年 | 36篇 |
1998年 | 39篇 |
1997年 | 39篇 |
1996年 | 25篇 |
1995年 | 26篇 |
1994年 | 21篇 |
1993年 | 9篇 |
1992年 | 13篇 |
1991年 | 7篇 |
1990年 | 4篇 |
1989年 | 11篇 |
1988年 | 7篇 |
1987年 | 6篇 |
1986年 | 6篇 |
1985年 | 7篇 |
1984年 | 8篇 |
1983年 | 7篇 |
1982年 | 7篇 |
1981年 | 7篇 |
1980年 | 1篇 |
1979年 | 4篇 |
1978年 | 3篇 |
1976年 | 1篇 |
1969年 | 1篇 |
排序方式: 共有1620条查询结果,搜索用时 15 毫秒
1.
超尺寸物品装箱问题及其算法 总被引:3,自引:0,他引:3
本文探讨一类新装箱问题-超尺寸物品装箱问题。针对实际解决该问题的两涉法,我们提出了一个评价效率更高的目标函数,证明了在此目标函数下两步法的渐近最坏比不小于2,并给出了渐近量坏比与拆分次数的关系。最后本文提出了一种不同于两步法的新在线算法MA,证明了在新目标函数下其渐近最坏比不超过7/4。 相似文献
2.
首先在Contingent切锥意义下界定了Banach空间中非空集合的伪切锥和伪凸性的概念,并讨论了相应的性质,然后针对可微优化问题,在广义凸性假设下,建立了最优性条件。 相似文献
3.
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. 相似文献
4.
HUYUDA MENGZHIQING 《高校应用数学学报(英文版)》1998,13(4):473-477
In this paper, the existence theorem of the cone-weak subdiflerential of set-valued mapping in locally convex topological vector space is proved. 相似文献
5.
本文以fp 同伦方法为工具,借助于一些适当的变换,研究有序的(B)空间中的集值映象方程的多正解问题;在文中的有关工作中,还使用了集值映象的拟导数的某些性质. 相似文献
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中离散填充维数的一个等价定义. 相似文献