全文获取类型
收费全文 | 113篇 |
免费 | 35篇 |
国内免费 | 14篇 |
出版年
2023年 | 2篇 |
2022年 | 2篇 |
2021年 | 1篇 |
2020年 | 3篇 |
2018年 | 1篇 |
2017年 | 8篇 |
2016年 | 9篇 |
2015年 | 13篇 |
2014年 | 4篇 |
2013年 | 7篇 |
2012年 | 8篇 |
2011年 | 14篇 |
2010年 | 11篇 |
2009年 | 9篇 |
2008年 | 8篇 |
2007年 | 11篇 |
2006年 | 9篇 |
2005年 | 7篇 |
2004年 | 3篇 |
2003年 | 2篇 |
2002年 | 4篇 |
2001年 | 6篇 |
2000年 | 5篇 |
1999年 | 4篇 |
1998年 | 4篇 |
1997年 | 2篇 |
1996年 | 2篇 |
1994年 | 1篇 |
1990年 | 1篇 |
1988年 | 1篇 |
排序方式: 共有162条查询结果,搜索用时 78 毫秒
61.
62.
63.
This article considers the preventive flow interception problem (FIP) on a network. Given a directed network with known origin‐destination path flows, each generating a certain amount of risk, the preventive FIP consists of optimally locating m facilities on the network in order to maximize the total risk reduction. A greedy search heuristic as well as several variants of an ascent search heuristic and of a tabu search heuristic are presented for the FIP. Computational results indicate that the best versions of the latter heuristics consistently produce optimal or near optimal solutions on test problems. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 287–303, 2000 相似文献
64.
65.
66.
在机载红外搜索跟踪系统被动定位研究中,针对扩展卡尔曼滤波算法要求先验的噪声统计及存在系统观测模型线性化误差影响滤波精度的特点,利用两步滤波算法并结合Sage-Husa噪声估计器构建了适用于机载IRSTS被动定位特点的自适应两步滤波算法模型,算法不仅实时在线地估计了观测噪声的统计特性,而且避免了观测模型线性化误差.仿真结果表明,在完全相同的初始条件下,自适应两步滤波算法对目标运动参数的估计结果明显优于扩展卡尔曼滤波,从而提高了机载IRSTS被动定位的精度. 相似文献
67.
目标的规避过程与搜索运动 总被引:1,自引:1,他引:0
应用随机过程的观点,研究了静态目标和动态目标的几种规避方式、运动规律和目标位置的概率分布,导出了在上述几种情况下对规避目标的最优(理论)搜索计划。 相似文献
68.
搜索力最优配置的求解与收敛性分析 总被引:1,自引:0,他引:1
讨论了搜索线上搜索力(密度)的最优配置问题,给出了求解的算法。并对其收敛性作了证明。 相似文献
69.
Ryusuke Hohzaki 《海军后勤学研究》2007,54(1):46-58
This paper deals with a two‐person zero‐sum game called a search allocation game, where a searcher and a target participate, taking account of false contacts. The searcher distributes his search effort in a search space in order to detect the target. On the other hand, the target moves to avoid the searcher. As a payoff of the game, we take the cumulative amount of search effort weighted by the target distribution, which can be derived as an approximation of the detection probability of the target. The searcher's strategy is a plan of distributing search effort and the target's is a movement represented by a path or transition probability across the search space. In the search, there are false contacts caused by environmental noises, signal processing noises, or real objects resembling true targets. If they happen, the searcher must take some time for their investigation, which interrupts the search for a while. There have been few researches dealing with search games with false contacts. In this paper, we formulate the game into a mathematical programming problem to obtain its equilibrium point. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2007 相似文献
70.
In this paper, we study a m‐parallel machine scheduling problem with a non‐crossing constraint motivated by crane scheduling in ports. We decompose the problem to allow time allocations to be determined once crane assignments are known and construct a backtracking search scheme that manipulates domain reduction and pruning strategies. Simple approximation heuristics are developed, one of which guarantees solutions to be at most two times the optimum. For large‐scale problems, a simulated annealing heuristic that uses random neighborhood generation is provided. Computational experiments are conducted to test the algorithms. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2007. 相似文献