全文获取类型
收费全文 | 593篇 |
免费 | 15篇 |
出版年
2021年 | 11篇 |
2019年 | 21篇 |
2018年 | 11篇 |
2017年 | 11篇 |
2016年 | 15篇 |
2015年 | 13篇 |
2014年 | 13篇 |
2013年 | 139篇 |
2009年 | 6篇 |
2008年 | 8篇 |
2007年 | 5篇 |
2006年 | 5篇 |
2005年 | 9篇 |
2004年 | 9篇 |
2003年 | 6篇 |
2002年 | 6篇 |
2000年 | 7篇 |
1998年 | 10篇 |
1997年 | 16篇 |
1996年 | 10篇 |
1995年 | 5篇 |
1994年 | 10篇 |
1993年 | 5篇 |
1992年 | 8篇 |
1991年 | 15篇 |
1990年 | 6篇 |
1989年 | 7篇 |
1988年 | 12篇 |
1987年 | 16篇 |
1986年 | 11篇 |
1985年 | 8篇 |
1984年 | 6篇 |
1983年 | 9篇 |
1982年 | 8篇 |
1981年 | 6篇 |
1980年 | 7篇 |
1979年 | 14篇 |
1978年 | 7篇 |
1977年 | 8篇 |
1976年 | 8篇 |
1975年 | 8篇 |
1974年 | 7篇 |
1973年 | 13篇 |
1972年 | 9篇 |
1971年 | 7篇 |
1970年 | 10篇 |
1969年 | 7篇 |
1968年 | 5篇 |
1967年 | 8篇 |
1966年 | 5篇 |
排序方式: 共有608条查询结果,搜索用时 15 毫秒
151.
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. 相似文献
152.
An implicit enumeration algorithm is developed to determine the set of efficient points in zero-one multiple criteria problems. The algorithm is specialized for the solution of a particular class of facility location problems. The procedure is complemented with the use of the utility function of the decision maker to identify a subset of efficient point candidates for the final selection. Computational results are provided and discussed. 相似文献
153.
Averill M. Law 《海军后勤学研究》1980,27(1):131-143
In this paper we precisely define the two types of simulations (terminating and steady-state) with regard to analysis of simulation output and discuss some common measures of performance for each type. In addition, we conclude, on the basis of discussions with many simulation practitioners, that both types of simulations are important in practice. This is contrary to the impression one gets from reading the simulation literature, where the steady-state case is almost exclusively considered. Although analyses of terminating simulations are considerably easier than are those of steady-state simulations, they have not received a careful treatment in the literature. We discuss and give empirical results for fixed sample size, relative width, and absolute width procedures that can be used for constructing confidence intervals for measures of performance in the terminating case. 相似文献
154.
This note consists of developing a method for enforcing additional constraints to linear fractional programs and showing its usefulness in solving integer linear fractional programs. 相似文献
155.
M. Mazumdar 《海军后勤学研究》1969,16(2):199-206
This paper obtains the uniformly minimum variance unbiased estimates of two indices of performance of a system which alternates between two states “up” or “down” in accordance with a Markov process. The two indices are (1) operational readiness, which measures the probability that the system will be up when needed; and (2) operational reliability, which measures the probability that the system will be up during the entire time of need. For the purpose of obtaining these estimates, two types of observations are considered: (a) those which reveal only the state of system at isolated time-points, and (b) those which continuously record the duration of the “up” and “down” times of the system. 相似文献
156.
This paper considers a problem of locating new facilities in the plane with respect to existing facilities, the locations of which are known. The problem consists of finding locations of new facilities which will minimize a total cost function which consists of a sum of costs directly proportional to the Euclidian distances among the new facilities, and costs directly proportional to the Euclidian distances between new and existing facilities. It is established that the total cost function has a minimum; necessary conditions for a mimumum are obtained; necessary and sufficient conditions are obtained for the function to be strictly convex (it is always convex); when the problem is “well structured,” it is established that for a minimum cost solution the locations of the new facilities will lie in the convex hull of the locations of the existing facilities. Also, a dual to the problem is obtained and interpreted; necessary and sufficient conditions for optimum solutions to the problem, and to its dual, are developed, as well as complementary slackness conditions. Many of the properties to be presented are motivated by, based on, and extend the results of Kuhn's study of the location problem known as the General Fermat Problem. 相似文献
157.
This paper analyzes the problem faced by a field commander who, confronted by an enemy on N battlefields, must determine an interdiction policy for the enemy's logistics system which minimizes the amount of war material flowing through this system per unit time. The resource utilized to achieve this interdiction is subject to constraint. It can be shown that this problem is equivalent to determining the set of arcs Z* to remove subject to constraint from a directed graph G such that the resulting maximal flow is minimized. A branch and bound algorithm for the solution to this problem is described, and a numerical example is provided. 相似文献
158.
Carl M. Harris 《海军后勤学研究》1971,18(1):103-110
Some general results are derived for single-channel queues with Poisson input and state-dependent Erlang service times in view of the possible use of this model to approximate arbitrary M/G/1-like state-dependent queues in a manner similar to that suggested by Rosenshine, and by Kendall, and Kotiah, Thompson, and Waugh for the M/G/1. Numerical procedures are indicated for the evaluation of stationary state probabilities, expected system sizes and waiting times, and parameter estimation. 相似文献
159.
M. J. Magazine 《海军后勤学研究》1971,18(2):177-183
D. P. Heyman, M. Sobel, and M. J. Magazine among others have shown existence of an optimal policy for control of single server queuing systems. For queues under periodic review existence of an analogous rule is established for multi-server systems. Formulation as a dynamic programming problem is given and proofs for existence are presented for finite horizon, infinite horizon and average cost criteria. 相似文献
160.
M. L. Juncosa 《海军后勤学研究》1971,18(2):231-242
For a young science and even for most old ones, the intensity and variety of activities involved in computer science are unsurpassed. In an effort to provide the extremely varied training needed in the field, curriculum planners have tended to slight probability and statistics. Rarely has it been a requisite and only occasionally a desired elective However, not only is an adequate foundation in probability and statistics necessary for such external computer applications as tracking and other data reduction, Monte Carlo techniques, gaming, operations research, traffic analyses, etc., but it also plays an important role in internal applications to computer science and technology This effort in Rand's continuing study of computational mathematics and its applications offers a number of examples in various areas of computational mathematics and computing machine arithmetic-to say nothing of computer design, time sharing, and the like-to support the thesis that probability and statistics should be a requisite, not simply an elective or, even worse, ignored, at any institution offering a program in computer science. Further more, a potentially profitable source of research problems can be found in the interface between probability and statistics and computer science. 相似文献