首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   151篇
  免费   35篇
  国内免费   10篇
  2024年   2篇
  2023年   3篇
  2022年   2篇
  2021年   2篇
  2020年   5篇
  2019年   2篇
  2018年   6篇
  2017年   17篇
  2016年   18篇
  2015年   4篇
  2014年   10篇
  2013年   12篇
  2012年   14篇
  2011年   10篇
  2010年   8篇
  2009年   14篇
  2008年   10篇
  2007年   11篇
  2006年   11篇
  2005年   11篇
  2004年   2篇
  2003年   3篇
  2002年   2篇
  2001年   5篇
  2000年   4篇
  1999年   2篇
  1998年   1篇
  1996年   1篇
  1994年   1篇
  1993年   2篇
  1990年   1篇
排序方式: 共有196条查询结果,搜索用时 15 毫秒
171.
Consider a distributed system where many gatekeepers share a single server. Customers arrive at each gatekeeper according to independent Poisson processes with different rates. Upon arrival of a new customer, the gatekeeper has to decide whether to admit the customer by sending it to the server, or to block it. Blocking costs nothing. The gatekeeper receives a reward after a customer completes the service, and incurs a cost if an admitted customer finds a busy server and therefore has to leave the system. Assuming an exponential service distribution, we formulate the problem as an n‐person non‐zero‐sum game in which each gatekeeper is interested in maximizing its own long‐run average reward. The key result is that each gatekeeper's optimal policy is that of a threshold type regardless what other gatekeepers do. We then derive Nash equilibria and discuss interesting insights. © 2003 Wiley Periodicals, Inc. Naval Research Logistics 50: 702–718, 2003.  相似文献   
172.
Two players are independently placed on a commonly labelled network X. They cannot see each other but wish to meet in least expected time. We consider continuous and discrete versions, in which they may move at unit speed or between adjacent distinct nodes, respectively. There are two versions of the problem (asymmetric or symmetric), depending on whether or not we allow the players to use different strategies. After obtaining some optimality conditions for general networks, we specialize to the interval and circle networks. In the first setting, we extend the work of J. V. Howard; in the second we prove a conjecture concerning the optimal symmetric strategy. © 2002 Wiley Periodicals, Inc. Naval Research Logistics 49: 256–274, 2002; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/nav.10011  相似文献   
173.
通过结合空降兵师(团)级登岛作战的战术特点,确立了遮断点的单点和联合价值的指标体系,建立了以联盟博弈为基础的兵力分配初步模型,然后以Shapley值作为此联盟博弈的解,结合投放过程中的兵力损耗,得到一个合理的兵力分配方案,从而建立了师(团)级空降登岛作战的兵力分配模型和算法.  相似文献   
174.
针对红外序列图像中运动弱小点目标的检测问题,重点研究序列关联检测算法.在多帧关联检测的基础上,引入决策融合概念,建立了基于模糊决策融合的序列关联检测方法.基于贝叶斯最小风险准则建立分布式决策模糊融合方法,有效融合单帧检测的结果,提高序列检测算法的性能.实测数据的实验结果验证了基于贝叶斯最小风险准则的分布式决策模糊融合方法的可行性和有效性.  相似文献   
175.
张先剑  杨乐平 《国防科技》2018,39(6):020-026
从技术与作战结合的角度,系统分析空天防御作战系统和对抗特点等问题,构建了"态势组态—目标排序—目标分配—冲突动态最优预测"新型作战规划方法,提出"博弈控制理论与方法",论述了空天防御作战规划方法论。对空天防御作战规划理论研究有一定参考价值,为发展空天防御作战规划系统提供了研究思路和技术支撑。  相似文献   
176.
We present a validation of a centralized feedback control law for robotic or partially robotic water craft whose task is to defend a harbor from an intruding fleet of water craft. Our work was motivated by the need to provide harbor defenses against hostile, possibly suicidal intruders, preferably using unmanned craft to limit potential casualties. Our feedback control law is a sample‐data receding horizon control law, which requires the solution of a complex max‐min problem at the start of each sample time. In developing this control law, we had to deal with three challenges. The first was to develop a max‐min problem that captures realistically the nature of the defense‐intrusion game. The second was to ensure the solution of this max‐min problem can be accomplished in a small fraction of the sample time that would be needed to control a possibly fast moving craft. The third, to which this article is dedicated, was to validate the effectiveness of our control law first through computer simulations pitting a computer against a computer or a computer against a human, then through the use of model hovercraft in a laboratory, and finally on the Chesapeake Bay, using Yard Patrol boats. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 247–259, 2016  相似文献   
177.
This paper examines the interaction between a growth-oriented terrorist organization and an uninformed government based on a two-period signalling game. Combining the signalling game and organizational growth approaches of previous contributions, this paper shows that, if a terrorist group follows a growth strategy, it has an incentive to appear weaker than it is by mimicking the behaviour of a smaller organization. Depending on its beliefs about the extent of the terrorist threat, it can be optimal for a government to spend more on second-period counter-terrorism measures if it is not attacked in the first period than if it were attacked.  相似文献   
178.
教学对话是教师、学生与文本之间实现的智识共享、双向理解和意义创生,达成多重视界的融合。教学中教师的独白、预设的问答以及片面的对话向我们展现的是遮蔽的教学对话。游戏与教学对话有着某种契合,游戏与教学对话的相融,教师、学生和文本之间达成智识共享、共同在场、意义的创生、全面的对话直至多重的视界相融,使教学对话真正走向本真之境。  相似文献   
179.
海军兵棋演习系统研究   总被引:1,自引:0,他引:1  
兵棋演习系统是我军未来开展模拟训练的重要手段,针对国内外对兵棋推演系统现状及技术发展趋势进行研究,提出海军兵棋演习系统的发展方向和设计方法,并结合海军兵棋推演的研究内容重点,给出作战规则建模、指挥关系建模等主要关键技术的解决方法,为我国海军未来兵棋推演系统设计、研究和发展提供技术支撑。  相似文献   
180.
利用集群搜索对策的理论与方法 ,建立了集群对固定目标的一类搜索对策模型 ,给出了集群的ε -最优搜寻策略 ,并考虑了其在搜索过程中的应用  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号