全文获取类型
收费全文 | 264篇 |
免费 | 5篇 |
出版年
2019年 | 8篇 |
2018年 | 10篇 |
2017年 | 4篇 |
2016年 | 5篇 |
2015年 | 5篇 |
2014年 | 8篇 |
2013年 | 71篇 |
2012年 | 2篇 |
2011年 | 3篇 |
2009年 | 4篇 |
2007年 | 2篇 |
2005年 | 3篇 |
2004年 | 3篇 |
2003年 | 8篇 |
2002年 | 5篇 |
2001年 | 2篇 |
2000年 | 4篇 |
1998年 | 3篇 |
1997年 | 5篇 |
1996年 | 3篇 |
1995年 | 3篇 |
1994年 | 3篇 |
1993年 | 6篇 |
1992年 | 3篇 |
1991年 | 6篇 |
1990年 | 4篇 |
1989年 | 4篇 |
1988年 | 7篇 |
1987年 | 4篇 |
1986年 | 6篇 |
1985年 | 3篇 |
1984年 | 3篇 |
1983年 | 3篇 |
1982年 | 1篇 |
1981年 | 1篇 |
1980年 | 5篇 |
1979年 | 3篇 |
1978年 | 2篇 |
1977年 | 1篇 |
1976年 | 4篇 |
1975年 | 2篇 |
1974年 | 6篇 |
1973年 | 4篇 |
1972年 | 5篇 |
1971年 | 5篇 |
1970年 | 3篇 |
1969年 | 6篇 |
1968年 | 3篇 |
1966年 | 1篇 |
1948年 | 1篇 |
排序方式: 共有269条查询结果,搜索用时 15 毫秒
41.
42.
43.
44.
45.
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. 相似文献
46.
The second session of the Preparatory Committee for the 2015 Review Conference (RevCon) of the Treaty on the Non-Proliferation of Nuclear Weapons (NPT) highlighted two issues in particular—progress toward a Middle East Weapons of Mass Destruction–Free Zone and the Joint Statement on the humanitarian impact of nuclear weapons—that may not only greatly affect the health and vitality of the NPT and the 2015 RevCon, but possibly also have implications for the international nonproliferation regime as a whole. Dr. William Potter, director of the James Martin Center for Nonproliferation Studies, interviewed Ambassador Cornel Feruta, chairman of the 2013 PrepCom, to discuss these and other issues related to the meeting and the future of the treaty and its review process. 相似文献
47.
A critical element in implementing a compensation scheme including nonmonetary incentives (NMIs) is recognizing that preferences vary widely across Service members. There are at least three sources of variability: across different population classes, across individuals within a population class, and across NMI packages for a particular individual. Surveys across different military communities, ranks, and years of Service show the difficulty of identifying any NMI that has significant value for even 50% of the active duty force. At the same time, approximately 80% of the surveyed Service members expressed a significant positive value for at least one NMI. Therefore, one-size-fits-all incentive packages will not be nearly as effective as more personalized incentive packages. The authors discuss variability in Service member NMI preferences and outline an approach to implementing personalized NMI packages in military compensation through a sealed-bid reverse auction, where Service members select individual NMIs from a “cafeteria-style” menu of options. 相似文献
48.
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. 相似文献
49.
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. 相似文献
50.