首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   216篇
  免费   0篇
  216篇
  2018年   7篇
  2017年   4篇
  2016年   8篇
  2015年   2篇
  2014年   2篇
  2013年   82篇
  2012年   2篇
  2011年   1篇
  2010年   3篇
  2009年   1篇
  2008年   1篇
  2006年   1篇
  2005年   5篇
  2004年   1篇
  2003年   4篇
  2002年   5篇
  2000年   3篇
  1999年   3篇
  1998年   1篇
  1997年   4篇
  1996年   2篇
  1995年   2篇
  1994年   3篇
  1993年   5篇
  1992年   3篇
  1991年   3篇
  1990年   2篇
  1989年   3篇
  1988年   1篇
  1987年   6篇
  1986年   3篇
  1985年   1篇
  1984年   2篇
  1983年   1篇
  1982年   2篇
  1981年   2篇
  1980年   1篇
  1979年   2篇
  1978年   6篇
  1977年   1篇
  1976年   3篇
  1975年   2篇
  1974年   3篇
  1972年   3篇
  1971年   3篇
  1970年   2篇
  1969年   3篇
  1968年   2篇
  1967年   1篇
  1966年   1篇
排序方式: 共有216条查询结果,搜索用时 0 毫秒
71.
The application of statistical expectation to risk density functions and fee/incentive-element relationships is shown to be useful in structuring contract incentives. A mathematical procedure for calculating the expected value of fee for a given risk/incentive arrangement is described along with cost examples and related sensitivity analyses. The structuring of equivalent incentives is demonstrated by the use of the contracting procedure used for procuring the C-5A aircraft.  相似文献   
72.
The problem of finding minimal disconnecting sets for multi-commodity directed networks may be solved using an arc-path formulation and Gomory's all-integer integer programming algorithm. However, the number of network constraints may be astronomical for even moderately sized networks. This paper develops a finite algorithm similar to Gomory's, but requiring no more than m rows in the tableau, where m is the number of arcs in the network.  相似文献   
73.
The problem of scheduling n jobs on m parallel machines is considered when the machines are subject to random breakdowns and job processing times are random variables. An objective function of mean flow time is developed for a general parallel machine system, and an expression of its expected value is derived. The problem is transformed into a deterministic unrelated parallel machine scheduling model with modified processing times when the number of breakdowns is modeled as a generalized Poisson process. © 1994 John Wiley & Sons, Inc.  相似文献   
74.
The purpose of this article is to formulate the multi-commodity maximal flow problem into a node-arc form and to show that when decomposition is applied to this form the resulting master and subproblems become precisely those described by Ford & Fulkerson [3] using the arc-chain formulation. A generalization to the problem is then considered which can potentially speed its convergence.  相似文献   
75.
Modification of algorithms designed for scalar computing, to take advantage of vector processing, raises several challenges. This article presents the vectorization of the primal simplex based network algorithm and results in a 50% improvement in computational time. One of the major contributors to this improvement is the matching of the size of the pricing candidate list to the vector register size. The side constraints are relaxed into a single surrogate constraint. The single constraint network algorithm is vectorized and used as the basis for solving large-scale constrained network problems. Computational experiments are presented which illustrate the vectorization of the network code as well as the ability of the surrogate constraint approach to deal with large constrained network problems.  相似文献   
76.
An infiltrator, starting at a safe base, tries to pass, undetected by a guard and within a time limit, along one of k nonintersecting arcs to a safe destination. Optimal strategies and the value are obtained for this discrete zero-sum search-evasion game.  相似文献   
77.
78.
79.
Postmodern terrorism presents a significant challenge to global security and law enforcement institutions. Non-state actors operating across international borders, engaged in an apparent global insurgency of extremism that transects the traditional boundaries of crime and war, pose significant challenges to both intelligence and law enforcement agencies. These networked global insurgents blend political and religious fanaticism with criminal enterprises to challenge the rule of law and pose an epochal shift in the structures and relations among states. Negotiating this epochal shift requires traditional organs of national security (the diplomatic, military and intelligence services) to forge new partnerships with police and public safety organizations at the state and local (sub-national), as well as transnational levels. Significant operational, policy and cultural challenges must be overcome to forge an effective multi-lateral global network to counter global terrorism and insurgency.  相似文献   
80.
2014–2015 were years of turmoil for strategic relations, with Sino-Russian relations emerging as a particularly interesting set of ties to observe. This article asks whether recurrent Sino-Russian exhortations of friendship are mirrored by their strategic alignment in the defence and security realm, half a century after the end of the Sino-Soviet pact during the communist era. We examine the arms trade between the two countries and with regional partners, but also the recent pattern of bilateral and multilateral military exercises, as a combined test of the security and defence relationship. We are able to show that the image of friendship that both Moscow and Beijing like to promote, while apparent at the UN Security Council and within the BRICS group, remains constrained by rivalry in high-tech segments of the arms industry and by lingering concerns about the prospects of peer interference in their shared regional vicinity.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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