全文获取类型
收费全文 | 741篇 |
免费 | 18篇 |
专业分类
759篇 |
出版年
2021年 | 11篇 |
2019年 | 15篇 |
2018年 | 8篇 |
2017年 | 19篇 |
2016年 | 13篇 |
2015年 | 14篇 |
2014年 | 18篇 |
2013年 | 134篇 |
2012年 | 7篇 |
2010年 | 10篇 |
2009年 | 17篇 |
2007年 | 11篇 |
2006年 | 10篇 |
2005年 | 11篇 |
2004年 | 16篇 |
2002年 | 17篇 |
2001年 | 9篇 |
2000年 | 11篇 |
1999年 | 7篇 |
1998年 | 15篇 |
1997年 | 9篇 |
1996年 | 9篇 |
1995年 | 11篇 |
1994年 | 17篇 |
1993年 | 16篇 |
1992年 | 11篇 |
1991年 | 18篇 |
1990年 | 12篇 |
1989年 | 19篇 |
1988年 | 20篇 |
1987年 | 20篇 |
1986年 | 20篇 |
1985年 | 12篇 |
1984年 | 13篇 |
1983年 | 9篇 |
1982年 | 8篇 |
1981年 | 11篇 |
1980年 | 7篇 |
1979年 | 11篇 |
1978年 | 15篇 |
1977年 | 6篇 |
1976年 | 8篇 |
1975年 | 8篇 |
1974年 | 10篇 |
1973年 | 11篇 |
1972年 | 11篇 |
1971年 | 6篇 |
1970年 | 11篇 |
1969年 | 8篇 |
1967年 | 6篇 |
排序方式: 共有759条查询结果,搜索用时 0 毫秒
271.
The problem of determining the sample sizes in various strata when several characteristics are under study is formulated as a nonlinear multistage decision problem. Dynamic programming is used to obtain an integer solution to the problem. © 1997 John Wiley & Sons, Inc. 相似文献
272.
This article deals with the problem of scheduling jobs with random processing times on single machine in order to minimize the expected variance of job completion times. Sufficient conditions for the existence of V-shaped optimal sequences are derived separately for general and ordered job processing times. It is shown that when coefficient of variation of random processing times are bounded by a certain value, an optimal sequence is V-shaped. © 1997 John Wiley & Sons, Inc. 相似文献
273.
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. 相似文献
274.
275.
This article provides a new approach to the set of (perfect) equilibria. With the help of an equivalence relation on the strategy space of each player. Nash sets and Selten sets are introduced. The number of these sets is finite and each of these sets is a polytope. As a consequence the set of (perfect) equilibria is a finite union of polytopes. © 1994 John Wiley & Sons. Inc. 相似文献
276.
Resource allocation problems consider the allocation of limited resources among numerous competing activities. We address an allocation problem with multiple knapsack resource constraints. The activities are grouped into disjoint sets. Ordering constraints are imposed on the activities within each set, so that the level of one activity cannot exceed the level of another activity in the same set. The objective function is of the minimax type and each performance function is a nonlinear, strictly decreasing and continuous function of a single variable. Applications for such resource allocation problems are found, for example, in high-tech industries confronted with large-scale and complex production planning problems. We present two algorithms to solve the allocation problem with ordering constraints. The first one uses characterization of the optimal decision variables to apply a search method. The second algorithm solves a sequence of problems, each in the format of the original problem without ordering constraints. Whereas the computational effort of the first algorithm depends on the desired degree of accuracy even for linear performance functions, the effort of the latter algorithm is polynomial for certain classes of performance functions. © 1994 John Wiley & Sons, Inc. 相似文献
277.
Stephen J. Cimbala 《Defense & Security Analysis》2017,33(3):193-208
Nuclear deterrence and cyber war seem almost antithetical in their respective intellectual pedigrees. Nuclear weapons are unique in their ability to create mass destruction in a short time. Information or “cyber” weapons, at least for the most part, aim at sowing confusion or mass disruption instead of widespread physical destruction. Nevertheless, there are some intersections between cyber and nuclear matters, and these have the potential to become troublesome for the future of nuclear deterrence. For example, cyber attacks might complicate the management of a nuclear crisis. As well, information attacks on command-control and communications systems might lead to a mistaken nuclear launch based on false warnings, to erroneous interpretations of data or to panic on account of feared information blackout. It is not inconceivable that future nuclear strike planning will include a preliminary wave of cyber strikes or at least a more protracted “preparation of the battlefield” by roaming through enemy networks to plant malware or map vulnerabilities. 相似文献
278.
Brenda J. Lutz 《Small Wars & Insurgencies》2014,25(5-6):1039-1054
John Brown is usually not considered to have been a terrorist, and even recent analyses of his activities consider him to be a guerrilla fighter or insurgent in his activities in Kansas. Brown, however, meets the criteria of a terrorist more than a guerrilla fighter when his activities in the Kansas Territory are considered. His raid on Harpers Ferry, however, is more in line with guerrilla operations or insurgent activities. 相似文献
279.
280.
Full‐system testing for large‐scale systems is often infeasible or very costly. Thus, when estimating system reliability, it is desirable to use a method that uses subsystem tests, which are often less expensive and more feasible. This article presents a method for bounding full‐system reliabilities based on subsystem tests and, if available, full‐system tests. The method does not require that subsystems be independent. It accounts for dependencies through the use of certain probability inequalities. The inequalities provide the basis for valid reliability calculations while not requiring independent subsystems or full‐system tests. The inequalities allow for test information on pairwise subsystem failure modes to be incorporated, thereby improving the bound on system reliability. We illustrate some of the properties of the estimates via an example application. © 2013 Wiley Periodicals, Inc. Naval Research Logistics, 2013 相似文献