全文获取类型
收费全文 | 582篇 |
免费 | 9篇 |
出版年
2021年 | 7篇 |
2020年 | 7篇 |
2019年 | 12篇 |
2018年 | 8篇 |
2017年 | 12篇 |
2016年 | 13篇 |
2015年 | 5篇 |
2014年 | 9篇 |
2013年 | 120篇 |
2009年 | 7篇 |
2007年 | 12篇 |
2005年 | 5篇 |
2004年 | 5篇 |
2003年 | 9篇 |
2002年 | 8篇 |
2001年 | 5篇 |
2000年 | 5篇 |
1999年 | 5篇 |
1998年 | 8篇 |
1997年 | 10篇 |
1996年 | 11篇 |
1995年 | 9篇 |
1994年 | 9篇 |
1993年 | 12篇 |
1992年 | 13篇 |
1991年 | 15篇 |
1990年 | 11篇 |
1989年 | 20篇 |
1988年 | 16篇 |
1987年 | 13篇 |
1986年 | 16篇 |
1985年 | 13篇 |
1984年 | 5篇 |
1983年 | 5篇 |
1982年 | 11篇 |
1981年 | 7篇 |
1980年 | 10篇 |
1979年 | 10篇 |
1978年 | 11篇 |
1977年 | 7篇 |
1976年 | 7篇 |
1975年 | 7篇 |
1974年 | 13篇 |
1973年 | 9篇 |
1972年 | 4篇 |
1971年 | 7篇 |
1970年 | 9篇 |
1969年 | 6篇 |
1967年 | 7篇 |
1948年 | 4篇 |
排序方式: 共有591条查询结果,搜索用时 15 毫秒
231.
James G. Taylor 《海军后勤学研究》1974,21(4):683-704
We develop solutions to two fire distribution problems for a homogeneous force in Lanchester combat against heterogeneous enemy forces. The combat continues over a period of time with a choice of tactics available to the homogeneous force and subject to change with time. In these idealized combat situations the lethality of each force's fire (as expressed by the Lanchester attrition-rate coefficient) depends upon time. Optimal fire distribution rules are developed through the combination of Lanchester-type equations for combat attrition and deterministic optimal control theory (Pontryagin maximum principle). Additionally, the theory of state variable inequality constraints is used to treat the nonnegativity of force levels. The synthesis of optimal fire distribution policies was facilitated by exploiting special mathematical structures in these problems. 相似文献
232.
In this paper, we consider the problem of minimizing the mean flow time of jobs to be processed on two machines. The jobs have a predetermined order, perhaps reflecting the order of arrival, and each job has a known processing time. We wish to assign the jobs to machines so as to minimize the mean flow time, with the constraint that the original order must be preserved within the subset of jobs assigned to each machine. An efficient algorithm based on dynamic programming is developed. 相似文献
233.
J. R. Callahan 《海军后勤学研究》1973,20(2):321-324
Sufficient conditions are developed for the ergodicity of a single server, first-come-first-serve queue with waiting time dependent service times. 相似文献
234.
James H. Patterson 《海军后勤学研究》1973,20(4):767-784
The applicability of critical path scheduling is limited by the inability of the algorithm to cope with conflicting resource demands. This paper is an assessment of the effectiveness of many of the heuristic extensions to the critical path method which resolve the conflicts that develop between the resources demanded by an activity and those available. These heuristic rules are evaluated on their ability to solve a large multiproject scheduling problem. 相似文献
235.
An algorithm designed to solve a large class of nonconvex max-min problems is described. Its usefulness and applicability is demonstrated by solving an extension of a recently introduced model which optimally allocates strategic weapon systems. The extended model is shown to be equivalent to a nonconvex mathematical program with an infinite number of constraints, and hence is not solvable by conventional procedures. An example is worked out in detail to illustrate the algorithm. 相似文献
236.
This paper describes a method for determining optimal repair and replacement policies for aireraft, with specific reference to the F–4. The objective of the analysis is to choose the set of policies from all possible alternatives over a finite planning horizon which minimizes the cost of operations. A dynamic program is presented which seeks an optimal path through a series of decision periods, when each period begins with the choice of keeping an aircraft, reworking it before further operation, or buying a new one. We do not consider changes in technology. Therefore, when a replacement does occur, it is made with a similar aircraft. Multivariate statistical techniques are used to estimate the relevant costs as a function of age, and time since last rework. 相似文献
237.
238.
239.
240.