全文获取类型
收费全文 | 1530篇 |
免费 | 273篇 |
国内免费 | 53篇 |
专业分类
化学 | 529篇 |
晶体学 | 9篇 |
力学 | 201篇 |
综合类 | 125篇 |
数学 | 582篇 |
物理学 | 410篇 |
出版年
2024年 | 3篇 |
2023年 | 9篇 |
2022年 | 58篇 |
2021年 | 52篇 |
2020年 | 53篇 |
2019年 | 28篇 |
2018年 | 39篇 |
2017年 | 47篇 |
2016年 | 84篇 |
2015年 | 65篇 |
2014年 | 81篇 |
2013年 | 100篇 |
2012年 | 84篇 |
2011年 | 103篇 |
2010年 | 78篇 |
2009年 | 80篇 |
2008年 | 98篇 |
2007年 | 107篇 |
2006年 | 98篇 |
2005年 | 84篇 |
2004年 | 98篇 |
2003年 | 68篇 |
2002年 | 74篇 |
2001年 | 59篇 |
2000年 | 51篇 |
1999年 | 42篇 |
1998年 | 36篇 |
1997年 | 16篇 |
1996年 | 22篇 |
1995年 | 10篇 |
1994年 | 3篇 |
1993年 | 3篇 |
1992年 | 3篇 |
1991年 | 2篇 |
1990年 | 5篇 |
1988年 | 5篇 |
1985年 | 4篇 |
1978年 | 1篇 |
1972年 | 1篇 |
1971年 | 1篇 |
1959年 | 1篇 |
排序方式: 共有1856条查询结果,搜索用时 15 毫秒
1.
Toward Fuzzy Optimization without Mathematical Ambiguity 总被引:15,自引:0,他引:15
Baoding Liu 《Fuzzy Optimization and Decision Making》2002,1(1):43-63
Fuzzy programming has been discussed widely in literature and applied in such various disciplines as operations research, economic management, business administration, and engineering. The main purpose of this paper is to present a brief review on fuzzy programming models, and classify them into three broad classes: expected value model, chance-constrained programming and dependent-chance programming. In order to solve general fuzzy programming models, a hybrid intelligent algorithm is also documented. Finally, some related topics are discussed. 相似文献
2.
达草灭对莱茵衣藻(Chlamydomonas reinhardtii) 品系遗传后效应的研究 总被引:1,自引:0,他引:1
通过将莱菌衣藻(Chlamydomonas reinhardtii)6种达草灭抗性突变株分别与野生型株、丧失合成叶绿素b能力的cbnI-43等基因突变株和精氨酸依赖型突变株杂交对其后代进行四分析与随机分析,发现在Nfr-4-Nfr-7突变株中达草灭抗性状只有单一核基因遗传的性质,而在Nfr-1、Nfr-3~Nfr-7抗性株的抗性性状都是由同一个nfr-1基因(norflurazon resisanse)的突变所决定的,而Nfr-4抗性株的抗性性状是由另一滚突变等位基因nfr-2所决定的。在Nfr-1和Nfr-3抗性株中除了nfr-1基因的突变还有nfr-3基因突变的参与。 相似文献
3.
A new approach to the robust handling of non‐linear constraints for GAs (genetic algorithms) optimization is proposed. A specific feature of the approach consists of the change in the conventional search strategy by employing search paths which pass through both feasible and infeasible points (contrary to the traditional approach where only feasible points may be included in a path). The method (driven by full Navier–Stokes computations) was applied to the problem of multiobjective optimization of aerodynamic shapes subject to various geometrical and aerodynamic constraints. The results demonstrated that the method retains high robustness of conventional GAs while keeping CFD computational volume to an acceptable level, which allowed the algorithm to be used in a demanding engineering environment. Copyright © 2004 John Wiley & Sons, Ltd. 相似文献
4.
基于改进遗传算法的布局优化子问题 总被引:2,自引:0,他引:2
本针对子问题,构造了布局子问题(关于同构布局等价类)的改进遗传算法。将该算法应用于二维布局优化子问题,数值实验表明该算法能够在很好地保持图元的邻接关系的前提下找到子问题的最优解。由于布局优化问题可分解为有限个子问题,所以利用该算法可以找到整个布局优化问题的全局最优解。 相似文献
5.
This paper presents a new generic Evolutionary Algorithm (EA) for retarding the unwanted effects of premature convergence. This is accomplished by a combination of interacting generic methods. These generalizations of a Genetic Algorithm (GA) are inspired by population genetics and take advantage of the interactions between genetic drift and migration. In this regard a new selection scheme is introduced, which is designed to directedly control genetic drift within the population by advantageous self-adaptive selection pressure steering. Additionally this new selection model enables a quite intuitive heuristics to detect premature convergence. Based upon this newly postulated basic principle the new selection mechanism is combined with the already proposed Segregative Genetic Algorithm (SEGA), an advanced Genetic Algorithm (GA) that introduces parallelism mainly to improve global solution quality. As a whole, a new generic evolutionary algorithm (SASEGASA) is introduced. The performance of the algorithm is evaluated on a set of characteristic benchmark problems. Computational results show that the new method is capable of producing highest quality solutions without any problem-specific additions. 相似文献
6.
This paper proposes a floating-point genetic algorithm (FPGA) to solve the unit commitment problem (UCP). Based on the characteristics of typical load demand, a floating-point chromosome representation and an encoding–decoding scheme are designed to reduce the complexities in handling the minimum up/down time limits. Strategic parameters of the FPGA are characterized in detail, i.e., the evaluation function and its constraints, population size, operation styles of selection, crossover operation and probability, mutation operation and probability. A dynamic combination scheme of genetic operators is formulated to explore and exploit the FPGA in the non-convex solution space and multimodal objective function. Experiment results show that the FPGA is a more effective technique among the various styles of genetic algorithms, which can be applied to the practical scheduling tasks in utility power systems. 相似文献
7.
Manufacturing cell formation using similarity coefficients and a parallel genetic TSP algorithm: Formulation and comparison 总被引:2,自引:0,他引:2
J. BalakrishnanP. D. Jog 《Mathematical and Computer Modelling》1995,21(12):61-73
Many algorithms have been proposed to form manufacturing cells from component routings. However, many of these do not have the capability of solving large problems. We propose a procedure using similarity coefficients and a parallel genetic implementation of a TSP algorithm that is capable of solving large problems of up to 1000 parts and 1000 machines. In addition, we also compare our procedure with many existing procedures using nine well-known problems from the literature.
The results show that the proposed procedure compares well with the existing procedures and should be useful to practitioners and researchers. 相似文献
8.
An energy-dependent partitioning scheme is explored for extracting a small number of eigenvalues of a real symmetric matrix with the help of genetic algorithm. The proposed method is tested with matrices of different sizes (30 × 30 to 1000 × 1000). Comparison is made with Löwdin’s strategy for solving the problem. The relative advantages and disadvantages of the GA-based method are analyzed 相似文献
9.
10.
It is widely believed that evolutionary dynamics of artificial self‐replicators realized in cellular automata (CA) are limited in diversity and adaptation. Contrary to this view, we show that complex genetic evolution may occur within simple CA. The evolving self‐replicating loops (“evoloops”) we investigate exhibit significant diversity in macro‐scale morphologies and mutational biases, undergoing nontrivial genetic adaptation by maximizing colony density and enhancing sustainability against other species. Nonmutable subsequences enable genetic operations that alter fitness differentials and promote long‐term evolutionary exploration. These results demonstrate a unique example of genetic evolution hierarchically emerging from local interactions between elements much smaller than individual replicators. © 2004 Wiley Periodicals, Inc. Complexity 10: 33–39, 2004 相似文献