全文获取类型
收费全文 | 204篇 |
免费 | 189篇 |
国内免费 | 32篇 |
出版年
2024年 | 2篇 |
2023年 | 6篇 |
2022年 | 4篇 |
2021年 | 2篇 |
2020年 | 11篇 |
2019年 | 4篇 |
2018年 | 2篇 |
2017年 | 12篇 |
2016年 | 15篇 |
2015年 | 18篇 |
2014年 | 20篇 |
2013年 | 17篇 |
2012年 | 26篇 |
2011年 | 22篇 |
2010年 | 9篇 |
2009年 | 28篇 |
2008年 | 17篇 |
2007年 | 13篇 |
2006年 | 14篇 |
2005年 | 15篇 |
2004年 | 21篇 |
2003年 | 14篇 |
2002年 | 14篇 |
2001年 | 15篇 |
2000年 | 15篇 |
1999年 | 15篇 |
1998年 | 15篇 |
1997年 | 11篇 |
1996年 | 9篇 |
1995年 | 5篇 |
1994年 | 9篇 |
1993年 | 8篇 |
1992年 | 4篇 |
1991年 | 3篇 |
1990年 | 2篇 |
1989年 | 7篇 |
1975年 | 1篇 |
排序方式: 共有425条查询结果,搜索用时 15 毫秒
111.
Statistical estimation plays an important role in locating a target in space, a task that has important applications in many areas. However, theoretical measures on the quality of various estimators reported in the literature have been difficult to obtain because of mathematical complications. As a result, choice of estimator in practice has been largely arbitrary. In this paper, we present a systematic study on major target estimators reported in the literature. Focus is on comparisons between the traditional angle method, the line method, and a recently developed line-to-point transformation method. Insights gained from the study directly lead to the development of a novel two-stage angle method that not only produces highly accurate target estimation among all known estimators but is also computationally efficient. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 353–364, 1998 相似文献
112.
We consider server scheduling on parallel dedicated machines to minimize the makespan. Each job has a loading operation and a processing operation. The loading operation requires a server that serves all the jobs. Each machine has a given set of jobs to process, and the processing sequence is known and fixed. We design a polynomial‐time algorithm to solve the two‐machine case of the problem. When the number of machines is arbitrary, the problem becomes strongly NP‐hard even if all the jobs have the same processing length or all the loading operations require a unit time. We design two heuristic algorithms to treat the case where all the loading times are unit and analyze their performance. 相似文献
113.
用无人机担任僚机已成为战斗机编组作战领域技战术研究的新热点。本文通过跟踪美国“忠诚僚机”项目的试验进展,了解所用无人僚机和战斗机平台的性能及特点,把握长僚机编组作战对无人僚机的基本指标需求。在此基础上,结合美军分布式作战概念的演变、智能空战技术研究和现有装备改装趋势等因素,分析了“忠诚僚机”项目在推进空中分布式作战概念实用化、提高长僚机编组作战效能以及形成规模化无人僚机装备方面可能产生的影响。基于上述分析,得出无人僚机与有人战斗机编组作战是军队需要面对的新型作战样式这一结论,并结合国内空战理论研究、军用无人机制造能力以及反无人机装备的发展情况,给出整合资源发展优势无人机、以硬杀伤和软杀伤多种形式构建有效反制体系的对策建议。 相似文献
114.
We consider a processing network in which jobs arrive at a fork‐node according to a renewal process. Each job requires the completion of m tasks, which are instantaneously assigned by the fork‐node to m task‐processing nodes that operate like G/M/1 queueing stations. The job is completed when all of its m tasks are finished. The sojourn time (or response time) of a job in this G/M/1 fork‐join network is the total time it takes to complete the m tasks. Our main result is a closed‐form approximation of the sojourn‐time distribution of a job that arrives in equilibrium. This is obtained by the use of bounds, properties of D/M/1 and M/M/1 fork‐join networks, and exploratory simulations. Statistical tests show that our approximation distributions are good fits for the sojourn‐time distributions obtained from simulations. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008 相似文献
115.
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 相似文献
116.
117.
蒸汽动力装置分布式控制系统可靠性设计准则 总被引:3,自引:1,他引:2
讨论了为保证蒸汽动力装置分布式控制系统的可靠性所采取的一般技术 ,详细分析了提高蒸汽动力装置分布式控制系统可靠性的一般设计准则 ,包括系统设计的一般要求、计算机的选型、元器件的选择与使用以及抗干扰措施 相似文献
118.
采用计算燃烧学方法对火箭发动机非线性燃烧不稳定工作过程进行了并行数值模拟。气相控制方程组用欧拉坐标系下的Navier Stokes方程组描述 ,液相控制方程组在Lagrangian坐标系下进行描述。气、液两相作用通过方程组的源项互相耦合。编制了串行和并行程序 ,并在并行计算环境下进行了测试。从计算结果可以看出并行计算的效率较高。 相似文献
119.
在分析国外典型潜艇作战系统体系结构的基础上,针对基于VxWorks的嵌入式应用系统访问Oracle数据库问题,提出了一种基于中间件的跨平台数据库访问方案,解决了分布式异构系统下多用户并发访问数据库的问题;设计开发了基于CORBA的数据库访问中间件,并对中间件的实时性、并发性进行了测试。测试表明:该方案可以解决嵌入式应用系统对Oracle数据库的跨平台访问,并且性能指标满足应用需求。 相似文献
120.