全文获取类型
收费全文 | 123篇 |
免费 | 51篇 |
国内免费 | 8篇 |
出版年
2023年 | 3篇 |
2022年 | 3篇 |
2021年 | 2篇 |
2020年 | 7篇 |
2019年 | 4篇 |
2018年 | 7篇 |
2017年 | 11篇 |
2016年 | 10篇 |
2015年 | 8篇 |
2014年 | 19篇 |
2013年 | 13篇 |
2012年 | 12篇 |
2011年 | 10篇 |
2010年 | 5篇 |
2009年 | 10篇 |
2008年 | 9篇 |
2007年 | 13篇 |
2006年 | 7篇 |
2005年 | 5篇 |
2004年 | 3篇 |
2003年 | 4篇 |
2002年 | 5篇 |
2001年 | 3篇 |
2000年 | 1篇 |
1999年 | 1篇 |
1998年 | 1篇 |
1995年 | 2篇 |
1993年 | 1篇 |
1991年 | 1篇 |
1989年 | 2篇 |
排序方式: 共有182条查询结果,搜索用时 453 毫秒
1.
Ryusuke Hohzaki 《海军后勤学研究》2008,55(1):76-90
This article deals with a two‐person zero‐sum game called a search allocation game (SAG), in which a searcher and a target participate as players. The searcher distributes his searching resources in a search space to detect the target. The effect of resources lasts a certain period of time and extends to some areas at a distance from the resources' dropped points. On the other hand, the target moves around in the search space to evade the searcher. In the history of search games, there has been little research covering the durability and reachability of searching resources. This article proposes two linear programming formulations to solve the SAG with durable and reachable resources, and at the same time provide an optimal strategy of distributing searching resources for the searcher and an optimal moving strategy for the target. Using examples, we will analyze the influences of two attributes of resources on optimal strategies. © 2007 Wiley Periodicals, Inc. Naval Research Logistics 2008 相似文献
2.
针对多无人机在执行侦察、打击任务的过程中携带任务资源的异构性,以及任务对于异构资源的要求,设计了一种改进的基于共识的捆绑算法(consensus-based bundle algorithm, CBBA)。考虑任务价值、任务执行时间窗以及航程代价等条件建立了多无人机对地目标侦察、打击任务分配模型。利用K-medoids聚类分析方法对多无人机进行基于距离和携带资源平衡的聚类,以解决多无人机对于异构资源类型的要求。对打击任务进行子任务生成,并利用改进后的CBBA求解所建立的任务分配模型,通过对比仿真实验验证了算法的可行性和有效性。 相似文献
3.
针对以常规母联开关互联的交流电网线路变压器容量无法合理利用的问题,提出了依靠由背靠背电压源变流器组成的新型大功率柔性互联装置实现两侧交流电网有功功率互济的协调控制方法。介绍了新型柔性互联装置的拓扑结构与基本的控制原理,为实现两侧线路变压器容量合理的目标制定了一种生成有功功率参考的方法,并基于PSCAD/EMTDC搭建了一套仿真算例,对新型柔性互联装置的基本控制与所提出的有功互济的协调控制方法进行了验证。仿真结果表明,在柔性互联装置采用所提方法时能够实现两侧交流线路的有功功率互济,解决了线路变压器容量无法合理分配的问题。 相似文献
4.
5.
A. Garnaev 《海军后勤学研究》2007,54(1):109-114
This paper deals with a two searchers game and it investigates the problem of how the possibility of finding a hidden object simultaneously by players influences their behavior. Namely, we consider the following two‐sided allocation non‐zero‐sum game on an integer interval [1,n]. Two teams (Player 1 and 2) want to find an immobile object (say, a treasure) hidden at one of n points. Each point i ∈ [1,n] is characterized by a detection parameter λi (μi) for Player 1 (Player 2) such that pi(1 ? exp(?λixi)) (pi(1 ? exp(?μiyi))) is the probability that Player 1 (Player 2) discovers the hidden object with amount of search effort xi (yi) applied at point i where pi ∈ (0,1) is the probability that the object is hidden at point i. Player 1 (Player 2) undertakes the search by allocating the total amount of effort X(Y). The payoff for Player 1 (Player 2) is 1 if he detects the object but his opponent does not. If both players detect the object they can share it proportionally and even can pay some share to an umpire who takes care that the players do not cheat each other, namely Player 1 gets q1 and Player 2 gets q2 where q1 + q2 ≤ 1. The Nash equilibrium of this game is found and numerical examples are given. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2007 相似文献
6.
In this paper we consider the capacitated multi‐facility Weber problem with the Euclidean, squared Euclidean, and ?p‐distances. This problem is concerned with locating m capacitated facilities in the Euclidean plane to satisfy the demand of n customers with the minimum total transportation cost. The demand and location of each customer are known a priori and the transportation cost between customers and facilities is proportional to the distance between them. We first present a mixed integer linear programming approximation of the problem. We then propose new heuristic solution methods based on this approximation. Computational results on benchmark instances indicate that the new methods are both accurate and efficient. © 2006 Wiley Periodicals, Inc. Naval Research Logistics 2006 相似文献
7.
Analytical resolution of search theory problems, as formalized by B.O. Koopman, may be applied with some model extension to various resource management issues. However, a fundamental prerequisite is the knowledge of the prior target density. Though this assumption has the definite advantage of simplicity, its drawback is clearly that target reactivity is not taken into account. As a preliminary step towards reactive target study stands the problem of resource planning under a min–max game context. This paper is related to Nakai's work about the game planning of resources for the detection of a stationary target. However, this initial problem is extended by adding new and more general constraints, allowing a more realistic modeling of the target and searcher behaviors. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007 相似文献
8.
区域防空导弹反导火力分配研究 总被引:1,自引:0,他引:1
分析了传统防空导弹火力分配模型的不足,考虑到编队内各舰艇近程防空作战能力的不同,结合装备性能特点,建立了基于机会约束规划的区域防空导弹火力分配优化模型。给出了基于遗传算法和BP神经网络的混合智能算法,该算法在精度和速度上均能满足防空作战的要求。 相似文献
9.
We study a setting with a single type of resource and with several players, each associated with a single resource (of this type). Unavailability of these resources comes unexpectedly and with player‐specific costs. Players can cooperate by reallocating the available resources to the ones that need the resources most and let those who suffer the least absorb all the costs. We address the cost savings allocation problem with concepts of cooperative game theory. In particular, we formulate a probabilistic resource pooling game and study them on various properties. We show that these games are not necessarily convex, do have non‐empty cores, and are totally balanced. The latter two are shown via an interesting relationship with Böhm‐Bawerk horse market games. Next, we present an intuitive class of allocation rules for which the resulting allocations are core members and study an allocation rule within this class of allocation rules with an appealing fairness property. Finally, we show that our results can be applied to a spare parts pooling situation. 相似文献
10.