首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   308篇
  免费   5篇
  2021年   4篇
  2019年   9篇
  2018年   5篇
  2017年   4篇
  2015年   3篇
  2014年   4篇
  2013年   49篇
  2010年   4篇
  2009年   3篇
  2008年   6篇
  2006年   2篇
  2005年   2篇
  2004年   5篇
  2003年   4篇
  2002年   3篇
  2001年   4篇
  2000年   4篇
  1998年   5篇
  1997年   4篇
  1996年   9篇
  1995年   4篇
  1994年   2篇
  1993年   5篇
  1992年   6篇
  1991年   9篇
  1990年   6篇
  1989年   8篇
  1988年   8篇
  1987年   8篇
  1986年   7篇
  1985年   6篇
  1984年   6篇
  1983年   3篇
  1982年   4篇
  1981年   5篇
  1980年   10篇
  1979年   5篇
  1978年   6篇
  1977年   6篇
  1976年   7篇
  1975年   6篇
  1974年   4篇
  1973年   2篇
  1972年   3篇
  1971年   9篇
  1970年   5篇
  1969年   4篇
  1968年   5篇
  1967年   7篇
  1966年   6篇
排序方式: 共有313条查询结果,搜索用时 15 毫秒
171.
172.
Consider a patrol problem, where a patroller traverses a graph through edges to detect potential attacks at nodes. An attack takes a random amount of time to complete. The patroller takes one time unit to move to and inspect an adjacent node, and will detect an ongoing attack with some probability. If an attack completes before it is detected, a cost is incurred. The attack time distribution, the cost due to a successful attack, and the detection probability all depend on the attack node. The patroller seeks a patrol policy that minimizes the expected cost incurred when, and if, an attack eventually happens. We consider two cases. A random attacker chooses where to attack according to predetermined probabilities, while a strategic attacker chooses where to attack to incur the maximal expected cost. In each case, computing the optimal solution, although possible, quickly becomes intractable for problems of practical sizes. Our main contribution is to develop efficient index policies—based on Lagrangian relaxation methodology, and also on approximate dynamic programming—which typically achieve within 1% of optimality with computation time orders of magnitude less than what is required to compute the optimal policy for problems of practical sizes. © 2014 Wiley Periodicals, Inc. Naval Research Logistics, 61: 557–576, 2014  相似文献   
173.
In this paper, we discuss two‐dimensional failure modeling for a system where degradation is due to age and usage. We extend the concept of minimal repair for the one‐dimensional case to the two‐dimensional case and characterize the failures over a two‐dimensional region under minimal repair. An application of this important result to a manufacturer's servicing costs for a two‐dimensional warranty policy is given and we compare the minimal repair strategy with the strategy of replacement of failure. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004.  相似文献   
174.
Adopting the analytical framework of the established interpretive “schools” of Anglo-American relations, this article offers several reflections on UK–US defense relations as they occurred over the significant years of 2000–2005. During those years, trajectories were established on which UK–US defense relations continue to travel today and outcomes emerged which are still being navigated. This article concludes that the Latin phrase, “Flectas Non Frangas” (essentially translated as: “Bend not Break”), is the most appropriate to adopt to characterize the developments undergone in recent UK–US defense relations. Many historical and strategic lessons with contemporary relevance are drawn.  相似文献   
175.
In this paper, we consider a situation in which a group of facilities must be constructed in order to serve a given set of customers, where the facilities might not be able to guarantee an absolute coverage to the different customers. We examine the problem of maximizing the total service reliability of the system subject to a budgetary constraint. We propose a new reformulation of this problem that facilitates the generation of tight lower and upper bounds. These bounding mechanisms are embedded within the framework of a branch‐and‐bound procedure. Computational results on problem instances ranging in size up to 100 facilities and 200 customers reveal the efficacy of the proposed exact and heuristic approaches. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2006  相似文献   
176.
Readers of reports on ethical failures by four-star general officers must wonder, “Don’t they have staffs to ensure that the general follows ethics rules?” The Department of Defense publishes robust ethics guidance in several documents; however, a staff’s best efforts to implement this guidance may fail to make an impression on a senior leader who is susceptible to the “Bathsheba syndrome,” an allusion to the biblical account where the prophet Nathan rebuked King David for his moral failings. This paper proposes a methodology to enable senior headquarters staffs to play the role of Nathan in supporting ethical behaviors by high-level officers. It examines the mechanisms that embed ethical behavior within members of those staffs in carrying out their three principal roles of advising, scheduling, and transporting the four-star officer. The authors offer a framework based on an ethical infrastructure of organizational climate that focuses the staff’s daily efforts to mitigate risk across seven ethical “danger areas” that threaten ethical failures by senior officers.  相似文献   
177.
Under various operational conditions, in particular in operations other than war (OOTW) or peacekeeping, an intervening force, here Blue, must occasionally engage in attrition warfare with an opposing force, here Red, that is intermingled with noncombatants. Desirably, Red armed actives are targeted, and not the unarmed noncombatants. This article describes some simple Lanchesterian attrition models that reflect a certain capacity of Blue to discriminate noncombatants from armed and active Red opponents. An explicit extension of the Lanchester square law results: Blue's abstinence concerning the indiscriminate shooting of civilians mixed with Red's is essentially reflected in a lower Blue rate of fire and less advantageous exchange rate. The model applies to other situations involving decoys, and reflects the value of a discrimination capability. © 1997 John Wiley & Sons, Inc. Naval Research Logistics 44 : 507–514, 1997  相似文献   
178.
A new piece of equipment has been purchased in a lot of size m. Some of the items can be used in destructive testing before the item is put into use. Testing uncovers faults which can be removed from the remaining pieces of equipment in the lot. If t < m pieces of equipment are tested, then those that remain, m1 = mt, have reduced fault incidence and are more reliable than initially, but m1 may be too small to be useful, or than is desirable. In this paper models are studied to address this question: given the lot size m, how to optimize by choice of t the effectiveness of the pieces of equipment remaining after the test. The models used are simplistic and illustrative; they can be straightforwardly improved. © 1997 John Wiley & Sons, Inc. Naval Research Logistics 44: 623–637, 1997  相似文献   
179.
Many attempts have been made in the past to obtain estimates for the weights and ratings values of a multicriteria linear utility function. In particular, the problem arises when both criteria importance and alternatives' ratings are expressed in a qualitative ordinal manner. This article proposes an extreme-point approach for obtaining the overall ratings in the presence of ordinal preferences both for the criteria importance and the alternatives' rankings. In particular it is shown that Borda's method of scores is obtained as a special case. © 1996 John Wiley & Sons, Inc.  相似文献   
180.
A general class of single machine stochastic scheduling problems incorporating precedence constraints is modelled as a family of competing Markov decision processes. A bound on the optimal return yields a suboptimality bound for permutation policies. This in turn leads to a generalised “used better than new” principle as a (highly intuitive) sufficient condition for the optimality of a permutation policy in the class of all (preemptive) policies. © 1995 John Wiley & Sons, Inc.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号