全文获取类型
收费全文 | 569篇 |
免费 | 22篇 |
国内免费 | 1篇 |
专业分类
592篇 |
出版年
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条查询结果,搜索用时 0 毫秒
481.
482.
We present techniques for classifying Markov chains with a continuous state space as either ergodic or recurrent. These methods are analogous to those of Foster for countable space chains. The theory is presented in the first half of the paper, while the second half consists of examples illustrating these techniques. The technique for proving ergodicity involves, in practice, three steps: showing that the chain is irreducible in a suitable sense; verifying that the mean hitting times on certain (usually bounded) sets are bounded, by using a “mean drift” criterion analogous to that of Foster; and finally, checking that the chain is such that bounded mean hitting times for these sets does actually imply ergodicity. The examples comprise a number of known and new results: using our techniques we investigate random walks, queues with waiting-time-dependent service times, dams with general and random-release rules, the s-S inventory model, and feedback models. 相似文献
483.
A. S. Andreou ? K. E. Parsopoulos ? M. N. Vrahatis § G. A. Zombanakis 《Defence and Peace Economics》2013,24(5):481-495
The issue that this paper tackles is the assessment of the relative security benefits that Cyprus and Greece derive in the context of their cooperation on defence matters. This form of cooperation, known as the ‘Integrated Defence Space Doctrine’, aims at defending their interests in the Aegean Sea and the broader East Mediterranean theatre. The paper relies heavily on earlier research on this topic, which deals with the Greek–Cypriot alliance facing an arms race against Turkey, and uses a coefficient especially designed to assess the optimal levels of security and the associated defence expenditure of the two allies. A comparison of the relative security coefficient values for the two allies suggests that the security benefit that Greece derives thanks to its alliance with Cyprus exceeds the corresponding Cypriot benefit by far. Given the importance assigned to human resources by this index, in conjunction with the demographic problems of Greece, this conclusion justifies the recent Greek defence policy revision, emphasizing quality, capital equipment and flexibility of forces. This revision aims at satisfying the security requirements of the alliance and the increasing demands of an arms race against Turkey. 相似文献
484.
485.
486.
W. E. Wallace 《海军后勤学研究》1985,32(1):21-26
MIL-STD-781 specifies reliability acceptance test procedures based on both fixed-length tests and probability ratio sequential tests. The assumption underlying MIL-STD-781 is a constant mean time between failures (MTBF) and typical practice applies MIL-STD-781 to electrical, electronic, and mechanical equipment. This article discusses some of the difficulties that have prompted the C and D revisions of MIL-STD-781. In addition, it discusses the relationship of MIL-STD-781 with MIL-STD-1635(EC) which deals with reliability growth testing. The article concludes with a discussion of needed research in reliability growth testing, in support of MIL-STD-781, and in the area of stress and its impact of MTBF. 相似文献
487.
Robert G. Brown 《海军后勤学研究》1968,15(2):281-286
A flexible simulation system has been designed to permit investigation of sequencing rules in a large job shop, with continual input of new work. The objective is to understand what happens rather than to find optimum rules, with many conflicting measures of effectiveness: work in process, finished goods investment, delays, machine and labor utilization, and effort to implement. A few problem areas have been explored. 相似文献
488.
The idea of combining relatively simple continuous methods with discrete procedures is used for the construction of suboptimal algorithms for quadratic assignment problems. Depending on the nature of the special problem these steps may vary in complexity. The simplest procedures require minimum storage space and result in tolerable computation times. Different choices of parameters and random variations may be used in order to obtain statistical distributions of suboptimal solutions. Computational results for sample problems indicate improvements on results of Steinberg, Gilmore, and Hillier and Connors. 相似文献
489.
To solve linear fixed charge problems with Murty's vertex ranking algorithm, one uses a simplex algorithm and a procedure to determine the vertices adjacent to a given vertex. In solving fixed charge transportation problems, the simplex algorithm simplifies to the stepping-stone algorithm. To find adjacent vertices on transportation polytopes, we present a procedure which is a simplification of a more general procedure for arbitrary polytopes. 相似文献
490.