全文获取类型
收费全文 | 196篇 |
免费 | 71篇 |
国内免费 | 18篇 |
出版年
2023年 | 2篇 |
2022年 | 3篇 |
2021年 | 1篇 |
2020年 | 4篇 |
2018年 | 2篇 |
2017年 | 10篇 |
2016年 | 16篇 |
2015年 | 17篇 |
2014年 | 14篇 |
2013年 | 12篇 |
2012年 | 12篇 |
2011年 | 17篇 |
2010年 | 15篇 |
2009年 | 18篇 |
2008年 | 13篇 |
2007年 | 17篇 |
2006年 | 19篇 |
2005年 | 16篇 |
2004年 | 7篇 |
2003年 | 7篇 |
2002年 | 7篇 |
2001年 | 12篇 |
2000年 | 8篇 |
1999年 | 6篇 |
1998年 | 8篇 |
1997年 | 5篇 |
1996年 | 3篇 |
1995年 | 3篇 |
1994年 | 3篇 |
1993年 | 1篇 |
1992年 | 1篇 |
1991年 | 2篇 |
1990年 | 1篇 |
1989年 | 2篇 |
1988年 | 1篇 |
排序方式: 共有285条查询结果,搜索用时 15 毫秒
21.
针对脉冲雷达近距离目标遮挡问题,从理论上分析了雷达最小作用距离不受限于脉冲宽度.在此基础上,以Chirp脉冲为例,提出了一种适合远近距离全程目标的快速搜索处理算法.该算法只需发射一种宽脉冲波形,而不必根据距离的变化改变脉宽,从而有效缩短了搜索时间,大大提高了搜索效率.仿真结果表明了理论分析的正确性和算法的有效性. 相似文献
22.
简要介绍了某型无人机维修级别分析中的组合方案法 ,针对传统分析法中设备占用率采用经验值 ,造成可信度低的问题 ,提出了一种基于不同故障模式发生时的条件概率求解设备占用率的算法 ,并给出了这种算法的适用范围。 相似文献
23.
使用对策论的观点和方法 ,结合搜索论的知识 ,建立了一类搜索 -规避对抗对策模型 .对模型的结论做了系统分析 ,考虑了对策双方的最优策略及使用 . 相似文献
24.
介绍了一种基于模糊集合和神经网络的水雷状态识别方法 .该方法根据实际情况 ,将模糊集合和径向基函数神经网络结合起来 ,用于水雷状态的识别 .仿真结果表明 ,这种识别方法性能稳定 ,且有很高的识别精度 . 相似文献
25.
机载红外搜索跟踪系统 总被引:2,自引:0,他引:2
红外搜索和跟踪(IRST) 系统是迅速探测红外威胁源的存在, 识别威胁源的种类,测定威胁源的方位并报警的一种光电系统。介绍了对机载IRST的性能要求, 美国和欧洲等国对机载IRST的研制及装备概况, 分析了今后机载IRST系统的发展方向。 相似文献
26.
This article introduces the use of Benders' cuts to guide a large neighborhood search to solve the traveling umpire problem, a sports scheduling problem inspired by the real‐life needs of the officials of a sports league. At each time slot, a greedy matching heuristic is used to construct a schedule. When an infeasibility is recognized first a single step backtracking is tried to resolve the infeasibility. If unsuccessful, Benders' cuts are generated to guide a large neighborhood search to ensure feasibility and to improve the solution. Realizing the inherent symmetry present in the problem, a large family of cuts are generated and their effectiveness is tested. The resulting approach is able to find better solutions to many instances of this problem. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011 相似文献
27.
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 相似文献
28.
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 相似文献
29.
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 相似文献
30.
姬玉珊 《中国人民武装警察部队学院学报》2007,23(5):45-48,73
思维方式是文化的集中体现,又与语言密切相关。英语段落体现了英语语言的思维模式。具体表现为文章的观点通常以命题句的形式呈现在文章的开头。体现英语语言的思维模式主要是修辞模式的线形结构。英语语言的基本思维模式或者修辞模式要求文章的行文要按照命题句所规定的各个要素呈线型发展。因此,掌握英语的段落修辞模式是掌握英语语言的基础。 相似文献