全文获取类型
收费全文 | 105篇 |
免费 | 3篇 |
国内免费 | 5篇 |
专业分类
电工技术 | 12篇 |
综合类 | 8篇 |
化学工业 | 1篇 |
机械仪表 | 5篇 |
水利工程 | 4篇 |
无线电 | 3篇 |
一般工业技术 | 25篇 |
原子能技术 | 1篇 |
自动化技术 | 54篇 |
出版年
2023年 | 1篇 |
2021年 | 1篇 |
2020年 | 1篇 |
2019年 | 7篇 |
2018年 | 3篇 |
2017年 | 7篇 |
2016年 | 3篇 |
2015年 | 2篇 |
2014年 | 3篇 |
2013年 | 13篇 |
2012年 | 7篇 |
2011年 | 2篇 |
2010年 | 1篇 |
2009年 | 5篇 |
2008年 | 7篇 |
2007年 | 5篇 |
2006年 | 7篇 |
2005年 | 2篇 |
2004年 | 9篇 |
2003年 | 5篇 |
2002年 | 2篇 |
2001年 | 5篇 |
2000年 | 1篇 |
1998年 | 4篇 |
1996年 | 1篇 |
1995年 | 2篇 |
1994年 | 2篇 |
1992年 | 2篇 |
1991年 | 1篇 |
1990年 | 2篇 |
排序方式: 共有113条查询结果,搜索用时 0 毫秒
1.
基于列表的迭代分枝定界MIMO检测算法 总被引:1,自引:1,他引:0
提出了基于列表的迭代分枝定界算法,利用搜索到的候选列表计算比特软信息,降低了MAP计算复杂度,同时进一步提出了改进的列表分枝定界算法,每次迭代利用更新的先验信息重新计算候选列表,提高了列表质量。仿真结果表明列表分枝定界算法通过在MIMO信道检测和信道解码之间传递外信息,取得了逼近信道容量的性能,而修正的考虑先验信息的列表分枝定界算法在性能损失可忽略的情况下,减小了候选列表的大小。 相似文献
2.
In this paper, we investigate a single-machine scheduling problem with periodic maintenance, which is motivated by various industrial applications (e.g. tool changes). The pursued objective is to minimise the number of tardy jobs, because it is one of the important criteria for the manufacturers to avoid the loss of customers. The strong NP-hardness of the problem is shown. To improve the state-of-the-art exact algorithm, we devise a new branch-and-bound algorithm based on an efficient lower bounding procedure and several new dominance properties. Numerical experiments are conducted to demonstrate the efficiency of our exact algorithm. 相似文献
3.
本文提出了一种快速的浓缩近邻分类器BDPATCH-GBB,并从压缩样本集和减少计算
量两方面着手提高分类器的性能.实验表明,与其它近邻分类器相比,BDPATCH-GBB是高
效的. 相似文献
4.
Matthew Huntbach 《International journal of parallel programming》1991,20(4):299-314
The concurrent logic languages, of which Parlog is one, have been promoted as a new generation of software languages specifically designed for parallel programming. This paper investigates their application to a search problem commonly used as an illustration of artificial intelligence techniques, the 8-puzzle. It notes that programs written in the concurrent logic languages which do not pay attention to the parallelism can fall into two possible traps: either there is little real parallelism in them due to data dependencies, or there is too much parallelism and any practical architecture will be overwhelmed. A solution which controls the parallelism using user-defined priorities is proposed. This solution has the advantage of being architecture-independent. 相似文献
5.
A companion paper introduces new lower bounds and heuristics for the problem of minimizing makespan on identical parallel machines. The objective of this paper is threefold. First, we describe further enhancements of previously described lower bounds. Second, we propose a new heuristic that requires solving a sequence of 0–1 knapsack problems. Finally, we show that embedding these newly derived bounds in a branch‐and‐bound procedure yields a very effective exact algorithm. Moreover, this algorithm features a new symmetry‐breaking branching strategy. We present the results of computational experiments that were carried out on a large set of instances and that attest to the efficacy of the proposed algorithm. In particular, we report proven optimal solutions for some benchmark problems that have been open for some time. 相似文献
6.
Embedding Branch and Bound within Evolutionary Algorithms 总被引:1,自引:0,他引:1
A framework for hybridizing evolutionary algorithms with the branch-and-bound algorithm (B&B) is presented in this paper. This framework is based on using B&B as an operator embedded in the evolutionary algorithm. The resulting hybrid operator will intelligently explore the dynastic potential (possible children) of the solutions being recombined, providing the best combination of formae (generalized schemata) that can be constructed without introducing implicit mutation. As a basis for studying this operator, the general functioning of transmitting recombination is considered. Two important concepts are introduced, compatibility sets, and granularity of the representation. These concepts are studied in the context of different kinds of representation: orthogonal, non-orthogonal separable, and non-separable.The results of an extensive experimental evaluation are reported. It is shown that this model can be useful when problem knowledge is available in the form of an optimistic evaluation function. Scalability issues are also considered. A control mechanism is proposed to alleviate the increasing computational cost of the algorithm for highly multidimensional problems. 相似文献
7.
8.
9.
一种复杂项目调度问题的混合智能算法 总被引:3,自引:0,他引:3
针对有资源约束的项目调度问题模型的不足,调研了企业需求,提出了带有预约时间窗口约束的项目调度模型,并针对该类模型的特点分析了原有算法存在的问题,将分枝定界算法与启发式算法相结合,提出了一种解决该类问题的混合智能算法.仿真结果表明,该算法的优化效果明显优于其他算法. 相似文献
10.
In an assembly line of a just-in-time (JIT) production system, workers have the power and the responsibility to stop the line when they fail to complete their operations within their work zones. This paper deals with a sequencing problem for the mixed-model assembly conveyor line in the JIT production system. In some environment, the most important criterion is the line stoppage rather than the variation of production rates. The problem is to find an optimal sequence of units that minimizes the total line stoppage time. Lower and upper bounds of the total line stoppage time are derived and the branch-and-bound method is applied to the problem. A numerical example is given. 相似文献