全文获取类型
收费全文 | 507篇 |
免费 | 17篇 |
国内免费 | 1篇 |
出版年
2021年 | 5篇 |
2020年 | 5篇 |
2019年 | 12篇 |
2018年 | 7篇 |
2017年 | 14篇 |
2016年 | 11篇 |
2015年 | 7篇 |
2014年 | 10篇 |
2013年 | 123篇 |
2012年 | 5篇 |
2011年 | 6篇 |
2010年 | 7篇 |
2009年 | 6篇 |
2008年 | 5篇 |
2007年 | 6篇 |
2006年 | 8篇 |
2005年 | 6篇 |
2003年 | 5篇 |
2002年 | 5篇 |
2001年 | 5篇 |
2000年 | 5篇 |
1998年 | 5篇 |
1997年 | 7篇 |
1996年 | 9篇 |
1995年 | 8篇 |
1994年 | 9篇 |
1993年 | 11篇 |
1992年 | 12篇 |
1991年 | 15篇 |
1989年 | 10篇 |
1988年 | 7篇 |
1987年 | 10篇 |
1986年 | 10篇 |
1985年 | 14篇 |
1984年 | 7篇 |
1982年 | 5篇 |
1981年 | 5篇 |
1980年 | 11篇 |
1979年 | 7篇 |
1978年 | 9篇 |
1976年 | 8篇 |
1975年 | 10篇 |
1974年 | 10篇 |
1973年 | 10篇 |
1972年 | 5篇 |
1971年 | 5篇 |
1970年 | 8篇 |
1969年 | 5篇 |
1968年 | 7篇 |
1967年 | 5篇 |
排序方式: 共有525条查询结果,搜索用时 15 毫秒
141.
A simple and relatively efficient method for simulating one-dimensional and two-dimensional nonhomogeneous Poisson processes is presented The method is applicable for any rate function and is based on controlled deletion of points in a Poisson process whose rate function dominates the given rate function In its simplest implementation, the method obviates the need for numerical integration of the rate function, for ordering of points, and for generation of Poisson variates. 相似文献
142.
A duality theory is developed for mathematical programs with strictly quasi-concave objective functions to be maximized over a convex set. This work broadens the duality theory of Rockafellar and Peterson from concave (convex) functions to quasi-concave (quasi-convex) functions. The theory is closely related to the utility theory in economics. An example from economic planning is examined and the solution to the dual program is shown to have the properties normally associated with market prices. 相似文献
143.
In this paper, a branch-and-bound procedure is presented for treating the general knapsack problem. The fundamental notion of the procedure involves a variation of traditional branching strategies as well as the incorporation of penalties in order to improve bounds. Substantial computational experience has been obtained, the results of which would indicate the feasibility of the procedure for problems of large size. 相似文献
144.
James R. Evans 《海军后勤学研究》1978,25(1):31-37
The simplex method is interpreted as a labeling procedure for certain classes of multicommodity flow problems in a manner similar to that for single commodity networks. As opposed to general multicommodity algorithms, no explicit matrix inversion is required; all simplex operations are performed graph-theoretically. 相似文献
145.
James G. Taylor 《海军后勤学研究》1978,25(2):323-355
Optimal time-sequential fire-support strategies are studied through a two-person zero-sum deterministic differential game with closed-loop (or feedback) strategies. Lanchester-type equations of warfare are used in this work. In addition to the max-min principle, the theory of singular extremals is required to solve this prescribed-duration combat problem. The combat is between two heterogeneous forces, each composed of infantry and a supporting weapon system (artillery). In contrast to previous work reported in the literature, the attrition structure of the problem at hand leads to force-level-dependent optimal fire-support strategies with the attacker's optimal fire-support strategy requiring him to sometimes split his artillery fire between enemy infantry and artillery (counterbattery fire). A solution phenomnon not previously encountered in Lanchester-type differential games is that the adjoint variables may be discontinuous across a manifold of discontinuity for both players' strategies. This makes the synthesis of optimal strategies particularly difficult. Numerical examples are given. 相似文献
146.
A model is developed which may be used to determine the expected total cost of quality control per inspection lot under acceptance sampling by variables where several characteristics are to be simultaneously controlled. Optimization of the model is accomplished through the application of a conventional search procedure. The sensitivity of the model and the optimum solution to the shape of the underlying probability distributions is discussed and associated analyses are presented through an example. 相似文献
147.
This paper develops a mathematical theory for predicting force annihilation from initial conditions without explicitly computing force-level trajectories for deterministic Lanchester-type “square-law” áttrition equations for combat between two homogeneous forces with temporal variations in fire effectivenesses (as expressed by the Lanchester attrition-rate coefficients). It introduces a canonical auxiliary parity-condition problem for the determination of a single parity-condition parameter (“the enemy force equivalent of a friendly force of unit strength”) and new exponential-like general Lanchester functions. Prediction of force annihilation within a fixed finite time would involve the use of tabulations of the quotient of two Lanchester functions. These force-annihilation results provide further information on the mathematical properties of hyperbolic-like general Lanchester functions: in particular, the parity-condition parameter is related to the range of the quotient of two such hyperbolic-like general Lanchester functions. Different parity-condition parameter results and different new exponential-like general Lanchester functions arise from different mathematical forms for the attrition-rate coefficients. This theory is applied to general power attrition-rate coefficients: exact force-annihilation results are obtained when the so-called offset parameter is equal to zero; while upper and lower bounds for the parity-condition parameter are obtained when the offset parameter is positive. 相似文献
148.
We examine the setup and improvement policies for a production process with multiple performance states. Assume that the production process deteriorates randomly over time, following a Markovian process with known transition probabilities. In order to reduce the production cost incurred because of process deterioration, the process is inspected at the end of each period. Then one of three actions may be taken: do nothing, perform routine process setup, or perform routine setup and process improvement. The routine setup operation returns the process to its best performance state, whereas the process improvement action may reduce future production and setup costs and improve the process-state transition probabilities. A discounted Markovian model is formulated to find the strategy that minimizes the total cost of operating the production process. © 1997 John Wiley & Sons, Inc. Naval Research Logistics 44: 383–400, 1997 相似文献
149.
Gerald G. Brown Kelly J. Cormican Siriphong Lawphongpanich Daniel B. Widdis 《海军后勤学研究》1997,44(4):301-318
Submarine berthing plans reserve mooring locations for inbound U.S. Navy nuclear submarines prior to their port entrance. Once in port, submarines may be shifted to different berthing locations to allow them to better receive services they require or to make way for other shifted vessels. However, submarine berth shifting is expensive, labor intensive, and potentially hazardous. This article presents an optimization model for submarine berth planning and demonstrates it with Naval Submarine Base, San Diego. After a berthing plan has been approved and published, changed requests for services, delays, and early arrival of inbound submarines are routine events, requiring frequent revisions. To encourage trust in the planning process, the effect on the solution of revisions in the input is kept small by incorporating a persistence incentive in the optimization model. © 1997 John Wiley & Sons, Inc. Naval Research Logistics 44: 301–318, 1997. 相似文献
150.
The authors study a discrete-time, infinite-horizon, dynamic programming model for the replacement of components in a binary k-out-of-n failure system. (The system fails when k or more of its n components fail.) Costs are incurred when the system fails and when failed components are replaced. The objective is to minimize the long-run expected average undiscounted cost per period. A companion article develops a branch-and-bound algorithm for computing optimal policies. Extensive computational experiments find it effective for k to be small or near n; however, difficulties are encountered when n ≥ 30 and 10 ≤ k ≤ n − 4. This article presents a simple, intuitive heuristic rule for determining a replacement policy whose memory storage and computation time requirements are O(n − k) and O(n(n − k) + k), respectively. This heuristic is based on a plausible formula for ranking components in order of their usefulness. The authors provide sufficient conditions for it to be optimal and undertake computational experiments that suggest that it handles parallel systems (k = n) effectively and, further, that its effectiveness increases as k moves away from n. In our test problems, the mean relative errors are under 5% when n ≤ 100 and under 2% when k ≤ n − 3 and n ≤ 50. © 1997 John Wiley & Sons, Inc. Naval Research Logistics 44, 273–286, 1997. 相似文献