全文获取类型
收费全文 | 359篇 |
免费 | 159篇 |
国内免费 | 37篇 |
出版年
2023年 | 5篇 |
2022年 | 6篇 |
2021年 | 8篇 |
2020年 | 12篇 |
2019年 | 7篇 |
2018年 | 5篇 |
2017年 | 20篇 |
2016年 | 32篇 |
2015年 | 22篇 |
2014年 | 31篇 |
2013年 | 27篇 |
2012年 | 37篇 |
2011年 | 37篇 |
2010年 | 19篇 |
2009年 | 42篇 |
2008年 | 22篇 |
2007年 | 22篇 |
2006年 | 29篇 |
2005年 | 30篇 |
2004年 | 27篇 |
2003年 | 15篇 |
2002年 | 12篇 |
2001年 | 13篇 |
2000年 | 22篇 |
1999年 | 14篇 |
1998年 | 13篇 |
1997年 | 9篇 |
1996年 | 3篇 |
1995年 | 3篇 |
1994年 | 5篇 |
1993年 | 2篇 |
1992年 | 1篇 |
1991年 | 2篇 |
1990年 | 1篇 |
排序方式: 共有555条查询结果,搜索用时 15 毫秒
131.
用无人机担任僚机已成为战斗机编组作战领域技战术研究的新热点。本文通过跟踪美国“忠诚僚机”项目的试验进展,了解所用无人僚机和战斗机平台的性能及特点,把握长僚机编组作战对无人僚机的基本指标需求。在此基础上,结合美军分布式作战概念的演变、智能空战技术研究和现有装备改装趋势等因素,分析了“忠诚僚机”项目在推进空中分布式作战概念实用化、提高长僚机编组作战效能以及形成规模化无人僚机装备方面可能产生的影响。基于上述分析,得出无人僚机与有人战斗机编组作战是军队需要面对的新型作战样式这一结论,并结合国内空战理论研究、军用无人机制造能力以及反无人机装备的发展情况,给出整合资源发展优势无人机、以硬杀伤和软杀伤多种形式构建有效反制体系的对策建议。 相似文献
132.
We consider a system that depends on a single vital component. If this component fails, the system life will terminate. If the component is replaced before its failure then the system life may be extended; however, there are only a finite number of spare components. In addition, the lifetimes of these spare components are not necessarily identically distributed. We propose a model for scheduling component replacements so as to maximize the expected system survival. We find the counterintuitive result that when comparing components' general lifetime distributions based on stochastic orderings, not even the strongest ordering provides an a priori guarantee of the optimal sequencing of components. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008 相似文献
133.
We consider the scheduling of large‐scale projects to maximize the project net present value given temporal and resource constraints. The net present value objective emphasizes the financial aspects of project management. Temporal constraints between the start times of activities make it possible to handle practical problem assumptions. Scarce resources are an expression of rising cost. Since optimization techniques are not expedient to solve such problems and most heuristic methods known from literature cannot deal with general temporal constraints, we propose a new bidirectional priority‐rule based method. Scheduling activities with positive cash flows as early and activities with negative cash flows as late as possible results in a method which is completed by unscheduling techniques to cope with scarce resources. In a computational experiment, we compare the well‐known serial generation scheme where all activities are scheduled as early as possible with the proposed bidirectional approach. On the basis of a comprehensive data set known from literature containing instances with up to 1002 activities, the efficiency of the new approach is demonstrated. © 2003 Wiley Periodicals, Inc. Naval Research Logistics, 2003 相似文献
134.
Philip Kaminsky 《海军后勤学研究》2003,50(3):257-272
In the flow shop delivery time problem, a set of jobs has to be processed on m machines. Every machine has to process each one of the jobs, and every job has the same routing through the machines. The objective is to determine a sequence of the jobs on the machines so as to minimize maximum delivery completion time over all the jobs, where the delivery completion time of a job is the sum of its completion time, and the delivery time associated with that job. In this paper, we prove the asymptotic optimality of the Longest Delivery Time algorithm for the static version of this problem, and the Longest Delivery Time among Available Jobs (LDTA) algorithm for the dynamic version of this problem. In addition, we present the result of computational testing of the effectiveness of these algorithms. © 2003 Wiley Periodicals, Inc. Naval Research Logistics, 2003 相似文献
135.
T.C. Edwin Cheng Qing Ding Mikhail Y. Kovalyov Aleksander Bachman Adam Janiak 《海军后勤学研究》2003,50(6):531-554
We study the problems of scheduling a set of nonpreemptive jobs on a single or multiple machines without idle times where the processing time of a job is a piecewise linear nonincreasing function of its start time. The objectives are the minimization of makespan and minimization of total job completion time. The single machine problems are proved to be NP‐hard, and some properties of their optimal solutions are established. A pseudopolynomial time algorithm is constructed for makespan minimization. Several heuristics are derived for both total completion time and makespan minimization. Computational experiments are conducted to evaluate their efficiency. NP‐hardness proofs and polynomial time algorithms are presented for some special cases of the parallel machine problems. © 2003 Wiley Periodicals, Inc. Naval Research Logistics 50: 531–554, 2003 相似文献
136.
Tetsuji Hirayama 《海军后勤学研究》2003,50(7):719-741
In this paper, we investigate multiclass feedback queues with gated disciplines. The server selects the stations by a nonpreemptive priority scheduling algorithm and serves customers in the selected station by either a gated FCFS discipline or a gated priority discipline. We take a rather systematic approach to their mean sojourn times. We define conditional expected sojourn times for all customers and derive their expressions from an analysis of busy periods. Since they are shown to be linear in some components of the system states, their steady state mean values can be derived from simple limiting procedures. These mean values can be obtained from a set of linear equations. © 2003 Wiley Periodicals, Inc. Naval Research Logistics 50: 719–741, 2003. 相似文献
137.
外存I/O一直是影响I/O密集型应用系统性能的决定性因素。在系统分析I/O优化调度策略及其对磁盘特征参数的需求的基础上,提出了一组面向I/O优化调度器的磁盘特征抽取方法。这些抽取方法已经被证明是高效的,并且在Traxtents Cello调度器的实现中得到采用。 相似文献
138.
The service‐provision problem described in this paper comes from an application of distributed processing in telecommunications networks. The objective is to maximize a service provider's profit from offering computational‐based services to customers. The service provider has limited capacity and must choose which of a set of software applications he would like to offer. This can be done dynamically, taking into consideration that demand for the different services is uncertain. The problem is examined in the framework of stochastic integer programming. Approximations and complexity are examined for the case when demand is described by a discrete probability distribution. For the deterministic counterpart, a fully polynomial approximation scheme is known 2 . We show that introduction of stochasticity makes the problem strongly NP‐hard, implying that the existence of such a scheme for the stochastic problem is highly unlikely. For the general case a heuristic with a worst‐case performance ratio that increases in the number of scenarios is presented. Restricting the class of problem instances in a way that many reasonable practical problem instances satisfy allows for the derivation of a heuristic with a constant worst‐case performance ratio. Worst‐case performance analysis of approximation algorithms is classical in the field of combinatorial optimization, but in stochastic programming the authors are not aware of any previous results in this direction. © 2003 Wiley Periodicals, Inc. Naval Research Logistics, 2003 相似文献
139.
140.
蒸汽动力装置分布式控制系统可靠性设计准则 总被引:3,自引:1,他引:2
讨论了为保证蒸汽动力装置分布式控制系统的可靠性所采取的一般技术 ,详细分析了提高蒸汽动力装置分布式控制系统可靠性的一般设计准则 ,包括系统设计的一般要求、计算机的选型、元器件的选择与使用以及抗干扰措施 相似文献