首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   607篇
  免费   1篇
  608篇
  2019年   15篇
  2018年   9篇
  2017年   11篇
  2016年   12篇
  2015年   11篇
  2014年   6篇
  2013年   124篇
  2011年   6篇
  2010年   8篇
  2007年   6篇
  2006年   7篇
  2005年   12篇
  2004年   9篇
  2003年   5篇
  2001年   5篇
  2000年   9篇
  1999年   6篇
  1998年   8篇
  1997年   10篇
  1996年   14篇
  1995年   6篇
  1994年   10篇
  1993年   8篇
  1992年   12篇
  1991年   17篇
  1990年   9篇
  1989年   13篇
  1988年   11篇
  1987年   14篇
  1986年   12篇
  1985年   14篇
  1984年   9篇
  1983年   9篇
  1982年   6篇
  1981年   9篇
  1980年   10篇
  1979年   11篇
  1978年   9篇
  1977年   9篇
  1976年   11篇
  1975年   7篇
  1974年   11篇
  1973年   10篇
  1972年   12篇
  1971年   14篇
  1970年   6篇
  1969年   8篇
  1968年   5篇
  1967年   6篇
  1966年   5篇
排序方式: 共有608条查询结果,搜索用时 15 毫秒
451.
A significant problem in electronic system design is that of partitioning the functional elements of an equipment schematic into subsets which may be regarded as modules. The collection of all such subsets generated by a particular partitioning forms a potential modular design. The specific problem is to determine that partitioning of the schematic that minimizes a cost function defined on the subsets subject to specified hardware, design, packaging, and inventory constraints. This problem is termed the modularization problem. This paper presents a method for obtaining restricted solutions to the modularization problem by employing some recent developments in linear graph theory obtained by one of the coauthors. Numerical results from the solution of several typical problems are presented.  相似文献   
452.
453.
The search for an optimal point in a mixed-integer space with a single linear bound may be significantly reduced by a procedure resembling the Lagrangian technique. This procedure uses the coefficients of the linear bound to generate a set of necessary conditions that may eliminate most of the space from further consideration. Enumerative or other techniques can then locate the optimum with greater efficiency. Several methods are presented for applying this theory to separable and quadratic objectives. In the maximization of a separable concave function, the resulting average range of the variables is approximately equal to the maximum (integer) coefficient of the constraint equation.  相似文献   
454.
An optimal schedule for checking an equipment subject to failure which can be detected by inspection only, is derived. Increasing failure rate and one percentile specify the otherwise unknown life distribution. Dynamic programming methodology yields the solution which minimizes the maximum expected cost. Numerical examples are presented and compared with models employing differing amounts of knowledge.  相似文献   
455.
This paper considers evolutionarily stable decisions about whether to initiate violent conflict rather than accepting a peaceful sharing outcome. Focusing on small sets of players such as countries in a geographically confined area, we use the concept of evolutionary stability in finite populations. We find that players’ evolutionarily stable preferences widen the range of peaceful resource allocations that are rejected in favor of violent conflict, compared to the Nash equilibrium outcomes. Relative advantages in fighting strength are reflected in the equilibrium set of peaceful resource allocations.  相似文献   
456.
457.
458.
In this article we present a proportional hazards model for describing machine tool failures. The model enables us to describe the effect of aging as well as the effect of the machining environment on tool life. We discuss inference for the model and show that computable results can be obtained in a fully Bayesian analysis by using approximation techniques. We illustrate the usefulness of our model by applying it to some actual data on machine tool failures.  相似文献   
459.
460.
We discuss a time dependent optimal ordering policy for a finite horizon inventory system for which the provision of service is essential and thus no stockout is allowed. It is assumed that the system can place an order at any point in time during the horizon when it cannot meet the customer's demand and that lead time is negligible. The demand is considered to be distributed as a compound Poisson process with known parameters and the functional equation approach of dynamic programming is used to formulate the objective function. An algorithm has been developed to obtain the solution for all the cases. In addition, analytical solutions of the basic equation under two limiting conditions are presented.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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