全文获取类型
收费全文 | 567篇 |
免费 | 252篇 |
国内免费 | 46篇 |
出版年
2024年 | 6篇 |
2023年 | 10篇 |
2022年 | 6篇 |
2021年 | 14篇 |
2020年 | 11篇 |
2019年 | 15篇 |
2018年 | 7篇 |
2017年 | 26篇 |
2016年 | 24篇 |
2015年 | 23篇 |
2014年 | 43篇 |
2013年 | 38篇 |
2012年 | 42篇 |
2011年 | 57篇 |
2010年 | 39篇 |
2009年 | 42篇 |
2008年 | 29篇 |
2007年 | 45篇 |
2006年 | 40篇 |
2005年 | 32篇 |
2004年 | 44篇 |
2003年 | 20篇 |
2002年 | 26篇 |
2001年 | 29篇 |
2000年 | 27篇 |
1999年 | 35篇 |
1998年 | 25篇 |
1997年 | 21篇 |
1996年 | 11篇 |
1995年 | 6篇 |
1994年 | 15篇 |
1993年 | 13篇 |
1992年 | 18篇 |
1991年 | 9篇 |
1990年 | 9篇 |
1989年 | 5篇 |
1988年 | 2篇 |
1987年 | 1篇 |
排序方式: 共有865条查询结果,搜索用时 15 毫秒
241.
Discrete‐time queues with D‐MAP arrival process are more useful in modeling and performance analysis of telecommunication networks based on the ATM environment. This paper analyzes a finite‐buffer discrete‐time queue with general bulk‐service rule, wherein the arrival process is D‐MAP and service times are arbitrarily and independently distributed. The distributions of buffer contents at various epochs (departure, random, and prearrival) have been obtained using imbedded Markov chain and supplementary variable methods. Finally, some performance measures such as loss probability and average delay are discussed. Numerical results are also presented in some cases. © 2003 Wiley Periodicals, Inc. Naval Research Logistics 50: 345–363, 2003. 相似文献
242.
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 相似文献
243.
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 相似文献
244.
245.
246.
数字化部队指挥网络系统效能评价模型 总被引:5,自引:0,他引:5
以结构熵理论为基础,分析数字化部队作战指挥信息网络系统组织结构对系统内信息流的影响,从信息的角度对系统组织结构的有序度进行评价,引入信息流的时效和质量的概念,建立定量评价系统结构有序度计算的时效质量模型,结合系统数据传输业务效能的评价方法,形成作战指挥信息网络系统整体综合效能的评价模型。最后辅以实例。 相似文献
247.
248.
燃气轮机的实时仿真及数据预处理 总被引:4,自引:2,他引:2
讨论了燃气轮机实时仿真及相应的数据预处理方法 ,利用容积惯性法建立了某型燃气轮机的实时仿真模型 ,在 5 86PC实现了超实时仿真 ,仿真结果和试验数据相符 相似文献
249.
从信息管理系统的模式出发,分析了系统的结构模式,并对由此产生的并发控制问题,应用时间戳法进行了分析处理,用触发器存储过程解决了对数据的随时更新问题。本系统以Sybase作为数据库,设计并实现了药库管理系统。 相似文献
250.
相位差变化率是最近提出的用于快速无源定位的观测量。该文研究相位差的高精度测量方法 ,提出了一种正交双通道数字式的相位差测量方法。通过对信号频谱的分析 ,计算了测量系统输出的信噪比 ,从而得出了相位差测量的理论精度 ,随后进行仿真分析验证了理论精度。理论分析和仿真实验证明 ,论文提出的方法可以实现高精度的相位差测量 相似文献