全文获取类型
收费全文 | 606篇 |
免费 | 18篇 |
出版年
2020年 | 5篇 |
2019年 | 9篇 |
2017年 | 12篇 |
2016年 | 10篇 |
2015年 | 12篇 |
2014年 | 8篇 |
2013年 | 122篇 |
2011年 | 6篇 |
2009年 | 5篇 |
2007年 | 8篇 |
2005年 | 8篇 |
2004年 | 9篇 |
2003年 | 6篇 |
2002年 | 8篇 |
2001年 | 7篇 |
2000年 | 6篇 |
1999年 | 9篇 |
1998年 | 8篇 |
1997年 | 9篇 |
1996年 | 10篇 |
1995年 | 15篇 |
1994年 | 16篇 |
1993年 | 12篇 |
1992年 | 14篇 |
1991年 | 15篇 |
1990年 | 8篇 |
1989年 | 9篇 |
1988年 | 14篇 |
1987年 | 13篇 |
1986年 | 9篇 |
1985年 | 12篇 |
1984年 | 10篇 |
1983年 | 9篇 |
1982年 | 11篇 |
1981年 | 10篇 |
1980年 | 11篇 |
1979年 | 14篇 |
1978年 | 8篇 |
1977年 | 9篇 |
1976年 | 8篇 |
1975年 | 12篇 |
1974年 | 11篇 |
1973年 | 11篇 |
1972年 | 13篇 |
1971年 | 13篇 |
1970年 | 6篇 |
1969年 | 8篇 |
1968年 | 10篇 |
1967年 | 6篇 |
1948年 | 5篇 |
排序方式: 共有624条查询结果,搜索用时 26 毫秒
451.
A computationally simple method for obtaining confidence bounds for highly reliable coherent systems, based on component tests which experience few or no failures, is given. Binomial and Type I censored exponential failure data are considered. Here unknown component unreliabilities are ordered by weighting factors, which are firstly presumed known then sensitivity of the confidence bounds to these assumed weights is examined and shown to be low. 相似文献
452.
The 0-1 multiple-knapsack problem is an extension of the well-known 0-1 knapsack problem. It is a problem of assigning m objects, each having a value and a weight, to n knapsacks in such a way that the total weight in each knapsack is less than its capacity limit and the total value in the knapsacks is maximized. A branch-and-bound algorithm for solving the problem is developed and tested. Branching rules that avoid the search of redundant partial solutions are used in the algorithm. Various bounding techniques, including Lagrangean and surrogate relaxations, are investigated and compared. 相似文献
453.
The notions of minimax paths, trees, and cut sets are defined for undirected graphs; and relationships between these entities are established. Simple solution procedures based on these relationships are presented. 相似文献
454.
Chelsea C. White 《海军后勤学研究》1979,26(3):415-422
This paper characterizes the structure of optimal strategies for a replacement problem for two special cases of observation quality. It is shown that when the state of the system is either completely observed or completely unobserved at every decision epoch by the controller, reasonable assumptions are sufficient for the existence of optimal replacement strategies composed of policies having a generalized, control-limit form. These structural results are of particular interest since the optimal cost functions for the two special cases represent bounds on the optimal cost function for the general partially observed case, significant computational simplification can result for the two special cases due to their optimal strategy structure, and optimal strategies possessing a control-limit structure do not necessarily exist for the general partially observed case. 相似文献
455.
An extended logistic system is a well-defined configuration of equipment, modules, inventories, and repair and replacement facilities modeling a complex, repairable system with on-going repair. The design of such systems has been based largely on the static tools of inventory theory and reliability theory, i.e., on steady-state distributions and on associated means and variances. Such static tools suppress the scale of real lime and ignore system persistence time in up-states and persistence time in down-states. A reasonably simple dynamic methodology is presented, focusing on system failure time as a more meaningful objective function for system-design tradeoff studies. In the presence of good reliability, it is shown that different candidates for system failure time effectively merge to yield an unambiguous, single system failure time. Examples illustrating the importance of dynamic information for system design are given. 相似文献
456.
457.
This paper studies the congestion problems of the computer core storage units. The principle of storage request interleaving is briefly discussed as means of increasing thruput. An analytic model is proposed to analyze the core storage system with a two-way interleaving feature. The model, an approximation to the physical system, is an extension of a queueing model with bulk service considered by Bailey in Ref. [1]. 相似文献
458.
The Tactical Warfare Simulation Program is a procedure by which the major interactions among opposing military units and terrain features can be treated in a tactical limited warfare situation. It is a critical-area, sequence-of-event model and is programmed in SIM-SCRIPT. In this program a military unit is described by such properties as strength, size, location, velocity, and attrition rates. Some of the events which can occur to a military unit are entering/leaving terrain features, becoming engaged/disengaged with opposing units, retreating, reaching an objective, and breaking. Following a discussion of the general features of the program, a study of a hypothetical war is presented. 相似文献
459.
David R. Morrison Jason J. Sauppe Wenda Zhang Sheldon H. Jacobson Edward C. Sewell 《海军后勤学研究》2017,64(1):64-82
The cyclic best‐first search (CBFS) strategy is a recent search strategy that has been successfully applied to branch‐and‐bound algorithms in a number of different settings. CBFS is a modification of best‐first search (BFS) that places search tree subproblems into contours which are collections of subproblems grouped in some way, and repeatedly cycles through all non‐empty contours, selecting one subproblem to explore from each. In this article, the theoretical properties of CBFS are analyzed for the first time. CBFS is proved to be a generalization of all other search strategies by using a contour definition that explores the same sequence of subproblems as any other search strategy. Further, a bound is proved between the number of subproblems explored by BFS and the number of children generated by CBFS, given a fixed branching strategy and set of pruning rules. Finally, a discussion of heuristic contour‐labeling functions is provided, and proof‐of‐concept computational results for mixed‐integer programming problems from the MIPLIB 2010 database are shown. © 2017 Wiley Periodicals, Inc. Naval Research Logistics, 64: 64–82, 2017 相似文献
460.
Jeffrey W. Knopf 《Contemporary Security Policy》2017,38(1):26-34
Comments that Donald Trump made while campaigning to be U.S. president have raised concerns that his administration will pull back from U.S. alliance commitments and encourage countries such as Japan and South Korea to acquire nuclear arms. The new article by Frühling and O’Neil outlines an institutional framework that can be helpful in assessing the risks that Trump administration policies will lead to nuclear proliferation. An institutional perspective shows that important elements of U.S. security assurances will continue to function, and this reduces the chances that President Trump’s actions or statements will trigger proliferation by U.S. allies. The greatest risk to global non-proliferation efforts posed by a Trump administration in fact lies elsewhere, in the possibility that President Trump will seek to abrogate the Iran nuclear deal. 相似文献