首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   572篇
  免费   13篇
  2021年   6篇
  2019年   13篇
  2018年   9篇
  2017年   11篇
  2016年   9篇
  2015年   9篇
  2013年   105篇
  2010年   5篇
  2009年   9篇
  2008年   10篇
  2006年   5篇
  2005年   8篇
  2004年   12篇
  2003年   8篇
  2002年   5篇
  2001年   5篇
  2000年   7篇
  1999年   5篇
  1998年   7篇
  1997年   6篇
  1996年   17篇
  1995年   7篇
  1994年   9篇
  1993年   7篇
  1992年   11篇
  1991年   18篇
  1990年   7篇
  1989年   12篇
  1988年   12篇
  1987年   14篇
  1986年   16篇
  1985年   18篇
  1984年   9篇
  1983年   5篇
  1982年   5篇
  1981年   6篇
  1980年   12篇
  1979年   6篇
  1978年   9篇
  1977年   9篇
  1976年   9篇
  1975年   7篇
  1974年   8篇
  1972年   11篇
  1971年   12篇
  1970年   11篇
  1969年   8篇
  1968年   9篇
  1967年   9篇
  1966年   9篇
排序方式: 共有585条查询结果,搜索用时 468 毫秒
501.
This paper poses a prediction problem in which a linear model is assumed. With a “zero-one” loss structure as the loss from incorrect prediction, it is suggested that least squares may not be appropriate for estimating the parameters of the model. An alternate criterion is proposed and integer programming is used in order to find the estimates, given the proposed criterion.  相似文献   
502.
Alternative repair part inventory policies are examined for a multi-echelon logistics system. The policies assessed pertain to the design of multi-echelon systems rather than the evaluation of stock level decisions for individual repair parts. Although the context is one of a military inventory system, the policies examined are of importance in nonmilitary systems where item failure rates are low, and only periodic access to resupply is possible.  相似文献   
503.
This paper presents a procedure akin to dynamic programming for designing optimal acceptance sampling plans for item-by-item inspection. Using a Bayesian procedure, a prior distribution is specified, and a suitable cost model is employed depicting the cost of sampling, accepting or rejecting the lot. An algorithm is supplied which is digital computer oriented.  相似文献   
504.
One approach to the evaluation of the performance of multiprogranmed computer systems includes the development of Monte Carlo simulations of transitions of programs within such systems, and their strengthening by control variable and concomitant variable methods. An application of such a combination of analytical, numerical, and Monte Carlo approaches to a model of system overhead in a paging machine is presented.  相似文献   
505.
506.
Under fairly general conditions, a nonlinear fractional program, where the function to be maximized has the form f(x)/g(x), is shown to be equivalent to a nonlinear program not involving fractions. The latter program is not generally a convex program, but there is often a convex program equivalent to it, to which the known algorithms for convex programming may be applied. An application to duality of a fractional program is discussed.  相似文献   
507.
This paper considers the search for an evader concealed in one of an arbitrary number of regions, each of which is characterized by its detection probability. We shall be concerned here with the double-sided problem in which the evader chooses this probability secretly, although he may not subsequently move; his aim is to maximize the expected time to detection, while the searcher attempts to minimize it. The situation where two regions are involved has been studied previously and reported on recently. This paper represents a continuation of this analysis. It is normally true that as the number of regions increases, optimal strategies for both searcher and evader are progressively more difficult to determine precisely. However it will be shown that, generally, satisfactory approximations to each are almost as easily derived as in the two region problem, and that the accuracy of such approximations is essentially independent of the number of regions. This means that so far as the evader is concerned, characteristics of the two-region problem may be used to assess the accuracy of such approximate strategies for problems of more than two regions.  相似文献   
508.
Computer simulation has many advantages. However, one major disadvantage is that, in all too many cases, the attempt to use computer simulation to find an optimum solution to a problem rapidly degenerates into a trial-and-error process. Techniques for overcoming this disadvantage, i. e., for making optimization and computer simulation more compatible, are applicable at two points in the development of the overall computer simulation. Techniques which are used within actual construction of the mathematical models comprising the simulation will be labeled as internal methods, while those which are used after the simulation has been completely developed will be termed external methods Because external methods appear to offer the largest potential payoff, discussion is restricted to these methods, which are essentially search techniques. In addition, the development of an “Optimizer” computer program based on these techniques is suggested Although drawbacks to the use of search techniques in the computer simulation framework exist, these techniques do offer potential for “optimization.” The modification of these techniques to satisfy the requirements of an “Optimizer” is discussed.  相似文献   
509.
510.
A simple method is presented for deriving the mean and variance of the queueing time distribution in an M/G/1 queue when the priorities assigned to customers have an assignment probability distribution. Several examples illustrate the results. The mean and variance of the queueing time distribution for the longest service time discipline are derived, and its disadvantages are discussed.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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