全文获取类型
| 收费全文 | 172篇 |
| 免费 | 35篇 |
| 国内免费 | 2篇 |
专业分类
| 209篇 |
出版年
| 2024年 | 2篇 |
| 2023年 | 2篇 |
| 2022年 | 2篇 |
| 2021年 | 2篇 |
| 2020年 | 5篇 |
| 2019年 | 4篇 |
| 2018年 | 4篇 |
| 2017年 | 9篇 |
| 2016年 | 11篇 |
| 2015年 | 15篇 |
| 2014年 | 4篇 |
| 2013年 | 10篇 |
| 2012年 | 15篇 |
| 2011年 | 16篇 |
| 2010年 | 14篇 |
| 2009年 | 11篇 |
| 2008年 | 11篇 |
| 2007年 | 13篇 |
| 2006年 | 11篇 |
| 2005年 | 8篇 |
| 2004年 | 3篇 |
| 2003年 | 2篇 |
| 2002年 | 4篇 |
| 2001年 | 6篇 |
| 2000年 | 5篇 |
| 1999年 | 9篇 |
| 1998年 | 4篇 |
| 1997年 | 2篇 |
| 1996年 | 2篇 |
| 1994年 | 1篇 |
| 1990年 | 1篇 |
| 1988年 | 1篇 |
排序方式： 共有209条查询结果，搜索用时 15 毫秒
151.
We consider the effects of cueing in a cooperative search mission that involves several autonomous agents. Two scenarios are discussed: one in which the search is conducted by a number of identical search‐and‐engage vehicles and one where these vehicles are assisted by a search‐only (reconnaissance) asset. The cooperation between the autonomous agents is facilitated via cueing, i.e., the information transmitted to the agents by a searcher that has just detected a target. The effect of cueing on the target detection probability is derived from first principles using a Markov chain analysis. In particular, it is demonstrated that the benefit of cueing on the system's effectiveness is bounded. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006 相似文献
152.
153.
侦察水雷是水雷战的一项重要内容。在水下无人作战平台和航空反水雷直升机作战平台搜索水雷概率模型分析基础上,给出了多平台协同搜索水雷方案优化模型,经分析归纳得到多平台协同搜索水雷最优方案,可为实际作战中多平台协同搜索水雷方案的制定、优化提供决策支持,具有较高的实用性。 相似文献
154.
The Annealing Adaptive Search (AAS) algorithm for global optimization searches the solution space by sampling from a sequence of Boltzmann distributions. For a class of optimization problems, it has been shown that the complexity of AAS increases at most linearly in the problem dimension. However, despite its desirable property, sampling from a Boltzmann distribution at each iteration of the algorithm remains a practical challenge. Prior work to address this issue has focused on embedding Markov chain‐based sampling techniques within the AAS framework. In this article, based on ideas from the recent Cross‐Entropy method and Model Reference Adaptive Search, we propose an algorithm, called Model‐based Annealing Random Search (MARS), that complements prior work by sampling solutions from a sequence of surrogate distributions that iteratively approximate the target Boltzmann distributions. We establish a novel connection between MARS and the well‐known Stochastic Approximation method. By exploiting this connection, we prove the global convergence of MARS and characterize its asymptotic convergence rate behavior. Our empirical results indicate promising performance of the algorithm in comparison with some of the existing methods. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011 相似文献
155.
We investigate the problem in which an agent has to find an object that moves between two locations according to a discrete Markov process (Pollock, Operat Res 18 (1970) 883–903). At every period, the agent has three options: searching left, searching right, and waiting. We assume that waiting is costless whereas searching is costly. Moreover, when the agent searches the location that contains the object, he finds it with probability 1 (i.e. there is no overlooking). Waiting can be useful because it could induce a more favorable probability distribution over the two locations next period. We find an essentially unique (nearly) optimal strategy, and prove that it is characterized by two thresholds (as conjectured by Weber, J Appl Probab 23 (1986) 708–717). We show, moreover, that it can never be optimal to search the location with the lower probability of containing the object. The latter result is far from obvious and is in clear contrast with the example in Ross (1983) for the model without waiting. © 2009 Wiley Periodicals, Inc. Naval Research Logistics 2009 相似文献
156.
Motivated by challenges in the smartphone manufacturing industry, we develop a dynamic production ramp-up model that can be applied to economically satisfy nonstationary demand for short-life-cycle products by high-tech companies. Due to shorter life cycles and more rapid evolution of smartphones, production ramp-up has been increasingly critical to the success of a new smartphone. In the production ramp-up, the key challenge is to match the increasing capacity to nonstationary demand. The high-tech smartphone manufacturers are urged to jointly consider the effect of increasing capacity and decreasing demand. We study the production planning problem using a high-dimensional Markov decision process (MDP) model to characterize the production ramp-up. To address the curse of dimensionality, we refine Monte Carlo tree search (MCTS) algorithm and theoretically analyze its convergence and computational complexity. In a real case study, we find that the MDP model achieves revenue improvement by stopping producing the existing product earlier than the benchmark policy. In synthetic instances, we validate that the proposed MCTS algorithm saves computation time without loss of solution quality compared with traditional value iteration algorithm. As part of the Lenovo production solution, our MDP model enables high-tech smartphone manufacturers to better plan the production ramp-up. 相似文献
157.
158.
基于复杂网络的拓扑结构优化理论与禁忌搜索算法,结合指挥控制系统的特点,建立了优化最优指挥与控制系统网络结构（Command and Control Architecture Network,C2AN）模型,并以复杂网络的网络效率和网络成本分别描述C2AN中的信息传播效率及构建C2AN的资源消耗,建立优化的目标函数,通过禁忌搜索算法获得了最优的C2AN。最后通过仿真实例,分析了最优C2AN生成过程及其基本统计特征。 相似文献
159.
160.
任务规划是在任务有不同威胁程度,资源消耗和战术价值条件下,寻找总战术价值最高,而又不超出约束的任务链,这对飞机完成任务中具有重要作用,针对机载资源有限、任务有不同威胁程度和战术价值,提出了基于权值编码遗传算法的任务规划方法,该算法通过对原始问题的偏离和启发式解码来得到最优的可完成任务子集.仿真结果验证了算法的有效性. 相似文献