全文获取类型
收费全文 | 84篇 |
免费 | 11篇 |
国内免费 | 5篇 |
出版年
2022年 | 1篇 |
2021年 | 3篇 |
2020年 | 1篇 |
2019年 | 3篇 |
2018年 | 3篇 |
2017年 | 1篇 |
2016年 | 3篇 |
2014年 | 3篇 |
2013年 | 15篇 |
2012年 | 1篇 |
2011年 | 2篇 |
2010年 | 2篇 |
2009年 | 9篇 |
2008年 | 3篇 |
2007年 | 2篇 |
2006年 | 7篇 |
2005年 | 9篇 |
2004年 | 4篇 |
2003年 | 4篇 |
2002年 | 8篇 |
2001年 | 2篇 |
2000年 | 2篇 |
1998年 | 2篇 |
1997年 | 1篇 |
1995年 | 2篇 |
1994年 | 2篇 |
1992年 | 2篇 |
1990年 | 1篇 |
1989年 | 1篇 |
1983年 | 1篇 |
排序方式: 共有100条查询结果,搜索用时 15 毫秒
1.
2.
3.
在表格处理和光符识别软件中.歪斜图像校正是一项重要的预处理技术。针对文本和表格图像,本文提出了一种基于线条检测模型的高精度、快速的歪斜图像检测方法。 相似文献
4.
Ancker's stochastic duels with limited ammunition supply are extended to cases where a kill is obtained through repetitive multiple hits with two firing modes, single-shot firing and pattern firing. Examples with negative exponential firing time and geometric ammunition supply are given. 相似文献
5.
In Turner and Holmes [8] a model for evasive vehicle movement along a fixed track is developed within the mathematical framework of a two-state semi-Markov process. They derive a number of analytical properties of the model. In this article we address problems concerning the estimation of parameters in the model and the construction of data-based prediction equations. 相似文献
6.
7.
针对C^4ISR组织结构的复杂特点,运用社会网络分析概念分析军事C。ISR(指挥、控制、通信、计算机、情报、监视和侦察)组织结构,旨在对军事组织结构中的C^4ISR的效能给出一种定量分析的方法。具体讲,就是描述了FINC(力量、情报、网络和指挥控制)方法,给出了大量的基本运算法则来比较和定量分析C^4ISR组织结构的组织网络,便于更全面地分析评估不同组织结构的费效比,并将其应用于一个想定的C^4ISR组织结构中。 相似文献
8.
9.
10.
We seek dynamic server assignment policies in finite‐capacity queueing systems with flexible and collaborative servers, which involve an assembly and/or a disassembly operation. The objective is to maximize the steady‐state throughput. We completely characterize the optimal policy for a Markovian system with two servers, two feeder stations, and instantaneous assembly and disassembly operations. This optimal policy allocates one server per station unless one of the stations is blocked, in which case both servers work at the unblocked station. For Markovian systems with three stations and instantaneous assembly and/or disassembly operations, we consider similar policies that move a server away from his/her “primary” station only when that station is blocked or starving. We determine the optimal assignment of each server whose primary station is blocked or starving in systems with three stations and zero buffers, by formulating the problem as a Markov decision process. Using this optimal assignment, we develop heuristic policies for systems with three or more stations and positive buffers, and show by means of a numerical study that these policies provide near‐optimal throughput. Furthermore, our numerical study shows that these policies developed for assembly‐type systems also work well in tandem systems. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008 相似文献