全文获取类型
收费全文 | 1798篇 |
免费 | 125篇 |
国内免费 | 58篇 |
专业分类
化学 | 257篇 |
晶体学 | 2篇 |
力学 | 51篇 |
综合类 | 36篇 |
数学 | 1407篇 |
物理学 | 228篇 |
出版年
2023年 | 8篇 |
2022年 | 31篇 |
2021年 | 44篇 |
2020年 | 29篇 |
2019年 | 23篇 |
2018年 | 34篇 |
2017年 | 40篇 |
2016年 | 50篇 |
2015年 | 38篇 |
2014年 | 76篇 |
2013年 | 107篇 |
2012年 | 93篇 |
2011年 | 98篇 |
2010年 | 92篇 |
2009年 | 117篇 |
2008年 | 150篇 |
2007年 | 139篇 |
2006年 | 87篇 |
2005年 | 91篇 |
2004年 | 88篇 |
2003年 | 58篇 |
2002年 | 56篇 |
2001年 | 58篇 |
2000年 | 63篇 |
1999年 | 54篇 |
1998年 | 39篇 |
1997年 | 36篇 |
1996年 | 35篇 |
1995年 | 25篇 |
1994年 | 16篇 |
1993年 | 18篇 |
1992年 | 13篇 |
1991年 | 7篇 |
1990年 | 5篇 |
1989年 | 5篇 |
1988年 | 9篇 |
1987年 | 4篇 |
1986年 | 5篇 |
1985年 | 7篇 |
1984年 | 6篇 |
1983年 | 3篇 |
1982年 | 2篇 |
1981年 | 4篇 |
1979年 | 3篇 |
1978年 | 1篇 |
1977年 | 7篇 |
1976年 | 3篇 |
1975年 | 1篇 |
1973年 | 1篇 |
1959年 | 1篇 |
排序方式: 共有1981条查询结果,搜索用时 515 毫秒
121.
Simple ingredients leading to very efficient heuristics for the maximum clique problem 总被引:2,自引:0,他引:2
Starting from an algorithm recently proposed by Pullan and Hoos, we formulate and analyze iterated local search algorithms
for the maximum clique problem. The basic components of such algorithms are a fast neighbourhood search (not based on node
evaluation but on completely random selection) and simple, yet very effective, diversification techniques and restart rules.
A detailed computational study is performed in order to identify strengths and weaknesses of the proposed algorithms and the
role of the different components on several classes of instances. The tested algorithms are very fast and reliable: most of
the DIMACS benchmark instances are solved within very short CPU times. For one of the hardest tests, a new putative optimum
was discovered by one of our algorithms. Very good performances were also shown on recently proposed and more difficult instances.
It is important to remark that the heuristics tested in this paper are basically parameter free (the appropriate value for
the unique parameter is easily identified and was, in fact, the same value for all problem instances used in this paper). 相似文献
122.
最佳粮库地址的选择 总被引:3,自引:2,他引:1
管理部门通常要选择适当的地方建造粮库 ,所需服务范围已知 ,各部门运输量给定 .需为他们选择合适的地方 ,使总运费最少 .某乡的九个村 (A,B,C,… ,H,I)如图 1 ,各村距离给出 ,并标明它们各自上缴公粮数 .管理部门希望在村内或道路上建立一个粮库 ,最大限度地减少运输费用 .问题的解法有几种方案 ,对于本题来说 ,穷举搜索法是可行的 .另外 ,我们提出一种分析求解法 ,可找到优化解 .它利用图论的基础知识先求出图 1的各顶点间的最小路径 ,再进一步求出图的绝对中心 (即粮库的地址 ) ,其中的有关计算利用了 C++语言程序 .在此基础上 ,还可对问题的参数作更精细的分析 .概括地说 ,穷举搜索法对于简单的区域是行之有效的 .但对于更加一般化的问题 ,利用计算机可快捷准确地得到答案 .通过建立模型 ,我们得到下面两个结论 :(1 )我们找到最优解是 E点 ,其总运费为 1 2 775元 .(2 )模型具有广泛性 ,对于更一般的区域 ,可利用计算机总可以求出最优解 . 相似文献
123.
V. Renugopalakrishnan G. Madrid G. Cuevas A. T. Hagler 《Journal of Chemical Sciences》2000,112(1):35-42
Density functional theory was applied to the calculation of molecular structures of N-methyl formamide (NMF), N,N-dimethyl
formamide (DMF), and N,N-dimethyl acetamide (DMA). DFT calculations on NMF, DMF, and DMA were performed using a combination
of the local functional of Vosko, Wilk, and Nusair (VWN) with the nonlocal exchange functional of Becke and the nonlocal correlational
functional of Lee, Yang, and Parr (BLYP). The adiabatic connection method (ACM) of Becke has also been used, for the first
time, for the calculation of molecular structures of NMF, DMF, and DMA. The calculated molecular structures are in excellent
agreement with the experimental geometries of NMF and DMA derived from gas-phase electron-diffraction studies. Sparse experimental
data on the gas-phase geometry of DMF reported in the literature compares well with the DFT results on DMF. DFT emerges as
a powerful method to calculate molecular structures. 相似文献
124.
Project Scheduling with Multiple Modes: A Genetic Algorithm 总被引:10,自引:0,他引:10
Sönke Hartmann 《Annals of Operations Research》2001,102(1-4):111-135
In this paper we consider the resource-constrained project scheduling problem with multiple execution modes for each activity and makespan minimization as objective. We present a new genetic algorithm approach to solve this problem. The genetic encoding is based on a precedence feasible list of activities and a mode assignment. After defining the related crossover, mutation, and selection operators, we describe a local search extension which is employed to improve the schedules found by the basic genetic algorithm. Finally, we present the results of our thorough computational study. We determine the best among several different variants of our genetic algorithm and compare it to four other heuristics that have recently been proposed in the literature. The results that have been obtained using a standard set of instances show that the new genetic algorithm outperforms the other heuristic procedures with regard to a lower average deviation from the optimal makespan. 相似文献
125.
E. O. Mazurkevich E. G. Petrova A. S. Strekalovsky 《Computational Mathematics and Mathematical Physics》2009,49(8):1318-1331
The well-known linear complementarity problem with definite matrices is considered. It is proposed to solve it using a global optimization algorithm in which one of the basic stages is a special local search. The proposed global search algorithm is tested using a variety of randomly generated problems; a detailed analysis of the computational experiment is given. 相似文献
126.
John Ellis 《Discrete Applied Mathematics》2008,156(5):545-555
We present proofs of lower bounds on the node search number of some grid-like graphs including two-dimensional grids, cylinders, tori and a variation we call “orb-webs”. Node search number is equivalent to pathwidth and vertex separation, which are all important graph parameters. Since matching upper bounds are not difficult to obtain, this implies that the pathwidth of these graphs is easily computed, because the bounds are simple functions of the graph dimensions. We also show matching upper and lower bounds on the node search number of equidimensional tori which are one less than the obvious upper bound. 相似文献
127.
Effects of initial states on the quantum correlations in the generalized Grover search algorithm 下载免费PDF全文
Zhen-Yu Chen 《中国物理 B》2021,30(8):80303-080303
We investigate the correlations between two qubits in the Grover search algorithm with arbitrary initial states by numerical simulation. Using a set of suitable bases, we construct the reduced density matrix and give the numerical expression of correlations relating to the iterations. For different initial states, we obtain the concurrence and quantum discord compared with the success probability in the algorithm. The results show that the initial states affect the correlations and the limit point of the correlations in the searching process. However, the initial states do not influence the whole cyclical trend. 相似文献
128.
IntroductionExtensive research works have been published for solving nonlinear mathematicprogramming problems.Nonetheless,it is still difficult to find an effective and universalapproach for general programming problems with multiple design variables and … 相似文献
129.
混沌运动能在一定的范围内按自身的规律不重复地遍历所有状态。利用这个特点 ,本文将混沌运动引入到双相介质参数反问题的研究中。首先利用边界元方法实现了由介质参数到地表位移的非线性映射 ,然后通过建立合成位移与实测位移的相关函数将参数识别问题归结为优化问题 ,最后利用混沌运动指导优化搜索求得介质参数。算例结果表明了混沌搜索方法用于双相介质参数反演问题的可行性和有效性 相似文献
130.
SKATE is a docking prototype that decouples systematic sampling from scoring. This novel approach removes any interdependence between sampling and scoring functions to achieve better sampling and, thus, improves docking accuracy. SKATE systematically samples a ligand's conformational, rotational and translational degrees of freedom, as constrained by a receptor pocket, to find sterically allowed poses. Efficient systematic sampling is achieved by pruning the combinatorial tree using aggregate assembly, discriminant analysis, adaptive sampling, radial sampling, and clustering. Because systematic sampling is decoupled from scoring, the poses generated by SKATE can be ranked by any published, or in‐house, scoring function. To test the performance of SKATE, ligands from the Asetex/CDCC set, the Surflex set, and the Vertex set, a total of 266 complexes, were redocked to their respective receptors. The results show that SKATE was able to sample poses within 2 Å RMSD of the native structure for 98, 95, and 98% of the cases in the Astex/CDCC, Surflex, and Vertex sets, respectively. Cross‐docking accuracy of SKATE was also assessed by docking 10 ligands to thymidine kinase and 73 ligands to cyclin‐dependent kinase. © 2010 Wiley Periodicals, Inc. J Comput Chem, 2010 相似文献