首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   399篇
  免费   10篇
  2020年   4篇
  2019年   10篇
  2018年   6篇
  2017年   12篇
  2016年   8篇
  2015年   7篇
  2014年   6篇
  2013年   105篇
  2011年   4篇
  2010年   3篇
  2009年   7篇
  2008年   4篇
  2007年   3篇
  2006年   3篇
  2005年   7篇
  2004年   7篇
  2003年   4篇
  2002年   3篇
  2000年   5篇
  1999年   5篇
  1998年   5篇
  1997年   3篇
  1996年   10篇
  1995年   5篇
  1994年   8篇
  1993年   5篇
  1992年   8篇
  1991年   12篇
  1989年   7篇
  1988年   6篇
  1987年   10篇
  1986年   11篇
  1985年   14篇
  1984年   3篇
  1983年   3篇
  1982年   2篇
  1980年   3篇
  1979年   3篇
  1978年   4篇
  1977年   6篇
  1976年   5篇
  1974年   5篇
  1973年   2篇
  1972年   8篇
  1971年   6篇
  1970年   9篇
  1969年   5篇
  1968年   5篇
  1967年   8篇
  1966年   3篇
排序方式: 共有409条查询结果,搜索用时 187 毫秒
81.
This article examines the problem of optimally selecting from several unknown rewards when there are given alternative, costly sources of information. The optimal rule, indicating the information to be purchased and the reward to be selected, is specified as a function of the decision maker's prior probabilities regarding the value of each alternative. The rule is surprisingly complex, balancing prior beliefs, the “informativeness” of the relevant information system, and the cost of acquiring information.  相似文献   
82.
An alternating renewal process starts at time zero and visits states 1,2,…,r, 1,2, …,r 1,2, …,r, … in sucession. The time spent in state i during any cycle has cumulative distribution function Fi, and the sojourn times in each state are mutually independent, positive and nondegenerate random variables. In the fixed time interval [0,T], let Ui(T) denote the total amount of time spent in state i. In this note, a central limit theorem is proved for the random vector (Ui(T), 1 ≤ ir) (properly normed and centered) as T → ∞.  相似文献   
83.
We consider the optimal replacement problem for a fault tolerant system comprised of N components. The components are distingushable, and the state of the system is given by knowing exactly which components are operationl and which have failed. The individual component failure rates depend on the state of the entire system. We assume that the rate at which the system produces income decreases as the system deteriorates and the system replacement cost rises. Individual components cannot be replaced. We give a greedy-type algorithm that produces the replacement policy that maximizes the long-run net system income per unit time.  相似文献   
84.
Strategy in the Missile Age. By Bernard Brodie. RAND Corporation, Princeton University Press, Princeton, NJ, 1959. Paperback editions 1965, 1967.  相似文献   
85.
86.
In this article, we describe a new algorithm for solving all-integer, integer programming problems. We generate upper bounds on the decision variables, and use these bounds to create an advanced starting point for a dual all-integer cutting plane algorithm. In addition, we use a constraint derived from the objective function to speed progress toward the optimal solution. Our basic vehicle is the dual all-integer algorithm of Gomory, but we incorporate certain row- and column-selection criteria which partially avoid the problem of dual-degenerate iterations. We present the results of computational testing.  相似文献   
87.
A series of independent trials is considered in which one of k ≥ 2 mutually exclusive and exhaustive outcomes occurs at each trial. The series terminates when m outcomes of any one type have occurred. The limiting distribution (as m → ∞) of the number of trials performed until termination is found with particular attention to the situation where a Dirichlet distribution is assigned to the k vector of probabilities for each outcome. Applications to series of races involving k runners and to spares problems in reliability modeling are discussed. The problem of selecting a stopping rule so that the probability of the series terminating on outcome i is k?1 (i.e., a “fair” competition) is also studied. Two generalizations of the original asymptotic problem are addressed.  相似文献   
88.
89.
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.  相似文献   
90.
A stochastically constrained optimal replacement model for capital equipment is constructed. Each piece of capital equipment, or machine, is characterized by its age and “utility” or “readiness” class. The readiness of a machine at any age is a stochastic function of its initial utility class and its age. The total discounted replacement cost of several replacement streams, each commencing with an initial machine, is minimized with respect to the replacement age and initial utility class of each machine, subject to a readiness constraint stating the lower bound on the expected number of machines in each utility class at any time. A general solution procedure is outlined and a specific case is solved in detail.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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