全文获取类型
收费全文 | 112篇 |
免费 | 2篇 |
专业分类
114篇 |
出版年
2020年 | 1篇 |
2019年 | 5篇 |
2018年 | 2篇 |
2017年 | 6篇 |
2016年 | 1篇 |
2015年 | 1篇 |
2014年 | 5篇 |
2013年 | 46篇 |
2012年 | 1篇 |
2010年 | 2篇 |
2009年 | 1篇 |
2007年 | 1篇 |
2002年 | 1篇 |
2001年 | 1篇 |
2000年 | 2篇 |
1999年 | 1篇 |
1998年 | 3篇 |
1997年 | 1篇 |
1996年 | 2篇 |
1995年 | 2篇 |
1994年 | 1篇 |
1993年 | 2篇 |
1992年 | 3篇 |
1990年 | 1篇 |
1989年 | 2篇 |
1988年 | 3篇 |
1987年 | 2篇 |
1986年 | 2篇 |
1985年 | 2篇 |
1982年 | 1篇 |
1978年 | 1篇 |
1977年 | 1篇 |
1976年 | 1篇 |
1971年 | 1篇 |
1970年 | 1篇 |
1969年 | 1篇 |
1968年 | 1篇 |
1967年 | 3篇 |
排序方式: 共有114条查询结果,搜索用时 0 毫秒
51.
In this article, we present a multistage model to optimize inventory control decisions under stochastic demand and continuous review. We first formulate the general problem for continuous stages and use a decomposition solution approach: since it is never optimal to let orders cross, the general problem can be broken into a set of single‐unit subproblems that can be solved in a sequential fashion. These subproblems are optimal control problems for which a differential equation must be solved. This can be done easily by recursively identifying coefficients and performing a line search. The methodology is then extended to a discrete number of stages and allows us to compute the optimal solution in an efficient manner, with a competitive complexity. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 32–46, 2016 相似文献
52.
Peter Jones 《战略研究杂志》2013,36(3):137-154
In this contribution, Jones focuses initially on the experience of Arms Control and Regional Security (ACRS) and the reasons why this group stalled. The sources of tension that emerged in ACRS, and which ultimately led to its suspension, derived mainly from different views on the relationship between the nuclear and other issues in these talks, as well as the composition of ACRS and its role as a group of the multilateral track of the peace process. Jones emphasizes that regional security discussions in the Middle East must address multiple threats on multiple levels, and ACRS was never politically equipped to do so. Thus, despite the real, if limited, success of ACRS, any real security regime in the Middle East will be the product of a much more inclusive process which recognizes the essential importance of cooperatively addressing multiple security challenges, including those related to the problems of social and economic upheaval in the region. Jones concludes with an argument that the time may be ripe to embark on such a process in the wake of the war in Iraq and other far-reaching indicators of change in the region. 相似文献
53.
54.
The optimal linear combination of control variates in the presence of asymptotically negligible bias
The optimal linear combination of control variates is well known when the controls are assumed to be unbiased. We derive here the optimal linear combination of controls in the situation where asymptotically negligible bias is present. The small-sample linear control which minimizes the mean square error (MSE) is derived. When the optimal asymptotic linear control is used rather than the optimal small-sample control, the degradation in MSE is c/n3, where n is the sample size and c is a known constant. This analysis is particulary relevant to the small-sample theory for control variates as applied to the steady-state estimation problem. Results for the method of multiple estimates are also given. 相似文献
55.
n periodic tasks are to be processed by a single machine, where each task i has a maximum request rate or periodicity Fi, a processing time Ei, a deadline Di, relative to each request of task i, a task-request interrupt overhead Ii, and a task-independent scheduling overhead S. Two scheduling strategies are considered for sequencing the execution of an arbitrary arrangement of task requests in time: the preemptive and the nonpreemptive earliest-deadline algorithms. Necessary and sufficient conditions are derived for establishing whether a given set of tasks can be scheduled by each scheduling strategy. The conditions are given in the form of limited simulations of a small number of well-defined task-request arrangements. If all simulations succeed, the schedule is feasible for the given set of tasks. If any simulation fails, the schedule is infeasible. While interrupt handling and scheduling overheads can be handled by such simulations, context switching overhead resulting from preemption cannot. A counterexample illustrates how the simulations fail to uncover unschedulable task sets when context switching overhead is considered. 相似文献
56.
On-site verification of ICBMs in the context of an arms control agreement might involve a situation where an inspector would choose one or more of a number of identical areas to inspect and would have confidence that the other areas had the same characteristics. This article considers optimal attack and defense of missiles deceptively based in a number of identical areas. The attacker may allocate warheads across areas as he desires and uniformly within areas. The defender may allocate interceptors across areas as he desires and either uniformly or preferentially within areas. The effect of restricting the defender to uniform allocation across areas is explored for various assumptions. Robustness of surviving missiles with respect to the number of attacking warheads is studied. Results are presented for a wide range of cases. 相似文献
57.
L. Peter Jennergren 《海军后勤学研究》1977,24(2):373-376
Three different solutions to a very simple transfer pricing problem are outlined and contrasted. These are labeled by their authors: Hirshleifer, Enzer, and Ronen and McKinney. Weaknesses associated with each solution are pointed out. 相似文献
58.
Proposed is a Heuristic Network (HN) Procedure for balancing assembly lines. The procedure uses simple heuristic rules to generate a network which is then traversed using a shortest route algorithm to obtain a heuristic solution. The advantages of the HN Procedure are: a) it generally yields better solutions than those obtained by application of the heuristics, and b) sensitivity analysis with different values of cycle time is possible without having to regenerate the network. The rationale for its effectiveness and its application to problems with paralleling are presented. Computational experience with the procedure on up to 50 task test problems is provided. 相似文献
59.
Peter J. Kalman 《海军后勤学研究》1970,17(4):547-553
In this paper a stochastically constrained replacement model is formulated. This model determines a sequence of replacement dates such that the total “current account” cost of all future costs and capital expenditures over an infinite time horizon for the n initial incumbent machines is minimized subject to the constraints that an expected number of machines are in a chosen utility class at any point in time. We then indicate one possible solution method for the model. 相似文献
60.