全文获取类型
收费全文 | 658篇 |
免费 | 150篇 |
国内免费 | 20篇 |
出版年
2024年 | 1篇 |
2023年 | 4篇 |
2022年 | 6篇 |
2021年 | 11篇 |
2020年 | 14篇 |
2019年 | 32篇 |
2018年 | 17篇 |
2017年 | 53篇 |
2016年 | 50篇 |
2015年 | 38篇 |
2014年 | 44篇 |
2013年 | 107篇 |
2012年 | 37篇 |
2011年 | 43篇 |
2010年 | 40篇 |
2009年 | 41篇 |
2008年 | 33篇 |
2007年 | 48篇 |
2006年 | 34篇 |
2005年 | 29篇 |
2004年 | 33篇 |
2003年 | 19篇 |
2002年 | 22篇 |
2001年 | 20篇 |
2000年 | 21篇 |
1999年 | 7篇 |
1998年 | 5篇 |
1997年 | 4篇 |
1996年 | 4篇 |
1995年 | 4篇 |
1994年 | 1篇 |
1993年 | 2篇 |
1992年 | 1篇 |
1990年 | 2篇 |
1988年 | 1篇 |
排序方式: 共有828条查询结果,搜索用时 0 毫秒
601.
单一来源装备采办下定价策略的博弈分析 总被引:1,自引:1,他引:0
单一来源装备采办下,由于供应商在装备的定价与装备的升级改造上都存在 相对的比较优势,军方引入渐进式采办来改变自身的不利地位 应用博弈论的观点来对单 一来源装备采办下军方与供应商定价问题进行比较,实现了对单一来源装备采办与竞争策 略下各自收益分析,并用不定次重复博弈对渐进式采办进行了定量分析,对在实际采办过程 中如何实现激励合同和防止腐败问题也进行了理论上的论述。 相似文献
602.
P. Patrick Wang 《海军后勤学研究》2000,47(5):440-454
We study discrete‐time, parallel queues with two identical servers. Customers arrive randomly at the system and join the queue with the shortest workload that is defined as the total service time required for the server to complete all the customers in the queue. The arrivals are assumed to follow a geometric distribution and the service times are assumed to have a general distribution. It is a no‐jockeying queue. The two‐dimensional state space is truncated into a banded array. The resulting modified queue is studied using the method of probability generating function (pgf) The workload distribution in steady state is obtained in form of pgf. A special case where the service time is a deterministic constant is further investigated. Numerical examples are illustrated. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 440–454, 2000 相似文献
603.
604.
前苏联发展反卫星武器的回顾 总被引:3,自引:0,他引:3
随着军用卫星的种类变化和性能提高 ,以及为谋求外层空间作战的军事优势 ,前苏联一直在积极发展反卫星武器。介绍了前苏联反卫星武器的组成、特点、技术方案及其发展情况 ,最后归纳了关于前苏联反卫星武器的几点看法。 相似文献
605.
This paper examines the discrete equal‐capacity p‐median problem that seeks to locate p new facilities (medians) on a network, each having a given uniform capacity, in order to minimize the sum of distribution costs while satisfying the demand on the network. Such problems arise, for example, in local access and transport area telecommunication network design problems where any number of a set of p facility units can be constructed at the specified candidate sites (hence, the net capacity is an integer multiple of a given unit capacity). We develop various valid inequalities, a separation routine for generating cutting planes that are specific members of such inequalities, as well as an enhanced reformulation that constructs a partial convex hull representation that subsumes an entire class of valid inequalities via its linear programming relaxation. We also propose suitable heuristic schemes for this problem, based on sequentially rounding the continuous relaxation solutions obtained for the various equivalent formulations of the problem. Extensive computational results are provided to demonstrate the effectiveness of the proposed valid inequalities, enhanced formulations, and heuristic schemes. The results indicate that the proposed schemes for tightening the underlying relaxations play a significant role in enhancing the performance of both exact and heuristic solution methods for this class of problems. © 2000 John & Sons, Inc. Naval Research Logistics 47: 166–183, 2000. 相似文献
606.
A classic problem in Search Theory is one in which a searcher allocates resources to the points of the integer interval [1, n] in an attempt to find an object which has been hidden in them using a known probability function. In this paper we consider a modification of this problem in which there is a protector who can also allocate resources to the points; allocating these resources makes it more difficult for the searcher to find an object. We model the situation as a two‐person non‐zero‐sum game so that we can take into account the fact that using resources can be costly. It is shown that this game has a unique Nash equilibrium when the searcher's probability of finding an object located at point i is of the form (1 − exp (−λixi)) exp (−μiyi) when the searcher and protector allocate resources xi and yi respectively to point i. An algorithm to find this Nash equilibrium is given. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47:85–96, 2000 相似文献
607.
608.
609.
石梅 《兵团教育学院学报》2009,19(4):77-79
自主学习是语言学习的关键,学生是否能够学好外语取决于自主学习能力的培养。本文阐述了自主学习的理论基础及使用价值,如何培养学生自主学习的能力,更多关注学习方法的相互作用。 相似文献
610.
两人多冲突环境下的双矩阵对策集结模型 总被引:3,自引:1,他引:2
针对用多个双矩阵对策来描述的两人多冲突环境,首先基于局中人所受到的约束条件,构造局中人面向多冲突环境的可行策略串集合;其次以所有局中人的可行策略串集合建立新的结局空间,构造局中人在新结局空间上的支付函数,进而建立两人多冲突环境下的对策综合集结模型;最后给出了一个军事例子,该算例说明了模型的实用性. 相似文献