首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   563篇
  免费   14篇
  577篇
  2019年   12篇
  2017年   17篇
  2016年   10篇
  2015年   14篇
  2014年   15篇
  2013年   109篇
  2012年   5篇
  2011年   5篇
  2010年   8篇
  2009年   11篇
  2007年   6篇
  2006年   8篇
  2005年   9篇
  2004年   11篇
  2003年   5篇
  2002年   10篇
  2001年   4篇
  2000年   7篇
  1999年   6篇
  1998年   12篇
  1997年   6篇
  1996年   8篇
  1995年   4篇
  1994年   15篇
  1993年   14篇
  1992年   8篇
  1991年   14篇
  1990年   8篇
  1989年   14篇
  1988年   14篇
  1987年   15篇
  1986年   16篇
  1985年   12篇
  1984年   8篇
  1983年   7篇
  1982年   7篇
  1981年   8篇
  1980年   5篇
  1979年   8篇
  1978年   12篇
  1976年   7篇
  1975年   6篇
  1974年   8篇
  1973年   7篇
  1972年   9篇
  1971年   4篇
  1970年   9篇
  1969年   6篇
  1968年   4篇
  1967年   6篇
排序方式: 共有577条查询结果,搜索用时 4 毫秒
251.
Modification of algorithms designed for scalar computing, to take advantage of vector processing, raises several challenges. This article presents the vectorization of the primal simplex based network algorithm and results in a 50% improvement in computational time. One of the major contributors to this improvement is the matching of the size of the pricing candidate list to the vector register size. The side constraints are relaxed into a single surrogate constraint. The single constraint network algorithm is vectorized and used as the basis for solving large-scale constrained network problems. Computational experiments are presented which illustrate the vectorization of the network code as well as the ability of the surrogate constraint approach to deal with large constrained network problems.  相似文献   
252.
Hollander, Park, and Proschan define a survival function S of a positive random variable X to be new better than used at age t0 (NBU-{t0}) if S satisfies $ \begin{array}{*{20}c} {\frac{{S(x + t_0)}}{{S\left({t_0} \right)}} \le S\left(x \right),} & {{\rm for}\,{\rm all}\,x\, \ge \,0,} \\ \end{array}$ where S(x) = P(X > x). The NBU-{t0} class is a special case of the NBU-A family of survival distributions, where A is a subset of [0, ∞). These families introduce a variety of modeling possibilities for use in reliability studies. We treat problems of nonparametric estimation of survival functions from these classes by estimators which are themselves members of the classes of interest. For a number of such classes, a recursive estimation technique is shown to produce closed-form estimators which are strongly consistent and converge to the true survival distribution at optimal rates. For other classes, additional assumptions are required to guarantee the consistency of recursive estimators. As an example of the latter case, we demonstrate the consistency of a recursive estimator for S ∈ NBU-[t0, ∞) based on lifetime data from items surviving a preliminary “burn-in” test. The relative precision of the empirical survival curve and several recursive estimators of S are investigated via simulation; the results provide support for the claim that recursive estimators are superior to the empirical survival curve in restricted nonparametric estimation problems of the type studied here.  相似文献   
253.
We show that the linear objective function of a search problem can be generalized to a power function and/or a logarithmic function and still be minimized by an index priority rule. We prove our result by solving the differential equation resulting from the required invariance condition, therefore, we also prove that any other generalization of this linear objective function will not lead to an index priority rule. We also demonstrate the full equivalence between two related search problems in the sense that a solution to either one can be used to solve the other one and vice versa. Finally, we show that the linear function is the only function leading to an index priority rule for the single‐machine makespan minimization problem with deteriorating jobs and an additive job deterioration function. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011  相似文献   
254.
In this paper, we discuss two‐dimensional failure modeling for a system where degradation is due to age and usage. We extend the concept of minimal repair for the one‐dimensional case to the two‐dimensional case and characterize the failures over a two‐dimensional region under minimal repair. An application of this important result to a manufacturer's servicing costs for a two‐dimensional warranty policy is given and we compare the minimal repair strategy with the strategy of replacement of failure. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004.  相似文献   
255.
256.
257.
The gas turbine engine is used to power many different types of commercial and military aircraft. During the scheduled maintenance of these engines, many of the turbine components are replaced. Of particular importance to us is the replacement of nozzle guide vanes in the nozzle assembly section of the engine. Individual vanes are selected from inventory to make up sets, and each set must meet certain characteristics in order to be feasible. The vanes in each set must then be sequenced in order to meet additional criteria. In this article, we give heuristics for the above partitioning and sequencing problems. Empirical analyses, using actual data from a branch of the armed services and a major engine manufacturer, are used to evaluate the proposed heuristics. The results of these analyses indicate that the heuristics are effective.  相似文献   
258.
Much research been devoted to modeling the replacement problem under incomplete state information. Almost no work has been done on the maintenance problem under incomplete information with multiple maintenance actions that may not return the system to as good as new. We model this problem and derive structural results concerning the optimal maintenance policy. For the case where the effect of maintenance actions is state dependent, we give conditions under which the optimal policy is finitely computable. Where maintenance is state independent we show a specific structure, consisting of monotonic waiting times and constant maintenance actions, to be optimal.  相似文献   
259.
This article describes an attempt to use certain multiple-criteria decision-making aids to support the formulation of catch quota policies in pelagic fisheries management. A set of attributes was identified, as necessary to represent the decision-making goals. Potentially useful methods appeared to be STEM, interactive sequential goal programming (ISGP), and interactive multiple goal programming (IMGP). Prototype microcomputer-based systems were developed to implement each of the three approaches. Although experience with the implementation is still relatively limited, it has involved actual planners and decision makers from both the fishing industry and from the relevant state department. The evidence is that IMGP is particularly useful in this context, and that it does seem to facilitate the reaching of consensus between different interest groups.  相似文献   
260.
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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