全文获取类型
收费全文 | 526篇 |
免费 | 33篇 |
国内免费 | 13篇 |
出版年
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 毫秒
101.
102.
103.
104.
Richard B. White 《The Nonproliferation Review》2014,21(3-4):261-274
The Indian government has not made a public comment about the status of its nuclear weapon program since approving a nuclear doctrine in 2003. However, there is now enough information in the public domain to determine that the command-and-control system for the nuclear program has steadily matured in accordance with the intent of the approved nuclear doctrine. The Indian government has successfully mitigated many of the issues that plague the conventional military. The result is a basic command-and-control system that is focused only on the delivery, if ordered by the prime minister, of nuclear weapons. The system is not as robust as those of the United States and Russia, but is in place and ready as new Indian nuclear weapons enter into operation. The command-and-control system is developing to meet India's needs and political compulsions, but not necessarily as part of a more assertive nuclear policy. 相似文献
105.
Edward G. Keating Irv Blickstein Michael Boito Jess Chandler Deborah Peetz 《Defence and Peace Economics》2014,25(3):271-280
Building on prior work on optimal replacement of aging aircraft, this paper presents three methodologies to evaluate prospective aviation Service Life Extension Programs (SLEPs) and applies these methodologies to US Navy F/A-18E/F data. While considerable uncertainty remains as to the values of key parameters (e.g. the cost of F/A-18E/F SLEPs), the preponderance of the evidence available at this juncture favors undertaking SLEPs on F/A-18E/Fs rather than replacing them with new Joint Strike Fighters. 相似文献
106.
We address the problem of dispatching a vehicle with different product classes. There is a common dispatch cost, but holding costs that vary by product class. The problem exhibits multidimensional state, outcome and action spaces, and as a result is computationally intractable using either discrete dynamic programming methods, or even as a deterministic integer program. We prove a key structural property for the decision function, and exploit this property in the development of continuous value function approximations that form the basis of an approximate dispatch rule. Comparisons on single product‐class problems, where optimal solutions are available, demonstrate solutions that are within a few percent of optimal. The algorithm is then applied to a problem with 100 product classes, and comparisons against a carefully tuned myopic heuristic demonstrate significant improvements. © 2003 Wiley Periodicals, Inc. Naval Research Logistics 50: 742–769, 2003. 相似文献
107.
In many practical manufacturing environments, jobs to be processed can be divided into different families such that a setup is required whenever there is a switch from processing a job of one family to another job of a different family. The time for setup could be sequence independent or sequence dependent. We consider two particular scheduling problems relevant to such situations. In both problems, we are given a set of jobs to be processed on a set of identical parallel machines. The objective of the first problem is to minimize total weighted completion time of jobs, and that of the second problem is to minimize weighted number of tardy jobs. We propose column generation based branch and bound exact solution algorithms for the problems. Computational experiments show that the algorithms are capable of solving both problems of medium size to optimality within reasonable computational time. © 2003 Wiley Periodicals, Inc. Naval Research Logistics 50: 823–840, 2003. 相似文献
108.
109.
We present variants of a convergent Lagrangean relaxation algorithm for minimizing a strictly convex separable quadratic function over a transportation polytope. The algorithm alternately solves two “subproblems,” each of which has an objective function that is defined by using Lagrange multipliers derived from the other. Motivated by the natural separation of the subproblems into independent and very easily solved “subsubproblems,” the algorithm can be interpreted as the cyclic coordinate ascent method applied to the dual problem. We exhibit our computational results for different implementations of the algorithm applied to a set of large constrained matrix problems. 相似文献
110.
Tolerance limits which control both tails of the normal distribution so that there is no more than a proportion β1 in one tail and no more than β2 in the other tail with probability γ may be computed for any size sample. They are computed from X? - k1S and X? - k2S, where X? and S are the usual sample mean and standard deviation and k1 and k2 are constants previously tabulated in Odeh and Owen [3]. The question addressed is, “Just how accurate are the coverages of these intervals (– Infin;, X? – k1S) and (X? + k2S, ∞) for various size samples?” The question is answered in terms of how widely the coverage of each tail interval differs from the corresponding required content with a given confidence γ′. 相似文献