全文获取类型
收费全文 | 848篇 |
免费 | 326篇 |
国内免费 | 108篇 |
出版年
2024年 | 2篇 |
2023年 | 18篇 |
2022年 | 9篇 |
2021年 | 22篇 |
2020年 | 33篇 |
2019年 | 18篇 |
2018年 | 11篇 |
2017年 | 66篇 |
2016年 | 76篇 |
2015年 | 57篇 |
2014年 | 67篇 |
2013年 | 59篇 |
2012年 | 88篇 |
2011年 | 69篇 |
2010年 | 55篇 |
2009年 | 93篇 |
2008年 | 63篇 |
2007年 | 67篇 |
2006年 | 75篇 |
2005年 | 48篇 |
2004年 | 50篇 |
2003年 | 33篇 |
2002年 | 37篇 |
2001年 | 30篇 |
2000年 | 24篇 |
1999年 | 21篇 |
1998年 | 18篇 |
1997年 | 16篇 |
1996年 | 13篇 |
1995年 | 8篇 |
1994年 | 10篇 |
1993年 | 9篇 |
1992年 | 3篇 |
1991年 | 1篇 |
1990年 | 10篇 |
1989年 | 2篇 |
1988年 | 1篇 |
排序方式: 共有1282条查询结果,搜索用时 31 毫秒
111.
112.
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 相似文献
113.
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 相似文献
114.
115.
116.
In this paper we present a new combinatorial problem, called minmax multidimensional knapsack problem (MKP), motivated by a military logistics problem. The logistics problem is a two‐period, two‐level, chance‐constrained problem with recourse. We show that the MKP is NP‐hard and develop a practically efficient combinatorial algorithm for solving it. We also show that under some reasonable assumptions regarding the operational setting of the logistics problem, the chance‐constrained optimization problem is decomposable into a series of MKPs that are solved separately. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007 相似文献
117.
118.
探讨了无人飞行器(UAV)编队的任务分配问题。任务分配是UAV协同控制的基础,其解是任务区域内各任务的一个排列。求解UAV任务分配问题的有效方法是能在合理的计算时间内找到近似最优解的启发式算法。用对称群描述UAV任务分配的搜索空间,基于右乘运算构造搜索邻域。仿真结果验证了群论禁忌搜索算法的有效性。 相似文献
119.
针对球约束凸二次规划问题,利用Lagrange对偶将其转化为无约束优化问题,然后运用单纯形法对其求解,获得原问题的最优解。最后,对文中给出的算法给出了论证。 相似文献
120.
针对非线性非高斯导航系统信息处理问题,采用自组织算法、神经网络和遗传算法等改进传统非线性Kalman滤波算法,构建一种自适应的组合导航系统。应用具有冗余趋势项的自组织算法、Volterra神经网络和遗传算法,建立导航系统误差的非线性预测模型,进而计算得到其预测值;将该预测值与Kalman滤波算法求得的估计值进行比较得到差值,以此监测Kalman滤波算法的工作状态;采用自适应控制方法,在导航系统结构层面改进Kalman滤波算法,构建新型的导航系统误差补偿模型。开展基于导航系统KIND-34的半实物仿真研究,应用所提出的改进方法改善了导航系统误差的补偿效果,提高了组合导航系统的自适应能力和容错能力。 相似文献