全文获取类型
收费全文 | 440篇 |
免费 | 236篇 |
国内免费 | 57篇 |
出版年
2024年 | 2篇 |
2023年 | 1篇 |
2022年 | 3篇 |
2021年 | 10篇 |
2020年 | 7篇 |
2019年 | 10篇 |
2018年 | 5篇 |
2017年 | 34篇 |
2016年 | 53篇 |
2015年 | 31篇 |
2014年 | 54篇 |
2013年 | 56篇 |
2012年 | 40篇 |
2011年 | 46篇 |
2010年 | 27篇 |
2009年 | 37篇 |
2008年 | 19篇 |
2007年 | 35篇 |
2006年 | 28篇 |
2005年 | 24篇 |
2004年 | 27篇 |
2003年 | 15篇 |
2002年 | 16篇 |
2001年 | 23篇 |
2000年 | 18篇 |
1999年 | 10篇 |
1998年 | 11篇 |
1997年 | 11篇 |
1996年 | 13篇 |
1995年 | 9篇 |
1994年 | 21篇 |
1993年 | 14篇 |
1992年 | 8篇 |
1991年 | 7篇 |
1990年 | 2篇 |
1989年 | 3篇 |
1988年 | 1篇 |
1987年 | 1篇 |
1975年 | 1篇 |
排序方式: 共有733条查询结果,搜索用时 156 毫秒
71.
72.
73.
Pirja Heiskanen 《海军后勤学研究》2001,48(3):210-225
In this paper a constraint proposal method is developed for computing Pareto‐optimal solutions in multiparty negotiations over continuous issues. Constraint proposal methods have been previously studied in a case where the decision set is unconstrained. Here we extend the method to situations with a constrained decision set. In the method the computation of the Pareto‐optimal solutions is decentralized so that the DMs do not have to know each others' value functions. During the procedure they have to indicate their optimal solutions on different sets of linear constraints. When the optimal solutions coincide, the common optimum is a candidate for a Pareto‐optimal point. The constraint proposal method can be used to generate either one Pareto‐optimal solution dominating the status quo solution or several Pareto‐optimal solutions. In latter case a distributive negotiation among the efficient points can be carried out afterwards. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 210–225, 2001 相似文献
74.
后方油库整体生存概率分析计算 总被引:1,自引:1,他引:0
针对我军后方油库特点,探讨了油库整体生存概率计算的基本思路和方法,分析了各类分项目标生存概率的计算方法,采用层次分析对后方油库各分项目标权值进行了详细分析计算,可为后方油库伪装防护效能评估提供依据。 相似文献
75.
调频连续波具有较长的脉宽和较大的信号带宽,通常采用去调频的处理方式,但是,去调频的处理会引入空变的相位误差。从去调频的处理方式入手,根据发射信号相位误差缓变的特点,提出了依据发射信号相位误差模型补偿空变相位误差的方法,并在理论上对该方法进行了推导。该补偿方法分为两步,从差频信号中去除发射信号相位误差,在残余视频相位误差校正之后,通过与补偿函数相乘去除剩余的相位误差。仿真和实测的实验结果表明,该方法能够克服目标距离的限制,有效地补偿空变相位误差带来的影响,提高脉压水平。提出的误差补偿方法能够很好地平衡系统负载、误差补偿精度和算法开销,具有较强实用性。 相似文献
76.
Fangruo Chen 《海军后勤学研究》2000,47(5):422-439
Consider a distribution system with a central warehouse and multiple retailers. Customer demand arrives at each of the retailers continuously at a constant rate. The retailers replenish their inventories from the warehouse which in turn orders from an outside supplier with unlimited stock. There are economies of scale in replenishing the inventories at both the warehouse and the retail level. Stockouts at the retailers are backlogged. The system incurs holding and backorder costs. The objective is to minimize the long‐run average total cost in the system. This paper studies the cost effectiveness of (R, Q) policies in the above system. Under an (R, Q) policy, each facility orders a fixed quantity Q from its supplier every time its inventory position reaches a reorder point R. It is shown that (R, Q) policies are at least 76% effective. Numerical examples are provided to further illustrate the cost effectiveness of (R, Q) policies. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 422–439, 2000 相似文献
77.
In this paper, two different kinds of (N, T)‐policies for an M/M/m queueing system are studied. The system operates only intermittently and is shut down when no customers are present any more. A fixed setup cost of K > 0 is incurred each time the system is reopened. Also, a holding cost of h > 0 per unit time is incurred for each customer present. The two (N, T)‐policies studied for this queueing system with cost structures are as follows: (1) The system is reactivated as soon as N customers are present or the waiting time of the leading customer reaches a predefined time T, and (2) the system is reactivated as soon as N customers are present or the time units after the end of the last busy period reaches a predefined time T. The equations satisfied by the optimal policy (N*, T*) for minimizing the long‐run average cost per unit time in both cases are obtained. Particularly, we obtain the explicit optimal joint policy (N*, T*) and optimal objective value for the case of a single server, the explicit optimal policy N* and optimal objective value for the case of multiple servers when only predefined customers number N is measured, and the explicit optimal policy T* and optimal objective value for the case of multiple servers when only predefined time units T is measured, respectively. These results partly extend (1) the classic N or T policy to a more practical (N, T)‐policy and (2) the conclusions obtained for single server system to a system consisting of m (m ≥ 1) servers. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 240–258, 2000 相似文献
78.
在卫星星间测距模拟信号仿真及实际测试中,为提高测距模拟信号精度和系统可用带宽,提出基于边界拟合Remez算法的高精度分数时延滤波器的设计算法。该算法利用Farrow结构的多项式近似思想,采用多项式拟合Remez算法设计滤波器的冲激响应边界系数,通过多相分解实现分数时延滤波器组。该算法改善了当设计的滤波器阶数较高时冲激响应边界的不连续现象,进而降低了群时延误差,提高了精度。仿真结果表明,该算法设计的滤波器的分数时延精度得到了提高,同时系统可用带宽提高近一倍,实现时需使用的乘法器数目也有明显降低。 相似文献
79.
80.
改进的蚁群算法及其在卫星网络路由计算中的应用 总被引:1,自引:1,他引:0
介绍了蚁群算法的原理,然后对现有蚁群算法进行了一些改进,使它能够快速地收敛以满足高速变化的卫星网络拓扑结构.采用改进的虚拟拓扑策略解决了卫星网络拓扑高速变换的问题,将改进的蚁群算法应用于其上,并给出了相应的性能评估.所提出的改进的虚拟拓扑策略,能够大大减少一个系统周期内卫星网的时间片个数.应用于此基础上的改进的蚁群算法也体现了较好的性能. 相似文献