全文获取类型
收费全文 | 799篇 |
免费 | 21篇 |
出版年
2019年 | 24篇 |
2018年 | 13篇 |
2017年 | 21篇 |
2016年 | 17篇 |
2015年 | 20篇 |
2014年 | 21篇 |
2013年 | 182篇 |
2012年 | 7篇 |
2011年 | 13篇 |
2010年 | 11篇 |
2009年 | 14篇 |
2008年 | 8篇 |
2007年 | 13篇 |
2006年 | 10篇 |
2005年 | 14篇 |
2004年 | 13篇 |
2003年 | 8篇 |
2002年 | 14篇 |
2001年 | 7篇 |
2000年 | 9篇 |
1999年 | 11篇 |
1998年 | 12篇 |
1997年 | 9篇 |
1996年 | 10篇 |
1995年 | 8篇 |
1994年 | 21篇 |
1993年 | 17篇 |
1992年 | 12篇 |
1991年 | 16篇 |
1990年 | 11篇 |
1989年 | 18篇 |
1988年 | 17篇 |
1987年 | 18篇 |
1986年 | 17篇 |
1985年 | 13篇 |
1984年 | 9篇 |
1983年 | 11篇 |
1982年 | 7篇 |
1981年 | 8篇 |
1979年 | 10篇 |
1978年 | 13篇 |
1976年 | 8篇 |
1975年 | 8篇 |
1974年 | 9篇 |
1973年 | 9篇 |
1972年 | 13篇 |
1970年 | 13篇 |
1969年 | 7篇 |
1968年 | 7篇 |
1967年 | 7篇 |
排序方式: 共有820条查询结果,搜索用时 15 毫秒
691.
692.
693.
694.
David Burns 《Defense & Security Analysis》1992,8(2):206-208
695.
696.
697.
In this article we present some advanced basis or block-pivoting, relaxation, and feasible direction methods for solving linear programming problems. Preliminary computational results appear to indicate that the former two types of simplex-based procedures may hold promise for solving linear programming problems, unlike the third type of scheme which is shown to be computationally unattractive. 相似文献
698.
This article proposes a practical, data-based statistical procedure which can be used to reduce or remove bias owing to artificial startup conditions in simulations aimed at estimating steady-state means. We discuss results of experiments designed to choose good parameter values for this procedure, and present results of extensive testing of the procedure on a variety of stochastic models for which partial analytical results are available. The article closes with two illustrations of the application of the procedure to more complex statistical problems which are more representative of the kinds of purposes for which real-world steady-state simulation studies might be undertaken. 相似文献
699.
It is proposed to describe multiple air-to-air combat having a moderate number of participants with the aid of a stochastic process based on end-game duels. A simple model describing the dominant features of air combat leads to a continuous time discrete-state Markov process. Solution of the forward Kolmogorov equations enables one to investigate the influence of initial force levels and performance parameters on the outcome probabilities of the multiple engagement. As is illustrated, such results may be useful in the decision-making process for aircraft and weapon system development planning. Some comparisons are made with Lanchester models as well as with a semi-Markov model. 相似文献
700.
To solve linear fixed charge problems with Murty's vertex ranking algorithm, one uses a simplex algorithm and a procedure to determine the vertices adjacent to a given vertex. In solving fixed charge transportation problems, the simplex algorithm simplifies to the stepping-stone algorithm. To find adjacent vertices on transportation polytopes, we present a procedure which is a simplification of a more general procedure for arbitrary polytopes. 相似文献