首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   3326篇
  免费   82篇
  国内免费   1篇
  3409篇
  2021年   38篇
  2019年   88篇
  2018年   51篇
  2017年   80篇
  2016年   78篇
  2015年   61篇
  2014年   64篇
  2013年   697篇
  2010年   35篇
  2009年   37篇
  2008年   47篇
  2007年   52篇
  2006年   36篇
  2005年   42篇
  2004年   56篇
  2003年   42篇
  2002年   57篇
  1999年   41篇
  1998年   46篇
  1997年   48篇
  1996年   61篇
  1995年   41篇
  1994年   60篇
  1993年   63篇
  1992年   58篇
  1991年   74篇
  1990年   39篇
  1989年   72篇
  1988年   78篇
  1987年   68篇
  1986年   71篇
  1985年   66篇
  1984年   36篇
  1983年   42篇
  1982年   43篇
  1981年   46篇
  1980年   51篇
  1979年   45篇
  1978年   49篇
  1977年   46篇
  1976年   45篇
  1975年   46篇
  1974年   52篇
  1973年   50篇
  1972年   52篇
  1971年   43篇
  1970年   40篇
  1969年   40篇
  1968年   34篇
  1967年   34篇
排序方式: 共有3409条查询结果,搜索用时 0 毫秒
961.
962.
963.
964.
In this article we deal with the shortest queue model with jockeying. We assume that the arrivals are Poisson, each of the exponential servers has his own queue, and jockeying among the queues is permitted. Explicit solutions of the equilibrium probabilities, the expected customers, and the expected waiting time of a customer in the system are given, which only depend on the traffic intensity. Numerical results can be easily obtained from our solutions. Several examples are provided in the article.  相似文献   
965.
A procedure for obtaining a facilities scatter diagram within a rectangular boundary is developed using a multifacility location model. This method gives favorable computational results and has the advantage over other scatter diagram methods of being able to accommodate fixed facility locations. Examples illustrate how this method can be used by a designer/analyst either as a one-step algorithm or iteratively to build a layout.  相似文献   
966.
This article deals with special cases of open-shop scheduling where n jobs have to be processed by m, m ?3, machines to minimize the schedule length. The main result obtained is an O(n) algorithm for the three-machine problem with a dominated machine.  相似文献   
967.
Dirichlet mixed models find wide application. Estimation is usually achieved through the method of moments. Here we present an iterative hybrid algorithm for obtaining the maximum likelihood estimate employing both modified Newton-Raphson and E-M methods. This successful MLE algorithm enables calculation of a jack-knife MLE. Simulation comparison of the three estimates is provided. The MLE substantially improves upon the moments estimator particularly with increasing dimension. The jack-knife MLE in turn offers dramatic improvement over the MLE.  相似文献   
968.
Mathematical models are proposed for studying the impact of miscalibration upon operational effectiveness. Methodology for assessing the system effectiveness and an approach for optimizing the effectiveness of a calibration program are examined. The theory application is discussed and the results of some specific and convenient models are presented.  相似文献   
969.
The article considers a two-person zero-sum game in which a searcher with b bombs wishes to destroy a mobile hider. The players are restricted to move on a straight line with maximum speeds v and u satisfying v > u > 0; neither player can see the other but each knows the other's initial position. The bombs all have destructive radius R and there is a time lag T between the release of a bomb and the bomb exploding. The searcher gets 1 unit if the hider is destroyed and 0 if he survives. A solution is given for b = 1, and extended to b > 1 when the time lag is small. Various applications of the game are discussed.  相似文献   
970.
In this article we consider two versions of two-on-two homogeneous stochastic combat and develop expressions, in each case, for the state probabilities. The models are natural generalizations of the exponential Lanchester square law model. In the first version, a marksman whose target is killed resumes afresh the killing process on a surviving target; in the second version, the marksman whose target is killed merely uses up his remaining time to a kill on a surviving target. Using the state probabilities we then compute such important combat measures as (1) the mean and variance of the number of survivors as they vary with time for each of the sides, (2) the win probabilities for each of the sides, and (3) the mean and variance of the battle duration time. As an application, computations were made for the specific case of a gamma (2) interfiring time random variable for each side and the above combat measures were compared with the appropriate exponential and deterministic Lanchester square law approximations. The latter two are shown to be very poor approximations in this case.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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