全文获取类型
收费全文 | 126篇 |
免费 | 30篇 |
国内免费 | 7篇 |
出版年
2024年 | 2篇 |
2023年 | 3篇 |
2022年 | 2篇 |
2021年 | 2篇 |
2020年 | 5篇 |
2019年 | 2篇 |
2018年 | 6篇 |
2017年 | 15篇 |
2016年 | 13篇 |
2015年 | 1篇 |
2014年 | 7篇 |
2013年 | 12篇 |
2012年 | 12篇 |
2011年 | 8篇 |
2010年 | 8篇 |
2009年 | 12篇 |
2008年 | 8篇 |
2007年 | 8篇 |
2006年 | 9篇 |
2005年 | 8篇 |
2004年 | 2篇 |
2003年 | 2篇 |
2002年 | 2篇 |
2001年 | 5篇 |
2000年 | 4篇 |
1999年 | 1篇 |
1996年 | 1篇 |
1994年 | 1篇 |
1993年 | 1篇 |
1990年 | 1篇 |
排序方式: 共有163条查询结果,搜索用时 31 毫秒
81.
82.
基于二人有限零和对策的防空兵火力分配方法 总被引:1,自引:0,他引:1
为了优化防空作战过程中火力分配问题,使射击达到最佳效果,运用对策论、线性规划等理论方法,采用对策矩阵建立了防空火力分配的线性规划模型,并通过计算示例和计算机仿真初步预测了敌方的空袭兵器使用情况和我方相应的兵力分配对策。该模型建立的防空火力分配方法较好地满足了要地防空装备的战术应用问题,对提高作战效能具有一定的参考价值。 相似文献
83.
This paper deals with an inspection game of customs and a smuggler. The customs can take two options of assigning a patrol or not. The smuggler has two strategies of shipping its cargo of contraband or not. Two players have several opportunities to take actions during a limited number of days. When both players do, there are some possibilities that the customs captures the smuggler and, simultaneously, the smuggler possibly makes a success of the smuggling. If the smuggler is captured or there remain no days for playing the game, the game ends. In this paper, we formulate the problem into a multi‐stage two‐person zero‐sum stochastic game and investigate some characteristics of the equilibrium solution, some of which are given in a closed form in a special case. There have been some studies so far on the inspection game. However, some consider the case that the smuggler has only one opportunity of smuggling or the perfect‐capture case that the customs can certainly arrest the smuggler on patrol, and others think of a recursive game without the probabilities of fulfilling the players' purposes. In this paper, we consider the inspection game taking account of the fulfillment probabilities of the players' aims. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006 相似文献
84.
In this paper we study a capacity allocation problem for two firms, each of which has a local store and an online store. Customers may shift among the stores upon encountering a stockout. One question facing each firm is how to allocate its finite capacity (i.e., inventory) between its local and online stores. One firm's allocation affects the decision of the rival, thereby creating a strategic interaction. We consider two scenarios of a single‐product single‐period model and derive corresponding existence and stability conditions for a Nash equilibrium. We then conduct sensitivity analysis of the equilibrium solution with respect to price and cost parameters. We also prove the existence of a Nash equilibrium for a generalized model in which each firm has multiple local stores and a single online store. Finally, we extend the results to a multi‐period model in which each firm decides its total capacity and allocates this capacity between its local and online stores. A myopic solution is derived and shown to be a Nash equilibrium solution of a corresponding “sequential game.” © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006 相似文献
85.
Myerson 3 and 4 proposed and characterized a modification of the Shapley value in the context of communication situations. In this paper we propose several characterizations of the extension of the Banzhaf value proposed by Owen 7 to communication situations. In particular we characterize this value with the properties of fairness, isolation, and pairwise merging. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006 相似文献
86.
智能集群是指由大量智能体构成、采用自组织策略协作完成任务的群体。以无人车集群系统协同监视再入体着靶过程为任务背景,开展智能集群自组织策略的关键技术研究。设计了无人车集群执行再入体着靶协同监视的集群行为模式,提出了基于合作博弈的智能集群自组织策略,各智能体以实现群体聚集为“合作目标”,以降低自身能量消耗为“竞争目标”,开展博弈,基于微粒群算法规划局部路径,最终使群体系统涌现出聚集行为。仿真实验验证了设计的自主聚集策略的有效性。 相似文献
87.
Non‐zero‐sum nonlinear network path interdiction with an application to inspection in terror networks
下载免费PDF全文
![点击此处可从《海军后勤学研究》网站下载免费的PDF全文](/ch/ext_images/free.gif)
Noam Goldberg 《海军后勤学研究》2017,64(2):139-153
A simultaneous non‐zero‐sum game is modeled to extend the classical network interdiction problem. In this model, an interdictor (e.g., an enforcement agent) decides how much of an inspection resource to spend along each arc in the network to capture a smuggler. The smuggler (randomly) selects a commodity to smuggle—a source and destination pair of nodes, and also a corresponding path for traveling between the given pair of nodes. This model is motivated by a terrorist organization that can mobilize its human, financial, or weapon resources to carry out an attack at one of several potential target destinations. The probability of evading each of the network arcs nonlinearly decreases in the amount of resource that the interdictor spends on its inspection. We show that under reasonable assumptions with respect to the evasion probability functions, (approximate) Nash equilibria of this game can be determined in polynomial time; depending on whether the evasion functions are exponential or general logarithmically‐convex functions, exact Nash equilibria or approximate Nash equilibria, respectively, are computed. © 2017 Wiley Periodicals, Inc. Naval Research Logistics 64: 139–153, 2017 相似文献
88.
When an unreliable supplier serves multiple retailers, the retailers may compete with each other by inflating their order quantities in order to obtain their desired allocation from the supplier, a behavior known as the rationing game. We introduce capacity information sharing and a capacity reservation mechanism in the rationing game and show that a Nash equilibrium always exists. Moreover, we provide conditions guaranteeing the existence of the reverse bullwhip effect upstream, a consequence of the disruption caused by the supplier. In contrast, we also provide conditions under which the bullwhip effect does not exist. In addition, we show that a smaller unit reservation payment leads to more bullwhip and reverse bullwhip effects, while a large unit underage cost results in a more severe bullwhip effect. © 2017 Wiley Periodicals, Inc. Naval Research Logistics 64: 203–216, 2017 相似文献
89.
Alan Washburn 《海军后勤学研究》2001,48(4):270-280
Gass, Zafra, and Qiu (1996) introduce a modified version of fictitious play for matrix games where only the more successful player's strategy is retained. This paper introduces additional modifications that appear to converge faster. © 2001 John Wiley & Sons, Inc.* Naval Research Logistics 48: 270–280, 2001 相似文献
90.
This article deals with a two‐person zero‐sum game in which player I chooses in integer interval [1, N] two integer intervals consisting of p and q points where p + q < N, and player II chooses an integer point in [1, N]. The payoff to player I equals 1 if the point chosen by player II is at least in one of the intervals chosen by player II and 0 otherwise. This paper complements the results obtained by Ruckle, Baston and Bostock, Lee, Garnaev, and Zoroa, Zoroa and Fernández‐Sáez. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 98–106, 2001 相似文献