首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   481篇
  免费   0篇
  481篇
  2021年   5篇
  2019年   13篇
  2018年   9篇
  2017年   11篇
  2016年   9篇
  2015年   10篇
  2013年   78篇
  2011年   5篇
  2010年   6篇
  2009年   4篇
  2007年   6篇
  2006年   7篇
  2005年   11篇
  2004年   8篇
  2003年   5篇
  2001年   4篇
  2000年   9篇
  1999年   6篇
  1998年   5篇
  1997年   9篇
  1996年   12篇
  1995年   4篇
  1994年   10篇
  1993年   6篇
  1992年   7篇
  1991年   14篇
  1990年   8篇
  1989年   12篇
  1988年   6篇
  1987年   11篇
  1986年   9篇
  1985年   11篇
  1984年   9篇
  1983年   7篇
  1982年   6篇
  1981年   8篇
  1980年   10篇
  1979年   7篇
  1978年   8篇
  1977年   8篇
  1976年   9篇
  1975年   6篇
  1974年   11篇
  1973年   8篇
  1972年   9篇
  1971年   13篇
  1970年   3篇
  1969年   6篇
  1968年   5篇
  1967年   3篇
排序方式: 共有481条查询结果,搜索用时 15 毫秒
171.
172.
173.
Sequential tests for the product of Poisson parameters based on the generalized incomplete modified Bessel (g.i.m.B.) distributions are given. Applications to reliability and biometry are indicated.  相似文献   
174.
Exact expressions for the first and second order moments of order statistics from the truncated exponential distribution, when the proportion 1–P of truncation is known in advance, are presented in this paper. Tables of expected values and variances-covariances are given for P = 0.5 (0.1) 0.9 and n = 1 (1) 10.  相似文献   
175.
A unifying survey of the literature related to the knapsack problem; that is, maximize \documentclass{article}\pagestyle{empty}\begin{document}$ \sum\limits_i {v_i x_{i,} } $\end{document}, subject to \documentclass{article}\pagestyle{empty}\begin{document}$ \sum\limits_j {w_i x_i W} $\end{document} and xi ? 0, integer; where vi, wi and W are known integers, and wi (i = 1, 2, …, N) and W are positive. Various uses, including those in group theory and in other integer programming algorithms, as well as applications from the literature, are discussed. Dynamic programming, branch and bound, search enumeration, heuristic methods, and other solution techniques are presented. Computational experience, and extensions of the knapsack problem, such as to the multi-dimensional case, are also considered.  相似文献   
176.
A simple and relatively efficient method for simulating one-dimensional and two-dimensional nonhomogeneous Poisson processes is presented The method is applicable for any rate function and is based on controlled deletion of points in a Poisson process whose rate function dominates the given rate function In its simplest implementation, the method obviates the need for numerical integration of the rate function, for ordering of points, and for generation of Poisson variates.  相似文献   
177.
The literature on maintenance models is surveyed. The focus is on work appearing since the 1965 survey, “Maintenance Policies for Stochastically Failing Equipment: A Survey” by John McCall and the 1965 book, The Mathematical Theory of Reliability, by Richard Barlow and Frank Proschan. The survey includes models which involve an optimal decision to procure, inspect, and repair and/or replace a unit subject to deterioration in service.  相似文献   
178.
The problem of selecting materials, their thicknesses and order for armor designed for the defeat of shaped charge threats, has been formulated as a constrained optimization problem. The mathematical model provides an optimal order and thickness of each layer of material such that the resulting armor configuration will be of minimum mass per unit area subject to constraints on total thickness and shaped charge jet tip exit velocity.  相似文献   
179.
We consider the problem of searching for a target that moves in discrete time and space according to some Markovian process. At each time, a searcher attempts to detect the target. If the searcher's action at each time is such as to maximize his chances of immediate detection, we call his strategy “myopic.” We provide a computationally useful necessary condition for optimality, and use it to provide an example wherein the myopic strategy is not optimal.  相似文献   
180.
This paper gives characterization of optimal Solutions for convex semiinfinite programming problems. These characterizations are free of a constraint qualification assumption. Thus they overcome the deficiencies of the semiinfinite versions of the Fritz John and the Kuhn-Tucker theories, which give only necessary or sufficient conditions for optimality, but not both.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号