全文获取类型
收费全文 | 442篇 |
免费 | 5篇 |
出版年
2020年 | 5篇 |
2019年 | 6篇 |
2018年 | 11篇 |
2017年 | 13篇 |
2016年 | 14篇 |
2015年 | 5篇 |
2014年 | 6篇 |
2013年 | 146篇 |
2011年 | 4篇 |
2010年 | 5篇 |
2009年 | 4篇 |
2006年 | 3篇 |
2005年 | 9篇 |
2004年 | 3篇 |
2003年 | 6篇 |
2002年 | 7篇 |
2001年 | 3篇 |
2000年 | 4篇 |
1999年 | 5篇 |
1998年 | 4篇 |
1997年 | 6篇 |
1996年 | 4篇 |
1995年 | 8篇 |
1994年 | 7篇 |
1993年 | 8篇 |
1992年 | 10篇 |
1991年 | 12篇 |
1990年 | 3篇 |
1989年 | 7篇 |
1988年 | 3篇 |
1987年 | 12篇 |
1986年 | 7篇 |
1985年 | 7篇 |
1984年 | 4篇 |
1983年 | 3篇 |
1982年 | 3篇 |
1981年 | 3篇 |
1980年 | 5篇 |
1979年 | 3篇 |
1978年 | 10篇 |
1977年 | 3篇 |
1976年 | 5篇 |
1975年 | 5篇 |
1974年 | 9篇 |
1973年 | 4篇 |
1972年 | 4篇 |
1971年 | 4篇 |
1970年 | 5篇 |
1969年 | 4篇 |
1968年 | 4篇 |
排序方式: 共有447条查询结果,搜索用时 15 毫秒
21.
22.
James L. Cook 《Journal of Military Ethics》2016,15(4):321-324
23.
24.
Assessing the effects of changes in weapons systems or battle tactics is difficult because of the variations in battles and the resulting instability of measures of combat effectiveness. Even under the relatively stable conditions of designed combat exercises, traditional measures may fail to reflect important battle events and dynamics. This variation in results makes the design, conduct, and evaluation of combat experiments, combat simulations, and combat training exercises a challenging endeavor, indeed. We develop and examine a combat measure of effectiveness, based on Lanchester models, which we call the battle trace. The battle trace is a measure of ongoing battle results, measured as a function of time into the battle. We describe how such measures might contribute to assessing effects of changing certain battle parameters. We suggest applications of these ideas to developing combat simulations and to enhancing combat training exercises. 相似文献
25.
John W. Chinneck 《海军后勤学研究》1992,39(4):531-543
Nonviable network models have edges which are forced to zero flow simply by the pattern of interconnection of the nodes. The original nonviability diagnosis algorithm [4] is extended here to cover all classes of network models, including pure, generalized, pure processing, nonconserving processing, and generalized processing. The extended algorithm relies on the conversion of all network forms to a pure processing form. Efficiency improvements to the original algorithm are also presented. 相似文献
26.
James F. Campbell 《海军后勤学研究》1992,39(5):635-649
This article analyzes the location-allocation problem for distribution from a single fixed origin via transshipment terminals to a continuous uniformly distributed demand. Distribution through terminals concentrates flows on the origin-to-terminal links and transportation economies of scale encourage the use of larger vehicles. Analytical expressions are derived for the optimal terminal locations, the optimal allocation of destinations to terminals, and the optimal transportation cost. Continuous analytic models assume either an allocation, by partitioning the service region into sectors, or terminal locations. This is unlikely to produce an optimal distribution system. The optimal cost is compared to the cost for suboptimal location-allocation combinations. Results indicate that the location decision is not too important if destinations are allocated optimally and that allocation to the nearest terminal may be poor, even with optimal locations. © 1992 John Wiley & Sons, Inc. 相似文献
27.
This article details several procedures for using path control variates to improve the accuracy of simulation-based point and confidence-interval estimators of the mean completion time of a stochastic activity network (SAN). Because each path control variate is the duration of the corresponding directed path in the network from the source to the sink, the vector of selected path controls has both a known mean and a known covariance matrix. This information is incorporated into estimation procedures for both normal and nonnormal responses. To evaluate the performance of these procedures experimentally, we examine the bias, variance, and mean square error of the controlled point estimators as well as the average half-length and coverage probability of the corresponding confidence-interval estimators for a set of SANs in which the following characteristics are systematically varied: (a) the size of the network (number of nodes and arcs); (b) the topology of the network; (c) the percentage of activities with exponentially distributed durations; and (d) the relative dominance of the critical path. The experimental results show that although large improvements in accuracy can be achieved with some of these procedures, the confidence-interval estimators for normal responses may suffer serious loss of coverage probability in some applications. 相似文献
28.
Cumulative search-evasion games (CSEGs) are two-person zero-sum search-evasion games where play proceeds throughout some specified period without interim feedback to either of the two players. Each player moves according to a preselected plan. If (Xt, Yt,) are the positions of the two players at time t, then the game's payoff is the sum over t from 1 to T of A(Xt, Yt, t). Additionally, all paths must be “connected.” That is, the finite set of positions available for a player in any time period depends on the position selected by that player in the previous time period. One player attempts to select a mixed strategy over the feasible T-time period paths to maximize the expected payoff. The other minimizes. Two solution procedures are given. One uses the Brown-Robinson method of fictitious play and the other linear programming. An example problem is solved using both procedures. 相似文献
29.
We consider sequencing n jobs on a single machine subject to job completion times arising from either machine breakdowns or other causes. The objective is to minimize an expected weighted combination of due dates, completion times, earliness, and tardiness penalties. The determination of optimal distinct due dates or optimal common due dates for a given schedule is investigated. The scheduling problem for a fixed common due date is considered when random completion times arise from machine breakdowns. The optimality of a V-shaped about (a point) T sequence is established when the number of machine breakdowns follows either a Poisson or a geometric distribution and the duration of a breakdown has an exponential distribution. © 1996 John Wiley & Sons, Inc. 相似文献
30.
A search is conducted for a target moving in discrete time among a finite number of cells according to a known Markov process. The searcher must choose one cell in which to search in each time period. The set of cells available for search depends upon the cell chosen in the last time period. The problem is to find a search path, i.e., a sequence of search cells, that either maximizes the probability of detection or minimizes the mean number of time periods required for detection. The search problem is modelled as a partially observable Markov decision process and several approximate solutions procedures are proposed. © 1995 John Wiley & Sons, Inc. 相似文献