首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   3331篇
  免费   89篇
  国内免费   1篇
  3421篇
  2021年   37篇
  2019年   88篇
  2018年   54篇
  2017年   82篇
  2016年   79篇
  2015年   62篇
  2014年   66篇
  2013年   701篇
  2010年   37篇
  2009年   37篇
  2008年   48篇
  2007年   53篇
  2006年   36篇
  2005年   42篇
  2004年   56篇
  2003年   42篇
  2002年   57篇
  1999年   41篇
  1998年   46篇
  1997年   47篇
  1996年   61篇
  1995年   41篇
  1994年   59篇
  1993年   64篇
  1992年   58篇
  1991年   74篇
  1990年   39篇
  1989年   72篇
  1988年   78篇
  1987年   68篇
  1986年   71篇
  1985年   64篇
  1984年   37篇
  1983年   42篇
  1982年   43篇
  1981年   46篇
  1980年   51篇
  1979年   45篇
  1978年   49篇
  1977年   45篇
  1976年   45篇
  1975年   46篇
  1974年   52篇
  1973年   50篇
  1972年   52篇
  1971年   43篇
  1970年   40篇
  1969年   40篇
  1968年   34篇
  1967年   34篇
排序方式: 共有3421条查询结果,搜索用时 0 毫秒
481.
An optimal operating policy is characterized for the infinite‐horizon average‐cost case of a single server queueing control problem. The server may be turned on at arrival epochs or off at departure epochs. Two classes of customers, each of them arriving according to an independent Poisson processes, are considered. An arriving 1‐customer enters the system if the server is turned on upon his arrival, or if the server is on and idle. In the former case, the 1‐customer is selected for service ahead of those customers waiting in the system; otherwise he leaves the system immediately. 2‐Customers remain in the system until they complete their service requirements. Under a linear cost structure, this paper shows that a stationary optimal policy exists such that either (1) leaves the server on at all times, or (2) turns the server off when the system is empty. In the latter case, we show that the stationary optimal policy is a threshold strategy, this feature being commonplace in most of priority queueing systems and inventory models. However, the optimal policy in our model is determined by two thresholds instead of one. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 201–209, 2001  相似文献   
482.
Allocation of scarce common components to finished product orders is central to the performance of assembly systems. Analysis of these systems is complex, however, when the product master schedule is subject to uncertainty. In this paper, we analyze the cost—service performance of a component inventory system with correlated finished product demands, where component allocation is based on a fair shares method. Such issuing policies are used commonly in practice. We quantify the impact of component stocking policies on finished product delays due to component shortages and on product order completion rates. These results are used to determine optimal base stock levels for components, subject to constraints on finished product service (order completion rates). Our methodology can help managers of assembly systems to (1) understand the impact of their inventory management decisions on customer service, (2) achieve cost reductions by optimizing their inventory investments, and (3) evaluate supplier performance and negotiate contracts by quantifying the effect of delivery lead times on costs and customer service. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48:409–429, 2001  相似文献   
483.
介绍了数字自动增益控制(AGC)技术在数字中频接收机中的实现方法’,提出了利用 DSP Builder模型库设计的一种实用的数字自动增益控制电路,所设计的电路在数字中频接收机系统内工作良好。该数字 AGC具有快速收敛、结构简单、性能稳定和成本低等特点。占用 Altera StratixⅡ FPGA 片上163个自适应逻辑单元(ALUTs)。  相似文献   
484.
485.
486.
In this paper, we derive new families of facet‐defining inequalities for the finite group problem and extreme inequalities for the infinite group problem using approximate lifting. The new valid inequalities for the finite group problem include two‐ and three‐slope facet‐defining inequalities as well as the first family of four‐slope facet‐defining inequalities. The new valid inequalities for the infinite group problem include families of two‐ and three‐slope extreme inequalities. These new inequalities not only illustrate the diversity of strong inequalities for the finite and infinite group problems, but also provide a large variety of new cutting planes for solving integer and mixed‐integer programming problems. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008  相似文献   
487.
This article presents new tools and methods for finding optimum step‐stress accelerated life test plans. First, we present an approach to calculate the large‐sample approximate variance of the maximum likelihood estimator of a quantile of the failure time distribution at use conditions from a step‐stress accelerated life test. The approach allows for multistep stress changes and censoring for general log‐location‐scale distributions based on a cumulative exposure model. As an application of this approach, the optimum variance is studied as a function of shape parameter for both Weibull and lognormal distributions. Graphical comparisons among test plans using step‐up, step‐down, and constant‐stress patterns are also presented. The results show that depending on the values of the model parameters and quantile of interest, each of the three test plans can be preferable in terms of optimum variance. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008  相似文献   
488.
489.
490.
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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