全文获取类型
收费全文 | 128篇 |
免费 | 21篇 |
国内免费 | 4篇 |
出版年
2023年 | 1篇 |
2022年 | 3篇 |
2021年 | 7篇 |
2020年 | 5篇 |
2019年 | 6篇 |
2018年 | 1篇 |
2017年 | 2篇 |
2015年 | 5篇 |
2014年 | 10篇 |
2013年 | 13篇 |
2012年 | 9篇 |
2011年 | 13篇 |
2010年 | 13篇 |
2009年 | 12篇 |
2008年 | 9篇 |
2007年 | 8篇 |
2006年 | 6篇 |
2005年 | 3篇 |
2004年 | 4篇 |
2003年 | 3篇 |
2002年 | 3篇 |
2001年 | 5篇 |
2000年 | 1篇 |
1999年 | 3篇 |
1997年 | 1篇 |
1996年 | 1篇 |
1995年 | 1篇 |
1993年 | 1篇 |
1990年 | 3篇 |
1988年 | 1篇 |
排序方式: 共有153条查询结果,搜索用时 78 毫秒
151.
A Markov chain approach to detecting a threat in a given surveillance zone by a network of steerable sensors is presented. The network has a finite number of predetermined states, and transition from one state to another follows a Markov chain. Under the assumption that the threat avoids detection, two game theoretic problems for finding an optimal Markov chain (two surveillance strategies) are formulated: the first maximizes the probability of threat detection for two consecutive detection periods, whereas the second minimizes the average time of detection for the worst‐case threat's trajectory. Both problems are reduced to linear programming, and special techniques are suggested to solve them. For a dynamic environment with moving noise sources, the optimal Markov chain changes at each detection period, and the rate of convergence of the Markov chain to its stationary distribution is analyzed. Both surveillance strategies are tested in numerical experiments and compared one with another. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011 相似文献
152.
153.
Erdem Eskigun Reha Uzsoy Paul V. Preckel George Beaujon Subramanian Krishnan Jeffrey D. Tew 《海军后勤学研究》2007,54(3):282-300
We present a large‐scale network design model for the outbound supply chain of an automotive company that considers transportation mode selection (road vs. rail) and explicitly models the relationship between lead times and the volume of flow through the nodes of the network. We formulate the problem as a nonlinear zero‐one integer program, reformulate it to obtain a linear integer model, and develop a Lagrangian heuristic for its solution that gives near‐optimal results in reasonable time. We also present scenario analyses that examine the behavior of the supply chain under different parameter settings and the performance of the solution procedures under different experimental conditions. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2007 相似文献