全文获取类型
收费全文 | 338篇 |
免费 | 95篇 |
国内免费 | 1篇 |
出版年
2024年 | 2篇 |
2022年 | 2篇 |
2021年 | 8篇 |
2020年 | 1篇 |
2019年 | 13篇 |
2018年 | 6篇 |
2017年 | 15篇 |
2016年 | 21篇 |
2015年 | 15篇 |
2014年 | 16篇 |
2013年 | 70篇 |
2012年 | 19篇 |
2011年 | 23篇 |
2010年 | 23篇 |
2009年 | 21篇 |
2008年 | 24篇 |
2007年 | 32篇 |
2006年 | 25篇 |
2005年 | 16篇 |
2004年 | 20篇 |
2003年 | 12篇 |
2002年 | 14篇 |
2001年 | 12篇 |
2000年 | 11篇 |
1999年 | 4篇 |
1998年 | 1篇 |
1996年 | 2篇 |
1995年 | 2篇 |
1994年 | 1篇 |
1990年 | 2篇 |
1989年 | 1篇 |
排序方式: 共有434条查询结果,搜索用时 0 毫秒
391.
洪厚胜 《军械工程学院学报》1989,(1)
本文提出一个具有密度函数 (α>0,β≠0,λ>0,μ≥0)的四参数寿命分布S(α,β,λ,μ),然后证明了它的一些基本性质,据形状参数对(α,β)的不同取值,找出了失效率λ(t)关于时间t的五种变化规律:不变;递减;递增;先增后减;先减后增,并显示出不变失效率是其余四种失效率当(α,β)→(1,1)时的极限。 相似文献
392.
393.
对于给定的任何型值数组,本文通过插入新结点构造了C1连续的保形插值二次和三次样条函数S(x),最后还讨论了单调保形的插值样条函数。 相似文献
394.
Eshetu T. Wondmagegnehu 《海军后勤学研究》2004,51(4):491-500
Populations of many types of component are heterogeneous and often consist of a small number of different subpopulations. This is called a mixture and it arises in a number of situations. For example, a majority of products in industrial populations are mixtures of defective items with shorter lifetimes and standard items with longer lifetimes. It is a well‐known result that distributions with decreasing failure rates are closed under mixture. However, mixtures of distributions with increasing failure rates are not easily classifiable. If the subpopulations involved in the mixture have increasing failure rates, there might be some upward movement in the mixture and later a general downward pull towards the strongest component. Little work has been done in describing the shape of mixture failure rates when all subpopulations do not have decreasing failure rate. In this paper, we present general results that describe the shape and behavior of a failure rate of a mixture obtained from two Weibull subpopulations with strictly increasing failure rates. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004 相似文献
395.
In due‐window assignment problems, jobs completed within a designated time interval are regarded as being on time, whereas early and tardy jobs are penalized. The objective is to determine the location and size of the due‐window, as well as the job schedule. We address a common due‐window assignment problem on parallel identical machines with unit processing time jobs. We show that the number of candidate values for the optimal due‐window starting time and for the optimal due‐window completion time are bounded by 2. We also prove that the starting time of the first job on each of the machines is either 0 or 1, thus introducing a fairly simple, constant‐time solution for the problem. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004 相似文献
396.
The U.S. system for procuring and utilizing deceased‐donor organs for transplantation has been studied and written about in many articles. The purpose of this paper is to examine the interactions between the elements that comprise this system, and point out improvement opportunities that may be affected through operations research/management techniques. The authors demonstrate the need for developing data‐driven and analytic tools. In fact, data is used to generate hypotheses and support claims throughout the paper. The paper also points out the need to fully leverage data that is available to researchers, and to seek data that is currently not deposited in a centralized archive. 相似文献
397.
In a typical assemble‐to‐order system, a customer order may request multiple items, and the order may not be filled if any of the requested items are out of stock. A key customer service measure when unfilled orders are backordered is the order‐based backorder level. To evaluate this crucial performance measure, a fundamental question is whether the stationary joint inventory positions follow an independent and uniform distribution. In this context, this is equivalent to the irreducibility of the Markov chain formed by the joint inventory positions. This article presents a necessary and sufficient condition for the irreducibility of such a Markov chain through a set of simultaneous Diophantine equations. This result also leads to sufficient conditions that are more general than those in the published reports. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011 相似文献
398.
Irina S. Dolinskaya 《海军后勤学研究》2012,59(5):325-339
This article examines optimal path finding problems where cost function and constraints are direction, location, and time dependent. Recent advancements in sensor and data‐processing technology facilitate the collection of detailed real‐time information about the environment surrounding a ground vehicle, an airplane, or a naval vessel. We present a navigation model that makes use of such information. We relax a number of assumptions from existing literature on path‐finding problems and create an accurate, yet tractable, model suitable for implementation for a large class of problems. We present a dynamic programming model which integrates our earlier results for direction‐dependent, time and space homogeneous environment, and consequently, improves its accuracy, efficiency, and run‐time. The proposed path finding model also addresses limited information about the surrounding environment, control‐feasibility of the considered paths, such as sharpest feasible turns a vehicle can make, and computational demands of a time‐dependent environment. To demonstrate the applicability and performance of our path‐finding algorithm, computational experiments for a short‐range ship routing in dynamic wave‐field problem are presented. © 2012 Wiley Periodicals, Inc. Naval Research Logistics, 2012 相似文献
399.
We present two frameworks for designing random search methods for discrete simulation optimization. One of our frameworks is very broad (in that it includes many random search methods), whereas the other one considers a special class of random search methods called point‐based methods, that move iteratively between points within the feasible region. Our frameworks involve averaging, in that all decisions that require estimates of the objective function values at various feasible solutions are based on the averages of all observations collected at these solutions so far. Also, the methods are adaptive in that they can use information gathered in previous iterations to decide how simulation effort is expended in the current iteration. We show that the methods within our frameworks are almost surely globally convergent under mild conditions. Thus, the generality of our frameworks and associated convergence guarantees makes the frameworks useful to algorithm developers wishing to design efficient and rigorous procedures for simulation optimization. We also present two variants of the simulated annealing (SA) algorithm and provide their convergence analysis as example application of our point‐based framework. Finally, we provide numerical results that demonstrate the empirical effectiveness of averaging and adaptivity in the context of SA. © 2012 Wiley Periodicals, Inc. Naval Research Logistics, 2012 相似文献
400.
We consider a setting in which inventory plays both promotional and service roles; that is, higher inventories not only improve service levels but also stimulate demand by serving as a promotional tool (e.g., as the result of advertising effect by the enhanced product visibility). Specifically, we study the periodic‐review inventory systems in which the demand in each period is uncertain but increases with the inventory level. We investigate the multiperiod model with normal and expediting orders in each period, that is, any shortage will be met through emergency replenishment. Such a model takes the lost sales model as a special case. For the cases without and with fixed order costs, the optimal inventory replenishment policy is shown to be of the base‐stock type and of the (s,S) type, respectively. © 2012 Wiley Periodicals, Inc. Naval Research Logistics, 2012 相似文献