全文获取类型
收费全文 | 146篇 |
免费 | 55篇 |
国内免费 | 15篇 |
出版年
2023年 | 3篇 |
2022年 | 3篇 |
2021年 | 2篇 |
2020年 | 7篇 |
2019年 | 5篇 |
2018年 | 6篇 |
2017年 | 11篇 |
2016年 | 12篇 |
2015年 | 9篇 |
2014年 | 24篇 |
2013年 | 15篇 |
2012年 | 17篇 |
2011年 | 13篇 |
2010年 | 5篇 |
2009年 | 12篇 |
2008年 | 12篇 |
2007年 | 19篇 |
2006年 | 8篇 |
2005年 | 5篇 |
2004年 | 3篇 |
2003年 | 5篇 |
2002年 | 6篇 |
2001年 | 4篇 |
2000年 | 2篇 |
1999年 | 1篇 |
1998年 | 1篇 |
1995年 | 2篇 |
1993年 | 1篇 |
1991年 | 1篇 |
1989年 | 2篇 |
排序方式: 共有216条查询结果,搜索用时 15 毫秒
11.
12.
In this article, we discuss the optimal allocation problem in a multiple stress levels life‐testing experiment when an extreme value regression model is used for statistical analysis. We derive the maximum likelihood estimators, the Fisher information, and the asymptotic variance–covariance matrix of the maximum likelihood estimators. Three optimality criteria are defined and the optimal allocation of units for two‐ and k‐stress level situations are determined. We demonstrate the efficiency of the optimal allocation of units in a multiple stress levels life‐testing experiment by using real experimental situations discussed earlier by McCool and Nelson and Meeker. Monte Carlo simulations are used to show that the optimality results hold for small sample sizes as well. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2007 相似文献
13.
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 相似文献
14.
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 相似文献
15.
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 相似文献
16.
反舰导弹机动与导引配合的弹道设计研究 总被引:2,自引:0,他引:2
传统反舰导弹的末端机动与导引是分别进行的,这使得突防效果的提升受限。为了达到提高突防概率和实现高精度导引的双重目的,需要在导弹的末段实现机动与导引协同配合的设计。利用弹目之间的几何关系,规划设计了根据弹目实时连线进行自适应蛇行机动的程序参考信号。整个设计可以看作比例导引法与蛇行机动的复合,利用的信号包括实测的雷达方位角信号、弹目距离与预先设计好的时间指令。 相似文献
17.
区域防空导弹反导火力分配研究 总被引:1,自引:0,他引:1
分析了传统防空导弹火力分配模型的不足,考虑到编队内各舰艇近程防空作战能力的不同,结合装备性能特点,建立了基于机会约束规划的区域防空导弹火力分配优化模型。给出了基于遗传算法和BP神经网络的混合智能算法,该算法在精度和速度上均能满足防空作战的要求。 相似文献
18.
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. 相似文献
19.
20.
Eyal Pecht 《Defence and Peace Economics》2017,28(3):367-399
This study develops a dynamic model that integrates military intelligence into the defense capability of the country and the optimal allocation of its government budget. We assert that the effectiveness of the country’s military intelligence is contingent on the quality of its human capital, which, in turn, implies a long-term positive relationship between the government’s various civilian expenditures and its capacity to achieve a cost-effective intelligence and, hence, military capability. This relationship is developed within a multiple-period arms race model between two rivals. Using this model and stylized data for the Israeli–Syrian arms race, we show that an appropriate budget shift from defense to civilian expenditures during the initial periods of the planning horizon will gradually (over a decade, say) increase the quality of human capital in the country and, thus, the effectiveness of its intelligence, which, in turn, will increase the country’s future security and welfare. 相似文献