全文获取类型
收费全文 | 410篇 |
免费 | 8篇 |
出版年
2021年 | 4篇 |
2020年 | 5篇 |
2019年 | 10篇 |
2018年 | 8篇 |
2017年 | 13篇 |
2016年 | 12篇 |
2015年 | 7篇 |
2014年 | 11篇 |
2013年 | 68篇 |
2012年 | 3篇 |
2011年 | 6篇 |
2010年 | 8篇 |
2009年 | 9篇 |
2008年 | 7篇 |
2007年 | 3篇 |
2006年 | 6篇 |
2005年 | 6篇 |
2004年 | 5篇 |
2003年 | 7篇 |
2002年 | 11篇 |
2001年 | 5篇 |
2000年 | 4篇 |
1999年 | 4篇 |
1998年 | 6篇 |
1997年 | 12篇 |
1996年 | 7篇 |
1995年 | 9篇 |
1994年 | 8篇 |
1993年 | 11篇 |
1992年 | 7篇 |
1991年 | 7篇 |
1990年 | 6篇 |
1989年 | 8篇 |
1988年 | 15篇 |
1987年 | 5篇 |
1986年 | 11篇 |
1985年 | 13篇 |
1984年 | 9篇 |
1980年 | 5篇 |
1979年 | 5篇 |
1978年 | 4篇 |
1977年 | 6篇 |
1976年 | 3篇 |
1974年 | 8篇 |
1972年 | 2篇 |
1971年 | 7篇 |
1970年 | 3篇 |
1969年 | 4篇 |
1968年 | 3篇 |
1967年 | 3篇 |
排序方式: 共有418条查询结果,搜索用时 15 毫秒
271.
272.
Least absolute value (LAV) regression has become a widely accepted alternative to least squares regression. This has come about as the result of advancements in statistical theory and computational procedures to obtain LAV estimates. Computer codes are currently available to solve a wide range of LAV problems including the best subset regression. The purpose of this article is to study the use of penalty calculations and other branching rules in developing the solution tree for the best subset LAV regression. 相似文献
273.
We discuss a time dependent optimal ordering policy for a finite horizon inventory system for which the provision of service is essential and thus no stockout is allowed. It is assumed that the system can place an order at any point in time during the horizon when it cannot meet the customer's demand and that lead time is negligible. The demand is considered to be distributed as a compound Poisson process with known parameters and the functional equation approach of dynamic programming is used to formulate the objective function. An algorithm has been developed to obtain the solution for all the cases. In addition, analytical solutions of the basic equation under two limiting conditions are presented. 相似文献
274.
275.
276.
Martin Edmonds 《Defense & Security Analysis》1994,10(2):229-231
The Transformations of War. By Commandant J. Colin; (Trans. Brevet Major L.H.R. Pope-Hennessy DSO), London: Hugh Rees, (Pall Mall Military Series) 1912. 355 pages 相似文献
277.
278.
279.
The classical “Colonel Blotto” games of force allocation are generalized to include situations in which there are complementarities among the targets being defended. The complementarities are represented by means of a system “characteristic function,” and a valuation technique from the theory of cooperative games is seen to indicate the optimal allocations of defense and attack forces. Cost trade-offs between systems defense and alternative measures, such as the hardening of targets, are discussed, and a simple example is analyzed in order to indicate the potential of this approach. 相似文献
280.
The shortest path problem between two specified nodes in a general network possesses the unimodularity property and, therefore, can be solved by efficient labelling algorithms. However, the introduction of an additional linear constraint would, in general, destroy this property and the existing algorithms are not applicable in this case. This paper presents a parametric approach for solving this problem. The algorithm presented would require, on the average, a number of iterations which is polynomially bounded. The similarity of this approach to that of the generalized Lagrange multiplier technique is demonstrated and a numerical example is presented. 相似文献