全文获取类型
收费全文 | 1484篇 |
免费 | 64篇 |
国内免费 | 52篇 |
专业分类
电工技术 | 49篇 |
综合类 | 20篇 |
化学工业 | 32篇 |
金属工艺 | 12篇 |
机械仪表 | 59篇 |
建筑科学 | 51篇 |
矿业工程 | 10篇 |
能源动力 | 42篇 |
轻工业 | 5篇 |
水利工程 | 1篇 |
石油天然气 | 6篇 |
武器工业 | 4篇 |
无线电 | 78篇 |
一般工业技术 | 99篇 |
冶金工业 | 23篇 |
原子能技术 | 3篇 |
自动化技术 | 1106篇 |
出版年
2023年 | 14篇 |
2022年 | 17篇 |
2021年 | 19篇 |
2020年 | 15篇 |
2019年 | 35篇 |
2018年 | 19篇 |
2017年 | 65篇 |
2016年 | 59篇 |
2015年 | 83篇 |
2014年 | 97篇 |
2013年 | 119篇 |
2012年 | 67篇 |
2011年 | 127篇 |
2010年 | 76篇 |
2009年 | 115篇 |
2008年 | 130篇 |
2007年 | 117篇 |
2006年 | 92篇 |
2005年 | 76篇 |
2004年 | 53篇 |
2003年 | 42篇 |
2002年 | 42篇 |
2001年 | 28篇 |
2000年 | 26篇 |
1999年 | 21篇 |
1998年 | 17篇 |
1997年 | 11篇 |
1996年 | 5篇 |
1995年 | 4篇 |
1994年 | 2篇 |
1993年 | 2篇 |
1992年 | 1篇 |
1989年 | 1篇 |
1984年 | 1篇 |
1981年 | 1篇 |
1978年 | 1篇 |
排序方式: 共有1600条查询结果,搜索用时 234 毫秒
1.
In this paper, we investigate how adaptive operator selection techniques are able to efficiently manage the balance between exploration and exploitation in an evolutionary algorithm, when solving combinatorial optimization problems. We introduce new high level reactive search strategies based on a generic algorithm's controller that is able to schedule the basic variation operators of the evolutionary algorithm, according to the observed state of the search. Our experiments on SAT instances show that reactive search strategies improve the performance of the solving algorithm. 相似文献
2.
In this research, we propose a novel framework referred to as collective game behavior decomposition where complex collective behavior is assumed to be generated by aggregation of several groups of agents following different strategies and complexity emerges from collaboration and competition of individuals. The strategy of an agent is modeled by certain simple game theory models with limited information. Genetic algorithms are used to obtain the optimal collective behavior decomposition based on history data. The trained model can be used for collective behavior prediction. For modeling individual behavior, two simple games, the minority game and mixed game are investigated in experiments on the real-world stock prices and foreign-exchange rate. Experimental results are presented to show the effectiveness of the new proposed model. 相似文献
3.
Short-term generation scheduling is an important function in daily operational planning of power systems. It is defined as optimal scheduling of power generators over a scheduling period while respecting various generator constraints and system constraints. Objective of the problem includes costs associated with energy production, start-up cost and shut-down cost along with profits. The resulting problem is a large scale nonlinear mixed-integer optimization problem for which there is no exact solution technique available. The solution to the problem can be obtained only by complete enumeration, often at the cost of a prohibitively computation time requirement for realistic power systems. This paper presents a hybrid algorithm which combines Lagrangian Relaxation (LR) together with Evolutionary Algorithm (EA) to solve the problem in cooperative and competitive energy environments. Simulation studies were carried out on different systems containing various numbers of units. The outcomes from different algorithms are compared with that from the proposed hybrid algorithm and the advantages of the proposed algorithm are briefly discussed. 相似文献
4.
This paper proposes the application of Covariance Matrix Adaptation Evolution Strategy (CMA-ES) in fixed structure H∞ loop shaping controller design. Integral Time Absolute Error (ITAE) performance requirement is incorporated as a constraint with an objective of maximization of stability margin in the fixed structure H∞ loop shaping controller design problem. Pneumatic servo system, separating tower process and F18 fighter aircraft system are considered as test systems. The CMA-ES designed fixed structure H∞ loop-shaping controller is compared with the traditional H∞ loop shaping controller, non-smooth optimization and Heuristic Kalman Algorithm (HKA) based fixed structure H∞ loop shaping controllers in terms of stability margin. 20% perturbation in the nominal plant is used to validate the robustness of the CMA-ES designed H∞ loop shaping controller. The effect of Finite Word Length (FWL) is considered to show the implementation difficulties of controller in digital processors. Simulation results demonstrated that CMA-ES based fixed structure H∞ loop shaping controller is suitable for real time implementation with good robust stability and performance. 相似文献
5.
Combinatorial auction is a useful trade manner for transportation service procurements in e-marketplaces. To enhance the competition of combinatorial auction, a novel auction mechanism of two-round bidding with bundling optimization is proposed. As the recommended the auction mechanism, the shipper/auctioneer integrates the objects into several bundles based on the bidding results of first round auction. Then, carriers/bidders bid for the object bundles in second round. The bundling optimization is described as a multi-objective model with two criteria on price complementation and combination consistency. A Quantum Evolutionary Algorithm (QEA) with β-based rotation gate and the encoding scheme based on non-zero elements in complementary coefficient matrix is developed for the model solution. Comparing with a Contrast Genetic Algorithm, QEA can achieve better computational performances for small and middle size problems. 相似文献
6.
I. Belda X. Llorà E. Giralt 《Soft Computing - A Fusion of Foundations, Methodologies and Applications》2006,10(4):295-304
One of the goals of computational chemistry is the automated de novo design of bioactive molecules. Despite significant progress
in computational approaches to ligand design and efficient evaluation of binding energy, novel procedures for ligand design
are required. Evolutionary computation provides a new approach to this design issue. This paper presents an automated methodology
for computer-aided peptide design based on evolutionary algorithms. It provides an automatic tool for peptide de novo design,
based on protein surface patches defined by user. Regarding the restrictive constrains of this problem a special emphasis has been made on the design of the
evolutionary algorithms implemented. 相似文献
7.
Optimal ensemble construction via meta-evolutionary ensembles 总被引:1,自引:0,他引:1
In this paper, we propose a meta-evolutionary approach to improve on the performance of individual classifiers. In the proposed system, individual classifiers evolve, competing to correctly classify test points, and are given extra rewards for getting difficult points right. Ensembles consisting of multiple classifiers also compete for member classifiers, and are rewarded based on their predictive performance. In this way we aim to build small-sized optimal ensembles rather than form large-sized ensembles of individually-optimized classifiers. Experimental results on 15 data sets suggest that our algorithms can generate ensembles that are more effective than single classifiers and traditional ensemble methods. 相似文献
8.
The tree representation of evolutionary relationship oversimplifies the view of the process of evolution as it cannot take into account the events such as horizontal gene transfer, hybridization, homoplasy and genetic recombination. Several algorithms exist for constructing phylogenetic networks which result from events such as horizontal gene transfer, hybridization and homoplasy. Very little work has been published on the algorithmic detail of phylogenetic networks with constrained recombination. The problem of minimizing the number of recombinations in a phylogenetic network, constructed using binary DNA sequences, is NP-hard. In this paper, we propose a pattern recognition-based O(n2) time approach for constructing the phylogenetic network, where n is the number of nodes or sequences in the input data. The network is constructed with the restriction that no two cycles in the network share a common node. 相似文献
9.
An adaptive product platform offers high customizability for generating feasible product variants for customer requirements. Customization takes place not only to product platform structure but also to its relevant parameters. Structural and parametric optimization processes are interwoven with each other to achieve the total optimality. This paper presents an evolutionary method dealing with interwoven structural and parametric optimization of adaptive platform product customization. The method combines genetic programming and genetic algorithm for handling structural and parametric optimization, respectively. Efficient genetic representation and operation schemes are carefully adapted. While designing these schemes, features specific to structural and parameter customization are considered for the simplification of platform product management. The experimental results show that the performance of the proposed algorithm outperforms that of the tandem evolutionary algorithm in which a genetic algorithm for parametric optimization is totally nested in a genetic programming for structural optimization. 相似文献
10.
一种结合知识挖掘的进化规划算法 总被引:2,自引:0,他引:2
进化规划是一种进化计算方法。进化规划主要使用随机化技术来实现优化过程。与其它进化算法相比,进化规划只有变异操作,而没有交叉操作,因此变异操作的有效性对进化规划算法的成功至关重要。在传统进化规划算法中,进化规划的变异操作具有完全的随机性,这虽然有利于避免局部极值,但却导致较大的计算量。在本文算法中,将知识挖掘技术引入进化规划之中。知识挖掘技术主要用于发现规则,然后利用发现的规则指导变异操作过程,提高变异操作的效率。最终加快了进化规划算法的速度,而计算效果没有明显下降。通过知识挖掘技术的引入,进化规划算法有了初步的智能特性。将本文所介绍的新算法应用于视频编码的运动估计实验中,结果表明新算法有良好的计算速度和计算精确性。 相似文献