全文获取类型
收费全文 | 220篇 |
免费 | 40篇 |
国内免费 | 12篇 |
出版年
2023年 | 2篇 |
2022年 | 6篇 |
2021年 | 2篇 |
2020年 | 4篇 |
2019年 | 4篇 |
2018年 | 7篇 |
2017年 | 15篇 |
2016年 | 21篇 |
2015年 | 6篇 |
2014年 | 33篇 |
2013年 | 26篇 |
2012年 | 11篇 |
2011年 | 16篇 |
2010年 | 17篇 |
2009年 | 15篇 |
2008年 | 17篇 |
2007年 | 13篇 |
2006年 | 12篇 |
2005年 | 11篇 |
2004年 | 6篇 |
2003年 | 8篇 |
2002年 | 4篇 |
2001年 | 5篇 |
2000年 | 4篇 |
1998年 | 2篇 |
1997年 | 1篇 |
1995年 | 1篇 |
1993年 | 2篇 |
1991年 | 1篇 |
排序方式: 共有272条查询结果,搜索用时 15 毫秒
1.
2.
美国空军飞机战伤修理的发展及其对我们的启示 总被引:1,自引:0,他引:1
王立群 《军械工程学院学报》1995,(2)
论述了美国空军战伤修理在方针、组织、培训、战伤修理规程、备件及工具箱、设计、试验数据库、新技术开发和常用抢修技术等方面的发展。同时提出了我空军战伤修理在这些方面的发展建议。 相似文献
3.
提出了一种基于生成模型的人体行为识别方法。选取关键点轨迹的方向-大小描述符、轨迹形状描述符、外观描述符作为人体行为的特征;为了降低人体行为特征维数,利用信息瓶颈算法进行词表压缩;利用生成模型,结合已标记样本和未标记样本提出了一种人体行为识别的半监督学习方法,解决了行为识别中的小样本问题。在YouTube 数据库、 UCF运动数据库上利用提出的方法与已有的方法进行了对比实验,结果表明该方法具有更高的识别精度。 相似文献
4.
针对多无人机在执行侦察、打击任务的过程中携带任务资源的异构性,以及任务对于异构资源的要求,设计了一种改进的基于共识的捆绑算法(consensus-based bundle algorithm, CBBA)。考虑任务价值、任务执行时间窗以及航程代价等条件建立了多无人机对地目标侦察、打击任务分配模型。利用K-medoids聚类分析方法对多无人机进行基于距离和携带资源平衡的聚类,以解决多无人机对于异构资源类型的要求。对打击任务进行子任务生成,并利用改进后的CBBA求解所建立的任务分配模型,通过对比仿真实验验证了算法的可行性和有效性。 相似文献
5.
A genetic algorithm with neighborhood search for the resource‐constrained project scheduling problem
The resource‐constrained project scheduling problem (RCPSP) consists of a set of non‐preemptive activities that follow precedence relationship and consume resources. Under the limited amount of the resources, the objective of RCPSP is to find a schedule of the activities to minimize the project makespan. This article presents a new genetic algorithm (GA) by incorporating a local search strategy in GA operators. The local search strategy improves the efficiency of searching the solution space while keeping the randomness of the GA approach. Extensive numerical experiments show that the proposed GA with neighborhood search works well regarding solution quality and computational time compared with existing algorithms in the RCPSP literature, especially for the instances with a large number of activities. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011 相似文献
6.
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 相似文献
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.
协同制造作为一种先进制造模式,逐渐成为研究的热点。而系统的可靠性是协同制造系统成功实施的关键因素之一。从协同制造系统的自身特点出发,阐述了进行协同制造系统可靠性研究的必要性和紧迫性。并给出了协同制造系统可靠性分析的框架模型,认为协同制造系统可靠性应该从人、工作流系统和设备硬件等几个方面进行综合研究,并对各部分的可靠性研究进行了概述。 相似文献
9.
Many cooperative games, especially ones stemming from resource pooling in queueing or inventory systems, are based on situations in which each player is associated with a single attribute (a real number representing, say, a demand) and in which the cost to optimally serve any sum of attributes is described by an elastic function (which means that the per‐demand cost is non‐increasing in the total demand served). For this class of situations, we introduce and analyze several cost allocation rules: the proportional rule, the serial cost sharing rule, the benefit‐proportional rule, and various Shapley‐esque rules. We study their appeal with regard to fairness criteria such as coalitional rationality, benefit ordering, and relaxations thereof. After showing the impossibility of combining coalitional rationality and benefit ordering, we show for each of the cost allocation rules which fairness criteria it satisfies. © 2017 Wiley Periodicals, Inc. Naval Research Logistics 64: 271–286, 2017 相似文献
10.
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. 相似文献