全文获取类型
收费全文 | 476篇 |
免费 | 11篇 |
出版年
2021年 | 4篇 |
2020年 | 4篇 |
2019年 | 16篇 |
2018年 | 10篇 |
2017年 | 8篇 |
2016年 | 11篇 |
2015年 | 9篇 |
2014年 | 8篇 |
2013年 | 133篇 |
2011年 | 10篇 |
2010年 | 4篇 |
2009年 | 4篇 |
2008年 | 7篇 |
2007年 | 10篇 |
2006年 | 4篇 |
2005年 | 9篇 |
2004年 | 4篇 |
2003年 | 6篇 |
2002年 | 6篇 |
1999年 | 8篇 |
1996年 | 7篇 |
1995年 | 8篇 |
1994年 | 10篇 |
1993年 | 6篇 |
1992年 | 7篇 |
1991年 | 7篇 |
1990年 | 5篇 |
1989年 | 9篇 |
1988年 | 10篇 |
1987年 | 9篇 |
1986年 | 8篇 |
1985年 | 7篇 |
1983年 | 5篇 |
1982年 | 8篇 |
1980年 | 5篇 |
1979年 | 5篇 |
1978年 | 4篇 |
1977年 | 4篇 |
1976年 | 3篇 |
1975年 | 7篇 |
1974年 | 6篇 |
1973年 | 9篇 |
1972年 | 9篇 |
1971年 | 10篇 |
1970年 | 6篇 |
1969年 | 6篇 |
1968年 | 7篇 |
1967年 | 3篇 |
1966年 | 3篇 |
1948年 | 3篇 |
排序方式: 共有487条查询结果,搜索用时 15 毫秒
11.
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. 相似文献
12.
13.
Russell W. Ramsey 《Defense & Security Analysis》1996,12(2):227-237
14.
15.
Inspection procedures may at times pose a hazard to the system being monitored. In this article, a simple hazardous-inspection model is considered. The character of the optimal ongoing inspection policy (for inspections subsequent to the first) is reviewed, and the possible forms of the optimal initiation policy are established. Efficient computational procedures are developed for calculating optimal policies. Some discussion is included of the counterintuitive nature of some of the results. 相似文献
16.
17.
About thirty references that feature naval logistics environments are considered. All are unclassified and all appear in the open literature or are available from the Defense Logistics Studies Information Exchange. Three approaches are identified–data analysis, theoretical models, and readiness indexes–and conclusions are presented as to possibilities for answering two questions: (a) Can the unit do the job? (b) How does readiness depend on resources? Four cases are treated in detail to illustrate methodology. 相似文献
18.
The problem of multiple-resource capacity planning under an infinite time horizon is analyzed using a nonlinear programming model. The analysis generalizes to the long term the short-run pricing model for computer networks developed in Kriebel and Mikhail [5]. The environment assumes heterogeneous resource capacities by age (vingate), which service a heterogeneous and relatively captive market of users with known demand functions in each time period. Total variable operating costs are given by a continuous psuedoconcave function of system load, capacity, and resource age. Optimal investment, pricing, and replacement decision rules are derived in the presence of economies of scale and exogenous technological progress. Myopic properties of the decision rules which define natural (finite) planning subhorizons are discussed. 相似文献
19.
20.