全文获取类型
收费全文 | 1424篇 |
免费 | 67篇 |
国内免费 | 39篇 |
专业分类
化学 | 254篇 |
力学 | 46篇 |
综合类 | 12篇 |
数学 | 423篇 |
物理学 | 275篇 |
无线电 | 520篇 |
出版年
2024年 | 3篇 |
2023年 | 18篇 |
2022年 | 21篇 |
2021年 | 28篇 |
2020年 | 15篇 |
2019年 | 23篇 |
2018年 | 13篇 |
2017年 | 41篇 |
2016年 | 31篇 |
2015年 | 41篇 |
2014年 | 102篇 |
2013年 | 86篇 |
2012年 | 55篇 |
2011年 | 78篇 |
2010年 | 77篇 |
2009年 | 108篇 |
2008年 | 117篇 |
2007年 | 145篇 |
2006年 | 99篇 |
2005年 | 80篇 |
2004年 | 59篇 |
2003年 | 46篇 |
2002年 | 47篇 |
2001年 | 33篇 |
2000年 | 36篇 |
1999年 | 36篇 |
1998年 | 27篇 |
1997年 | 23篇 |
1996年 | 23篇 |
1995年 | 10篇 |
1994年 | 1篇 |
1993年 | 5篇 |
1992年 | 1篇 |
1987年 | 1篇 |
1986年 | 1篇 |
排序方式: 共有1530条查询结果,搜索用时 10 毫秒
81.
82.
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. 相似文献
83.
84.
Given a settled reduction in the present level of tax revenue, and by exploring a very large combinatorial space of tax structures, in this paper we employ a genetic algorithm in order to determine the ‘best’ structure of a real world personal income tax that allows for the maximisation of the redistributive effect of the tax, while preventing all taxpayers being worse off than with the present tax structure. We take Italy as a case study. 相似文献
85.
We adapted the genetic algorithm to minimize the AMBER potential energy function. We describe specific recombination and mutation operators for this task. Next we use our algorithm to locate low energy conformation of three polypeptides (AGAGAGAGA, A9, and [Met]-enkephalin) which are probably the global minimum conformations. Our potential energy minima are –94.71, –98.50, and –48.94 kcal/mol respectively. Next, we applied our algorithm to the 46 amino acid protein crambin and located a non-native conformation which had an AMBER potential energy 150 kcal/mol lower than the native conformation. This is not necessarily the global minimum conformation, but it does illustrate problems with the AMBER potential energy function. We believe this occurred because the AMBER potential energy function does not account for hydration. 相似文献
86.
In this paper, two heuristic optimization techniques are tested and compared in the application of motion planning for autonomous agricultural vehicles: Simulated Annealing and Genetic Algorithms. Several preliminary experimentations are performed for both algorithms, so that the best neighborhood definitions and algorithm parameters are found. Then, the two tuned algorithms are run extensively, but for no more than 2000 cost function evaluations, as run-time is the critical factor for this application. The comparison of the two algorithms showed that the Simulated Annealing algorithm achieves the better performance and outperforms the Genetic Algorithm. The final optimum found by the Simulated Annealing algorithm is considered to be satisfactory for the specific motion planning application. 相似文献
87.
88.
Cost-sensitive classification is based on a set of weights defining the expected cost of misclassifying an object. In this paper, a Genetic Fuzzy Classifier, which is able to extract fuzzy rules from interval or fuzzy valued data, is extended to this type of classification. This extension consists in enclosing the estimation of the expected misclassification risk of a classifier, when assessed on low quality data, in an interval or a fuzzy number. A cooperative-competitive genetic algorithm searches for the knowledge base whose fitness is primal with respect to a precedence relation between the values of this interval or fuzzy valued risk. In addition to this, the numerical estimation of this risk depends on the entrywise product of cost and confusion matrices. These have been, in turn, generalized to vague data. The flexible assignment of values to the cost function is also tackled, owing to the fact that the use of linguistic terms in the definition of the misclassification cost is allowed. 相似文献
89.
In this paper, a permutation-based genetic algorithm (GA) is applied to the NP-hard problem of arranging a number of facilities on a line with minimum cost, known as the single row facility layout problem (SRFLP). The GA individuals are obtained by using some rule-based as well as random permutations of the facilities, which are then improved towards the optimum by means of specially designed crossover and mutation operators. Such schemes led the GA to handle the SRFLP as an unconstrained optimization problem. In the computational experiments carried out with large-size instances of sizes from 60 to 80, available in the literature, the proposed GA improved several previously known best solutions. 相似文献
90.
A hybrid shuffled complex evolution approach based on differential evolution for unconstrained optimization 总被引:1,自引:0,他引:1
Viviana Cocco Mariani Luiz Guilherme Justi Luvizotto Leandro dos Santos Coelho 《Applied mathematics and computation》2011,217(12):5822-5829
Numerous optimization methods have been proposed for the solution of the unconstrained optimization problems, such as mathematical programming methods, stochastic global optimization approaches, and metaheuristics. In this paper, a metaheuristic algorithm called Modified Shuffled Complex Evolution (MSCE) is proposed, where an adaptation of the Downhill Simplex search strategy combined with the differential evolution method is proposed. The efficiency of the new method is analyzed in terms of the mean performance and computational time, in comparison with the genetic algorithm using floating-point representation (GAF) and the classical shuffled complex evolution (SCE-UA) algorithm using six benchmark optimization functions. Simulation results and the comparisons with SCE-UA and GAF indicate that the MSCE improves the search performance on the five benchmark functions of six tested functions. 相似文献