全文获取类型
收费全文 | 545篇 |
免费 | 31篇 |
国内免费 | 23篇 |
专业分类
电工技术 | 9篇 |
综合类 | 14篇 |
化学工业 | 11篇 |
金属工艺 | 1篇 |
机械仪表 | 16篇 |
建筑科学 | 3篇 |
矿业工程 | 1篇 |
武器工业 | 1篇 |
无线电 | 19篇 |
一般工业技术 | 166篇 |
冶金工业 | 48篇 |
自动化技术 | 310篇 |
出版年
2024年 | 2篇 |
2023年 | 3篇 |
2022年 | 5篇 |
2021年 | 5篇 |
2020年 | 9篇 |
2019年 | 16篇 |
2018年 | 11篇 |
2017年 | 41篇 |
2016年 | 26篇 |
2015年 | 13篇 |
2014年 | 23篇 |
2013年 | 92篇 |
2012年 | 25篇 |
2011年 | 29篇 |
2010年 | 14篇 |
2009年 | 32篇 |
2008年 | 21篇 |
2007年 | 19篇 |
2006年 | 35篇 |
2005年 | 21篇 |
2004年 | 21篇 |
2003年 | 16篇 |
2002年 | 9篇 |
2001年 | 12篇 |
2000年 | 8篇 |
1999年 | 13篇 |
1998年 | 16篇 |
1997年 | 8篇 |
1996年 | 12篇 |
1995年 | 7篇 |
1994年 | 7篇 |
1993年 | 5篇 |
1992年 | 5篇 |
1991年 | 2篇 |
1990年 | 5篇 |
1989年 | 2篇 |
1988年 | 2篇 |
1986年 | 3篇 |
1984年 | 1篇 |
1979年 | 1篇 |
1975年 | 1篇 |
1957年 | 1篇 |
排序方式: 共有599条查询结果,搜索用时 15 毫秒
1.
Sidhartha R. Das Basheer M. Khumawala 《International Journal of Flexible Manufacturing Systems》1991,3(2):121-147
Flexible manufacturing systems (FMSs) are a class of automated systems that can be used to improve productivity in batch manufacturing. Four stages of decision making have been defined for an FMS—the design, planning, scheduling, and control stages. This research focuses on the planning stage, and specifically in the area of scheduling batches of parts through the system.The literature to date on the FMS planning stage has mostly focused on the machine grouping, tool loading, and parttype selection problems. Our research carries the literature a step further by addressing the problem of scheduling batches of parts. Due to the use of serial-access material-handling systems in many FMSs, the batch-scheduling problem is modeled for a flexible flow system (FFS). This model explicitly accounts for setup times between batches that are dependent on their processing sequence.A heuristic procedure is developed for this batch-scheduling problem—the Maximum Savings (MS) heuristic. The MS heuristic is based upon the savings in time associated with a particular sequence and selecting the one with the maximum savings. It uses a two-phase method, with the savings being calculated in phase I, while a branch-and-bound procedure is employed to seek the best heuristic solution in phase II. Extensive computational results are provided for a wide variety of problems. The results show that the MS heuristic provides good-quality solutions. 相似文献
2.
Minimizing the number of tool switches on a flexible machine 总被引:5,自引:0,他引:5
Yves Crama Antoon W. J. Kolen Alwin G. Oerlemans Frits C. R. Spieksma 《International Journal of Flexible Manufacturing Systems》1994,6(1):33-54
This article analyzes a tool switching problem arising in certain flexible manufacturing environments. A batch of jobs have to be successively processed on a single flexible machine. Each job requires a subset of tools, which have to be placed in the tool magazine of the machine before the job can be processed. The tool magazine has a limited capacity, and, in general, the number of tools needed to produce all the jobs exceeds this capacity. Hence, it is sometimes necessary to change tools between two jobs in a sequence. The problem is then to determine a job sequence and an associated sequence of loadings for the tool magazine, such that the total number of tool switches is minimized. This problem has been previously considered by several authors; it is here revisited, both from a theoretical and from a computational viewpoint. Basic results concerning the computational complexity of the problem are established. Several heuristics are proposed for its solution, and their performance is computationally assessed. 相似文献
3.
The paper presents a case study of the development of an expert decision support system which uses simple heuristic methods for fast determination of routes for simultaneous signals in a transmission network of limited capacity. It illustrates how heuristic solutions can be embodied in a model-based DSS and how the standard decision support literature, although intuitively appealing, provides little practical assistance in system construction or classification 相似文献
4.
Decision routines unburden the cognitive capacity of the decision maker. In changing environments, however, routines may become maladaptive. In 2 experiments with a hypothetical stock market game (n = 241), the authors tested whether decision routines tend to persist at the level of decision strategies rather than at the level of options in strategy selection. The payoff structure of the task was changed after 80 decision trials, rendering a new strategy optimal with respect to expected payoff. Whereas most participants detected the appropriate strategy at the beginning of the task, they tended to retain it even when it was no longer optimal. A hint about a possible change had only a small influence on this maladaptive routine; a monetary incentive had none. Switching to a similar but not identical task relaxed the routine, but not much. (PsycINFO Database Record (c) 2010 APA, all rights reserved) 相似文献
5.
Louis Anthony Cox Jr. 《Annals of Mathematics and Artificial Intelligence》1990,2(1-4):93-107
Interactive expert systems seek relevant information from a user in order to answer a query or to solve a problem that the user has posed. A fundamental design issue for such a system is therefore itsinformation-seeking strategy, which determines the order in which it asks questions or performs experiments to gain the information that it needs to respond to the user. This paper examines the problem of optimal knowledge acquisition through questioning in contexts where it is expensive or time-consuming to obtain the answers to questions. An abstract model of an expert classification system — considered as a set of logical classification rules supplemented by some statistical knowledge about attribute frequencies — is developed and applied to analyze the complexity and to present constructive algorithms for doing probabilistic question-based classification. New heuristics are presented that generalize previous results for optimal identification keys and questionnaires. For an important class of discrete discriminant analysis problems, these heuristics find optimal or near-optimal questioning strategies in a small fraction of the time required by an exact solution algorithm. 相似文献
6.
7.
韩旭 《工程地球物理学报》2010,7(5):639-643
以唐家山堰塞湖为研究对象,首先根据当时权威新闻报道数据及数字高程模型用数值积分和拟合两种方法求堰塞湖的蓄水量。在溃坝阶段,由经验公式及进出水量平衡建立模型,从而拟合出溃口的深度和宽度随时间变化的表达式。在泛洪阶段,采用静态分析,假设水流呈圆形蔓延采用先离散后整合叠加的方法建立柱体模型得到被淹面积和淹没深度,并在此基础上考虑洪水淹没区域中人口密集区域的人员撤离方案。 相似文献
8.
二维带形装箱问题是一个经典的NP-hard的组合优化问题,该问题在实际的生活和工业生产中有着广泛的应用.研究该问题,对企业节约成本、节约资源以及提高生产效率有着重要的意义.提出了一个强化学习求解算法.新颖地使用强化学习为启发式算法提供一个初始的装箱序列,有效地改善启发式冷启动的问题.该强化学习模型能进行自我驱动学习,仅使用启发式计算的解决方案的目标值作为奖励信号来优化网络,使网络能学习到更好的装箱序列.使用简化版的指针网络来解码输出装箱序列,该模型由嵌入层、解码器和注意力机制组成.使用Actor-Critic算法对模型进行训练,提高了模型的效率.在714个标准问题实例和随机生成的400个问题实例上测试提出的算法,实验结果显示:提出的算法能有效地改善启发式冷启动的问题,性能超过当前最优秀的启发式求解算法. 相似文献
9.
课程表问题是经典的组合优化问题,属于NP-hard问题.长期以来人们一直都在寻求快速高效的近似算法,以便在合理的计算时间内准确解决大规模课程安排问题,并提出许多有效且实用的启发式和元启发式算法.在此基础上提出了一种基于多个图染色启发式规则的模拟退火超启发式算法.在超启发式算法的框架中,用模拟退火算法作为高层搜索算法,多个图染色启发式规则为底层的构造算法.与现有的方法相比,该算法具有很好的通用性,可以很容易推广到考试时间表、会议安排.旅行商问题、背包问题等应用领域.实验表明,该算法是可行有效的,且无一例时间、空间冲突. 相似文献
10.