首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   569篇
  免费   22篇
  国内免费   1篇
  2021年   7篇
  2019年   12篇
  2018年   8篇
  2017年   12篇
  2016年   12篇
  2015年   10篇
  2014年   7篇
  2013年   113篇
  2012年   6篇
  2011年   8篇
  2010年   6篇
  2009年   9篇
  2008年   7篇
  2007年   6篇
  2006年   9篇
  2005年   9篇
  2004年   9篇
  2003年   7篇
  2000年   6篇
  1999年   6篇
  1997年   7篇
  1996年   14篇
  1995年   5篇
  1994年   12篇
  1993年   12篇
  1992年   11篇
  1991年   17篇
  1989年   10篇
  1988年   8篇
  1987年   10篇
  1986年   14篇
  1985年   19篇
  1984年   8篇
  1983年   7篇
  1982年   6篇
  1981年   5篇
  1980年   10篇
  1979年   10篇
  1978年   11篇
  1977年   6篇
  1976年   11篇
  1975年   11篇
  1974年   9篇
  1973年   10篇
  1972年   13篇
  1971年   9篇
  1970年   12篇
  1969年   6篇
  1968年   9篇
  1967年   7篇
排序方式: 共有592条查询结果,搜索用时 15 毫秒
21.
This paper presents a general solution for the M/M/r queue with instantaneous jockeying and r > 1 servers. The solution is obtained in matrices in closed form without recourse to the generating function arguments usually used. The solution requires the inversion of two (Zr?1) × (2r?1) matrices. The method proposed is extended to allow different queue selection preferences of arriving customers, balking of arrivals, jockeying preference rules, and queue dependent selection along with jockeying. To illustrate the results, a problem previously published is studied to show how known results are obtained from the proposed general solution.  相似文献   
22.
23.
Frequently there exists an insufficient amount of actual data upon which to base a decision. In this paper a method is presented whereby the subjective opinions of a group of qualified persons are utilized to quantify the relative importance of a finite number of parameters or objectives. A means of testing the consistency among the judges is given which allows the decision maker to determine the validity of the opinions gathered. The application presented here is in the area of Multiple Incentive Contracting. Namely, a method is proposed to facilitate the answering of the question, “What is the value to the purchaser of an incremental change in the performance of a system?” Such a vehicle is not essential to the methodology proposed.  相似文献   
24.
In this paper a model is presented which focuses on the difficult problem of predicting demands for items with extremely low usage rates. These form the bulk of repair parts in military systems. The basic notion underlying the model is the pooling of usage data for common design items with movement for the purpose of estimating usage rates for similar items which have shown no movement. A unique feature of the model is that it also makes possible the estimation of usage rates for items newly introduced into a system for which no previous usage history is available.  相似文献   
25.
26.
It has long been an accepted proposition that base level usage df technical repair items for aircraft is related to program elements. The program element most often cited in this connection is flying hours. Evidence of this relationship on a line item basis, however, has been sparse. This study suggests that although the supposed relation is intuitively plausible, for most line items it cannot be effectively utilized in projecting base level requirements. The basis of this conclusion is an analysis of demand characteristics for technical repair items for a variety of naval aircraft.  相似文献   
27.
Mathematical models of tactical problems in Hntisubmarine Warfare (ASW) are developed. Specifically, a game of pursuit between a hunter-killer force. player 1, and a possible submarine, player 2 is considered. The game consists of a sequence of moves and terminates when player 2 is tcaught or evades player 1. When the players move they observe the actual tactical configuration of the forces (state) and each player choosa-s a tactical plan from a finite collection. This joint choice of tactical plans determines an immediate payoff and a transition probability distribution over the states. Hence an expected payoff function is defined, Formally this game is a Terminating Stochastic Game (TSG). Shapley demonstrated the existence of a value and optimal strategies (solution), An iterative technique to approximate the solution to within desired accuracy is proposed. Each iteration of the technique is obtained by solving a set of linear programs. To introduce more realism into the game several variations of the TSG are also considered. One variation is a finite TSG and linear programming techniques are employed to find the solution.  相似文献   
28.
测量聚合物在高应变率下力学性质的实验系统   总被引:1,自引:0,他引:1       下载免费PDF全文
本文介绍了一种用于测量材料在高应变率下单轴应力─应变性能的实验测量系统:落重与高速摄影实验系统。该系统在现有的落重装置的基础上,增加了高速摄影和应力过程的同时测量,使得在一次实验中可同时取到应力应变数据。从而避免了这类实验中常用的变形过程中体积不变的假设。通过高速实验提供的实验照片,我们还可以观察到聚合物在高应变率下从变形到断裂的发展过程。  相似文献   
29.
30.
A transportation system has N vehicles with no capacity constraint which take passengers from a depot to various destinations and return to the depot. The trip times are considered to be independent and identically distributed random variables. The dispatch strategy at the depot is to dispatch immediately, or to hold any returning vehicles with the objective of minimizing the average wait per passenger at the depot, if passengers arrive at a uniform rate. Optimal control strategies and resulting waits are determined in the special case of exponentially distributed trip time for various N up to N = 15. For N ? 1, the nature of the solution is always to keep a reservoir of vehicles in the depot, and to decrease (increase) the time headway between dispatches as the size of the reservoir gets larger (smaller). For sufficiently large N, one can approximate the number of vehicles in the reservoir by a continuum and obtain analytic experession for the optimal dispatch rate as a function of the number of vehicles in the reservoir. For the optimal strategy, it is shown that the average number of vehicles in the depot is of order N1/3. These limit properties are expected to be quite insensitive to the actual trip time distribution, but the convergence of the exact properties to the continuum approximation as N → ∞ is very slow.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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