首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   535篇
  免费   1篇
  536篇
  2021年   12篇
  2019年   14篇
  2017年   12篇
  2016年   11篇
  2015年   17篇
  2014年   10篇
  2013年   90篇
  2011年   7篇
  2008年   6篇
  2007年   7篇
  2006年   6篇
  2005年   7篇
  2004年   5篇
  2003年   4篇
  2002年   7篇
  2001年   9篇
  2000年   5篇
  1999年   11篇
  1998年   10篇
  1997年   10篇
  1996年   6篇
  1995年   7篇
  1994年   11篇
  1993年   10篇
  1992年   12篇
  1991年   14篇
  1990年   4篇
  1989年   9篇
  1988年   17篇
  1987年   8篇
  1986年   17篇
  1985年   10篇
  1984年   8篇
  1983年   5篇
  1982年   5篇
  1981年   11篇
  1980年   5篇
  1979年   13篇
  1978年   8篇
  1977年   10篇
  1975年   10篇
  1974年   11篇
  1973年   5篇
  1972年   7篇
  1971年   6篇
  1970年   4篇
  1969年   7篇
  1968年   6篇
  1967年   3篇
  1966年   5篇
排序方式: 共有536条查询结果,搜索用时 0 毫秒
321.
    
One of the major problems in modeling production systems is how to treat the job arrival process. Restrictive assumptions such as Markovian arrivals do not represent real world systems, especially if the arrival process is generated by job departures from upstream workstations. Under these circumstances, cost‐effective policies that are robust with respect to the nature of the arrival process become of interest. In this paper, we focus on minimizing the expected total holding and setup costs in a two‐stage produce‐to‐order production system operated by a cross‐trained worker. We will show that if setup times are insignificant in comparison with processing times, then near‐optimal policies can be generated with very robust performances with respect to the arrival process. We also present conditions under which these near‐optimal policies can be obtained by using only the arrival and service rates. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2005.  相似文献   
322.
323.
This article investigates the problem of planning an optimal layered search for a stationary target. A search is layered if it assigns each point in the search space an integer number of glimpses or looks. General necessary and sufficient conditions and an existence theorem are obtained. The special case in which the initial target distribution is bivariate normal is considered in detail.  相似文献   
324.
The discrete evasion game with three-move lag, formulated over 30 years ago, was one of the earliest games with time-lag complications. This game remains unsolved even though it is well known that the game has a value. In this article we obtain an upper bound for the value by constructing a strategy which consists of 400 conditional probabilities for the minimizing player. This is believed to be the best upper bound known.  相似文献   
325.
326.
327.
In this article we consider the unweighted m-center problem with rectilinear distance. We preent an O(nm–2 log n) algorithm for the m-center problem where m ≥ 4.  相似文献   
328.
    
We consider the problem of optimally maintaining a stochastically degrading, single‐unit system using heterogeneous spares of varying quality. The system's failures are unannounced; therefore, it is inspected periodically to determine its status (functioning or failed). The system continues in operation until it is either preventively or correctively maintained. The available maintenance options include perfect repair, which restores the system to an as‐good‐as‐new condition, and replacement with a randomly selected unit from the supply of heterogeneous spares. The objective is to minimize the total expected discounted maintenance costs over an infinite time horizon. We formulate the problem using a mixed observability Markov decision process (MOMDP) model in which the system's age is observable but its quality must be inferred. We show, under suitable conditions, the monotonicity of the optimal value function in the belief about the system quality and establish conditions under which finite preventive maintenance thresholds exist. A detailed computational study reveals that the optimal policy encourages exploration when the system's quality is uncertain; the policy is more exploitive when the quality is highly certain. The study also demonstrates that substantial cost savings are achieved by utilizing our MOMDP‐based method as compared to more naïve methods of accounting for heterogeneous spares.  相似文献   
329.
    

The scope of this paper is to forecast the extent to which a settlement of the Cyprus issue may be possible given the decisions taken during the Copenhagen EU summit. It aims, in addition, at investigating the possibilities of improvement in Greek-Turkish relations which may lead, in turn, to reducing the arms race between the two countries. The paper uses a Genetically Evolved Certainty Neuron Fuzzy Cognitive Map algorithm to consider a number of scenarios examining the possible reactions of all sides involved in the Cyprus issue, namely Greece, Turkey, Cyprus, the Turkish-Cypriot community and the international environment. All simulation exercises suggest that the Greek and the Cypriot side should not necessarily rely on the decisions taken during the Copenhagen summit conference. The forecasts point out, in addition, that the optimism of the Greek government concerning the outlook of its relations with Turkey, and a subsequent reduction of the arms race against it, is far from being justified.  相似文献   
330.
This paper constructs a macroeconomic model of North–South interaction where the flow of narcotics from the South to the North is restricted. The economic effects are akin to quantitative restrictions in trade policy. Two alternative policy scenarios will be considered. One involves reducing the supply of drugs at the source, accompanied by aid. Supply‐side restrictions have negative aggregate supply‐side effects in the producing region, because of the monopoly rents generated from that type of control. This makes them a second‐best policy, particularly if the accompanying aid is not used for poverty alleviation and fails to expand domestic aggregate demand. Alternatively, demand side restrictions will be found to be superior.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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