全文获取类型
收费全文 | 526篇 |
免费 | 33篇 |
国内免费 | 13篇 |
专业分类
572篇 |
出版年
2021年 | 6篇 |
2019年 | 14篇 |
2018年 | 13篇 |
2017年 | 13篇 |
2016年 | 11篇 |
2015年 | 10篇 |
2014年 | 16篇 |
2013年 | 117篇 |
2012年 | 14篇 |
2011年 | 6篇 |
2010年 | 7篇 |
2009年 | 13篇 |
2008年 | 4篇 |
2007年 | 5篇 |
2006年 | 7篇 |
2005年 | 4篇 |
2004年 | 6篇 |
2003年 | 10篇 |
2002年 | 5篇 |
2001年 | 6篇 |
2000年 | 19篇 |
1997年 | 7篇 |
1996年 | 8篇 |
1995年 | 4篇 |
1994年 | 7篇 |
1993年 | 13篇 |
1992年 | 8篇 |
1991年 | 11篇 |
1990年 | 5篇 |
1989年 | 11篇 |
1988年 | 12篇 |
1987年 | 8篇 |
1986年 | 11篇 |
1985年 | 10篇 |
1984年 | 7篇 |
1983年 | 7篇 |
1982年 | 5篇 |
1981年 | 5篇 |
1980年 | 10篇 |
1979年 | 10篇 |
1978年 | 8篇 |
1976年 | 9篇 |
1975年 | 12篇 |
1974年 | 11篇 |
1973年 | 10篇 |
1972年 | 9篇 |
1971年 | 8篇 |
1970年 | 8篇 |
1969年 | 8篇 |
1968年 | 8篇 |
排序方式: 共有572条查询结果,搜索用时 15 毫秒
191.
In this paper applications of results obtained by these authors for a generalized version of a problem proposed by Smirnov, are considered. The areas of application explored are system interface, queueing, transportation flow, and sequential analysis. The included table should be invaluable to the reader in applying these results. Finally the relationship between the limiting and exact expressions relating to this table is also explored. 相似文献
192.
This paper is concerned with estimating p = P(X1 < Y …, Xn < Y) or q =P (X < Y1, …, X < Yn) where the X's and Y's are all independent random variables. Applications to estimation of the reliability p from stress-strength relationships are considered where a component is subject to several stresses X1, X2, …, XN whereas its strength, Y, is a single random variable. Similarly, the reliability q is of interest where a component is made of several parts all with their individual strengths Y1, Y2 …, YN and a single stress X is applied to the component. When the X's and Y's are independent and normal, maximum likelihood estimates of p and q have been obtained. For the case N = 2 and in some special cases, minimum variance unbiased estimates have been given. When the Y's are all exponential and the X is normal with known variance, but unknown mean (or uniform between 0 and θ, θ being unknown) the minimum variance unbiased estimate of q is established in this paper. 相似文献
193.
Bol has discussed consequences of the continuity of production correspondences in connection with relations between efficient input and output vectors. Isoquants of continuous production correspondences are used here to extend this work. Simplifications to existing theory are discussed. 相似文献
194.
Using Mills Differential a game value function ?, used in the Kemeny-Morgenstern-Thompson growth model to show the existence of solutions, is discussed. In doing so, several proofs become shorter, in addition known results are seen in a new context. Finally connections between the existence of a so-called economic solution and the differentiability or non-differentiability of function ? are analyzed. 相似文献
195.
James G. Taylor 《海军后勤学研究》1973,20(4):673-697
We develop the solution to a simple problem of target selection in Lanchester combat against two enemy force types each of which undergoes a “linear-law” attrition process. In addition to the Pontryagin maximum principle, the theory of singular extremals is required to solve this problem. Our major contribution is to show how to synthesize the optimal target selection policies from the basic optimality conditions. This solution synthesis methodology is applicable to more general dynamic (tactical) allocation problems. For constant attrition-rate coefficients we show that whether or not changes can occur in target priorities depends solely on how survivors are valued and is independent of the type of attrition process. 相似文献
196.
A series of independent trials is considered in which one of k ≥ 2 mutually exclusive and exhaustive outcomes occurs at each trial. The series terminates when m outcomes of any one type have occurred. The limiting distribution (as m → ∞) of the number of trials performed until termination is found with particular attention to the situation where a Dirichlet distribution is assigned to the k vector of probabilities for each outcome. Applications to series of races involving k runners and to spares problems in reliability modeling are discussed. The problem of selecting a stopping rule so that the probability of the series terminating on outcome i is k?1 (i.e., a “fair” competition) is also studied. Two generalizations of the original asymptotic problem are addressed. 相似文献
197.
During the course of the last few years, attacks on the traveling salesman problem have resulted in a variety of often innovative and rather powerful computational procedures. In this article, we present a review of these results for problems defined on weighted and unweighted graphs. Some account of computational behavior for exact algorithms is provided; however, the primary coverage deals with the strategy of particular procedures. In addition, we include some aspects of nonexact algorithms with major interest confined to the establishment of worst-case bounds. 相似文献
198.
The problem of determining multicommodity flows over a capacitated network subject to resource constraints may be solved by linear programming; however, the number of potential vectors in most applications is such that the standard arc-chain formulation becomes impractical. This paper describes an approach—an extension of the column generation technique used in the multicommodity network flow problem—that simultaneously considers network chain selection and resource allocation, thus making the problem both manageable and optimal. The flow attained is constrained by resource availability and network capacity. A minimum-cost formulation is described and an extension to permit the substitution of resources is developed. Computational experience with the model is discussed. 相似文献
199.
A set of edges D called an isolation set, is said to isolate a set of nodes R from an undirected network if every chain between the nodes in R contains at least one edge from the set D. Associated with each edge of the network is a positive cost. The isolation problem is concerned with finding an isolation set such that the sum of its edge costs is a minimum. This paper formulates the problem of determining the minimal cost isolation as a 0–1 integer linear programming problem. An algorithm is presented which applies a branch and bound enumerative scheme to a decomposed linear program whose dual subproblems are minimal cost network flow problems. Computational results are given. The problem is also formulated as a special quadratic assignment problem and an algorithm is presented that finds a local optimal solution. This local solution is used for an initial bound. 相似文献
200.
Data on 23 lots of various aircraft programs were gathered. Total engineering man-hours, and information on performance, weight, area, avionics systems, data, and schedule were subjected to least squares analysis. An equation is presented which indicates a relationship between total engineering manhours and a set of seven predictor variables. While the equation derived could only be used with confidence by the manufacturer whose data was analyzed, this article should be looked upon as demonstrating a method of data analysis which others may also find useful, not only for predicting engineering manhours in major aircraft programs, but also in other situations where there is an abundance of possible predictor variables, and the problem is to sort out a meaningful subset of these variables. In order to demonstrate the viability of the formula obtained, comparisons were made with various bid programs. 相似文献