全文获取类型
| 收费全文 | 905篇 |
| 免费 | 0篇 |
专业分类
| 905篇 |
出版年
| 2021年 | 10篇 |
| 2019年 | 18篇 |
| 2018年 | 8篇 |
| 2017年 | 19篇 |
| 2016年 | 17篇 |
| 2015年 | 16篇 |
| 2014年 | 19篇 |
| 2013年 | 165篇 |
| 2012年 | 8篇 |
| 2010年 | 9篇 |
| 2009年 | 14篇 |
| 2007年 | 16篇 |
| 2006年 | 9篇 |
| 2005年 | 10篇 |
| 2004年 | 13篇 |
| 2003年 | 11篇 |
| 2002年 | 14篇 |
| 2000年 | 8篇 |
| 1999年 | 9篇 |
| 1998年 | 17篇 |
| 1997年 | 15篇 |
| 1996年 | 13篇 |
| 1995年 | 7篇 |
| 1994年 | 21篇 |
| 1993年 | 23篇 |
| 1992年 | 16篇 |
| 1991年 | 21篇 |
| 1990年 | 15篇 |
| 1989年 | 28篇 |
| 1988年 | 25篇 |
| 1987年 | 23篇 |
| 1986年 | 26篇 |
| 1985年 | 19篇 |
| 1984年 | 11篇 |
| 1983年 | 10篇 |
| 1982年 | 15篇 |
| 1981年 | 14篇 |
| 1980年 | 11篇 |
| 1979年 | 16篇 |
| 1978年 | 18篇 |
| 1977年 | 7篇 |
| 1976年 | 11篇 |
| 1975年 | 9篇 |
| 1974年 | 15篇 |
| 1973年 | 10篇 |
| 1972年 | 12篇 |
| 1971年 | 11篇 |
| 1970年 | 14篇 |
| 1969年 | 10篇 |
| 1967年 | 10篇 |
排序方式： 共有905条查询结果，搜索用时 15 毫秒
681.
“Smart Defense” is NATO's new approach to risk- and burden-sharing, which has been a chronic problem within the alliance since the 1950s. Numerous solutions have been proposed, but initiatives resulting in more equitable burden-sharing have never been fully implemented. There are two driving forces influencing a county's willingness to support such initiatives – the economic theory of alliances and the risks posed by the implementation of capability sharing. The authors examine each of these and propose that rather than aiming for group consensus on the production of capabilities, NATO should focus on interoperability through support functions. This approach provides the most likely solution for connecting the forces, doctrine, procedures, standards and other factors of joint capability production such that country leaders find the risks of doing so to be politically and militarily acceptable. 相似文献
682.
Previous research on the scheduling of multimachine systems has generally focused on the optimization of individual performance measures. This article considers the sequencing of jobs through a multimachine flow shop, where the quality of the resulting schedule is evaluated according to the associated levels of two scheduling criteria, schedule makespan (Cmax) and maximum job tardiness (Tmax). We present constructive procedures that quantify the trade-off between Cmax and Tmax. The significance of this trade-off is that the optimal solution for any preference function involving only Cmax and Tmax must be contained among the set of efficient schedules that comprise the trade-off curve. For the special case of two-machine flow shops, we present an algorithm that identifies the exact set of efficient schedules. Heruistic procedures for approximating the efficient set are also provided for problems involving many jobs or larger flow shops. Computational results are reported for the procedures which indicate that both the number of efficient schedules and the error incurred by heuristically approximating the efficient set are quite small. 相似文献
683.
684.
Two new randomization tests are introduced for ordinal contingency tables for testing independence against strictly positive quadrant dependence, i.e., P(X > x,Y > y) ≥ P(X > x)P(Y > y) for all x,y with strict inequality for some x and y. For a number of cases, simulation is used to compare the estimated power of these tests versus those standard tests based on Kendall's T, Spearman's p, Pearson's X2, the usual likelihood ratio test, and a test based upon the log-odds ratio. In these cases, subsets of the alternative region are identified where each of the testing statistics is superior. The new tests are found to be more powerful than the standard tests over a broad range of the alternative regions for these cases. 相似文献
685.
In this paper we consider computation techniques associated with the optimization of large scale Markov decision processes. Markov decision processes and the successive approximation procedure of White are described. Then a procedure for scaling continuous time and renewal processes so that they are amenable to the White procedure is discussed. The effect of the scale factor value on the convergence rate of the procedure and insights into proper scale factor selection are given. 相似文献
686.
Alan J. Rolfe 《海军后勤学研究》1970,17(2):151-158
This paper considers a group of S identical aircraft, each of which is partitioned into K parts which fail exponentially. The only way in which a failed aircraft can be repaired is by cannibalizing its out-of-commission parts from other failed aircraft. The evolution of the number of good aircraft over time is governed by the transient behavior of an absorbing Markov chain. We can therefore study this behavior by matrix multiplication although the computational problem grows large for K ≥ 3. Some numerical results and some approximations are also provided. 相似文献
687.
Problems having the mathematical structure of a quadratic assignment problem are found in a diversity of contexts: by the economist in assigning a number of plants or indivisible operations to a number of different geographical locations; by the architect or indusatrial engineer in laying out activities, offices, or departments in a building; by the human engineer in arranging the indicators and controls in an operators control room; by the electronics engineer in laying out components on a backboard; by the computer systems engineer in arranging information in drum and disc storage; by the production scheduler in sequencing work through a production facility; and so on. In this paper we discuss several types of algorithms for solving such problems, presenting a unifying framework for some of the existing algorithms, and dcscribing some new algorithms. All of the algorithms discussed proceed first to a feasible solution and then to better and better feasible solutions, until ultimately one is discovered which is shown to be optimal. 相似文献
688.
C. J. Ancker 《海军后勤学研究》1976,23(4):703-711
In this analysis we extend the theory of stochastic duels to include the situation where one of the contestants fires a single infinitely long burst at a fixed rate of fire and secondly where he fires fixed-length, fixed-rate of fire bursts randomly spaced. In both cases the opponent fires single rounds randomly spaced. Special cases and parameter effects are considered. 相似文献
689.
An algorithm, based upon dynamic programming, is developed for a class of fixed-cost cargo loading problems. The problems can be formulated as integer programming problems, but cannot be efficiently solved as such because of computational difficulties. The algorithm developed has proved to be very efficient in an actual operations research study involving over 500 different cargo items, more than 40 possible stops and several types of transportation vehicles. A numerical illustration is provided. 相似文献
690.