首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   240篇
  免费   3篇
  2020年   5篇
  2019年   5篇
  2018年   4篇
  2017年   10篇
  2016年   6篇
  2015年   3篇
  2014年   5篇
  2013年   71篇
  2011年   3篇
  2010年   3篇
  2009年   3篇
  2008年   2篇
  2007年   2篇
  2006年   2篇
  2005年   4篇
  2004年   2篇
  2003年   2篇
  2002年   2篇
  2001年   3篇
  2000年   2篇
  1999年   2篇
  1998年   3篇
  1997年   2篇
  1996年   2篇
  1995年   6篇
  1994年   4篇
  1993年   3篇
  1992年   7篇
  1991年   9篇
  1989年   4篇
  1988年   2篇
  1987年   6篇
  1986年   4篇
  1985年   6篇
  1984年   3篇
  1983年   2篇
  1980年   4篇
  1979年   1篇
  1978年   4篇
  1977年   2篇
  1976年   2篇
  1975年   3篇
  1974年   6篇
  1973年   4篇
  1972年   1篇
  1971年   1篇
  1970年   3篇
  1969年   1篇
  1968年   2篇
  1967年   1篇
排序方式: 共有243条查询结果,搜索用时 15 毫秒
181.
The search theory open literature has paid little, if any, attention to the multiple-searcher, moving-target search problem. We develop an optimal branch-and-bound procedure and six heuristics for solving constrained-path problems with multiple searchers. Our optimal procedure outperforms existing approaches when used with only a single searcher. For more than one searcher, the time needed to guarantee an optimal solution is prohibitive. Our heuristics represent a wide variety of approaches: One solves partial problems optimally, two use paths based on maximizing the expected number of detections, two are genetic algorithm implementations, and one is local search with random restarts. A heuristic based on the expected number of detections obtains solutions within 2% of the best known for each one-, two-, and three-searcher test problem considered. For one- and two-searcher problems, the same heuristic's solution time is less than that of other heuristics. For three-searcher problems, a genetic algorithm implementation obtains the best-known solution in as little as 20% of other heuristic solution times. © 1996 John Wiley & Sons, Inc.  相似文献   
182.
Capacity expansion refers to the process of adding facilities or manpower to meet increasing demand. Typical capacity expansion decisions are characterized by uncertain demand forecasts and uncertainty in the eventual cost of expansion projects. This article models capacity expansion within the framework of piecewise deterministic Markov processes and investigates the problem of controlling investment in a succession of same type projects in order to meet increasing demand with minimum cost. In particular, we investigate the optimality of a class of investment strategies called cutoff strategies. These strategies have the property that there exists some undercapacity level M such that the strategy invests at the maximum available rate at all levels above M and does not invest at any level below M. Cutoff strategies are appealing because they are straightforward to implement. We determine conditions on the undercapacity penalty function that ensure the existence of optimal cutoff strategies when the cost of completing a project is exponentially distributed. A by-product of the proof is an algorithm for determining the optimal strategy and its cost. © 1995 John Wiley & Sons, Inc.  相似文献   
183.
For infinite-horizon replacement economy problems it is common practice to truncate the problem at some finite horizon. We develop bounds on the error due to such a truncation. These bounds differ from previous results in that they include both revenues and costs. Bounds are illustrated through a numerical example from a real case in vehicle replacement. © 1994 John Wiley & Sons, Inc.  相似文献   
184.
Until recently, fast algorithms for the maximum flow problem have typically proceeded by constructing layered networks and establishing blocking flows in these networks. However, in recent years, new distance-directed algorithms have been suggested that do not construct layered networks but instead maintain a distance label with each node. The distance label of a node is a lower bound on the length of the shortest augmenting path from the node to the sink. In this article we develop two distance-directed augmenting path algorithms for the maximum flow problem. Both the algorithms run in O(n2m) time on networks with n nodes and m arcs. We also point out the relationship between the distance labels and layered networks. Using a scaling technique, we improve the complexity of our distance-directed algorithms to O(nm log U), where U denotes the largest arc capacity. We also consider applications of these algorithms to unit capacity maximum flow problems and a class of parametric maximum flow problems.  相似文献   
185.
A system of iid Bernoulli components is the starting point in the statistical theory of reliability. This simplification allows for the development of a rich, though elementary, theory for the structure of the system. Two representations play a prominent role in the study of structural reliability. One is the minimal path set representation and the other is the signature representation. By combining the two representations with the Gibbs measure for the state of components, one obtains terms that can be interpreted as the complexity of the system structure. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010  相似文献   
186.
187.
188.
189.
190.
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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