全文获取类型
收费全文 | 646篇 |
免费 | 189篇 |
国内免费 | 28篇 |
出版年
2023年 | 3篇 |
2022年 | 2篇 |
2021年 | 6篇 |
2020年 | 16篇 |
2019年 | 15篇 |
2018年 | 7篇 |
2017年 | 40篇 |
2016年 | 37篇 |
2015年 | 34篇 |
2014年 | 44篇 |
2013年 | 89篇 |
2012年 | 40篇 |
2011年 | 37篇 |
2010年 | 38篇 |
2009年 | 48篇 |
2008年 | 47篇 |
2007年 | 56篇 |
2006年 | 48篇 |
2005年 | 37篇 |
2004年 | 38篇 |
2003年 | 27篇 |
2002年 | 22篇 |
2001年 | 26篇 |
2000年 | 22篇 |
1999年 | 10篇 |
1998年 | 11篇 |
1997年 | 10篇 |
1996年 | 7篇 |
1995年 | 4篇 |
1994年 | 3篇 |
1993年 | 7篇 |
1992年 | 9篇 |
1991年 | 6篇 |
1990年 | 10篇 |
1989年 | 4篇 |
1988年 | 3篇 |
排序方式: 共有863条查询结果,搜索用时 15 毫秒
711.
利用AHP确定决策方案排序的一种改进方法 总被引:1,自引:1,他引:0
针对在用AHP法求解权重排序向量时 ,用不同的计算方法导致排序方案不一致的矛盾现象 ,提出了一种在单准则下综合各个排序方案信息的方法 ,使AHP法更趋于完善 相似文献
712.
In this paper the problem of minimizing makespan in a two‐machine openshop is examined. A heuristic algorithm is proposed, and its worst case performance ratio and complexity are analyzed. The average case performance is evaluated using an empirical study. © 1999 John Wiley & Sons, Inc. Naval Research Logistics 46: 129–145, 1999 相似文献
713.
Typically weapon systems have an inherent systematic error and a random error for each round, centered around its mean point of impact. The systematic error is common to all aimings. Assume such a system for which there is a preassigned amount of ammunition of n rounds to engage a given target simultaneously, and which is capable of administering their fire with individual aiming points (allowing “offsets”). The objective is to determine the best aiming points for the system so as to maximize the probability of hitting the target by at least one of the n rounds. In this paper we focus on the special case where the target is linear (one‐dimensional) and there are no random errors. We prove that as long as the aiming error is symmetrically distributed and possesses one mode at zero, the optimal aiming is independent of the particular error distribution, and we specify the optimal aiming points. Possible extensions are further discussed, as well as civilian applications in manufacturing, radio‐electronics, and detection. © 1999 John Wiley & Sons, Inc. Naval Research Logistics 46: 323–333, 1999 相似文献
714.
We apply the techniques of response surface methodology (RSM) to approximate the objective function of a two‐stage stochastic linear program with recourse. In particular, the objective function is estimated, in the region of optimality, by a quadratic function of the first‐stage decision variables. The resulting response surface can provide valuable modeling insight, such as directions of minimum and maximum sensitivity to changes in the first‐stage variables. Latin hypercube (LH) sampling is applied to reduce the variance of the recourse function point estimates that are used to construct the response surface. Empirical results show the value of the LH method by comparing it with strategies based on independent random numbers, common random numbers, and the Schruben‐Margolin assignment rule. In addition, variance reduction with LH sampling can be guaranteed for an important class of two‐stage problems which includes the classical capacity expansion model. © 1999 John Wiley & Sons, Inc. Naval Research Logistics 46: 753–776, 1999 相似文献
715.
Various indices of component importance with respect to system reliability have been proposed. The most popular one is the Birnbaum importance. In particular, a special case called uniform Birnbaum importance in which all components have the same reliability p has been widely studied for the consecutive‐k system. Since it is not easy to compare uniform Birnbaum importance, the literature has looked into the case p = ½, p → 1, or p ≥ ½. In this paper, we look into the case p → 0 to complete the spectrum of examining Birnbaum importance over the whole range of p. © 2002 Wiley Periodicals, Inc. Naval Research Logistics 49: 159–166, 2002; DOI 10.1002/nav.10001 相似文献
716.
In this paper a case study dealing with the maintenance problem of jib cranes is presented. A jib crane is viewed as a complex system whose performance is observed as a single realization over period of time. After pointing out limitations of existing stochastic models to analyze the observed realization a new family of bivariate stochastic processes is introduced. The data of jib crane is analyzed using new model and cross‐validated using part of the data set. It is noted that the new family of stochastic processes is useful to analyze bivariate data where one of the variables is finitely valued and the other is nonnegative and continuous. © 2002 Wiley Periodicals, Inc. Naval Research Logistics 49: 231–243, 2002; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/nav.10006 相似文献
717.
We consider the ??p‐norm multi‐facility minisum location problem with linear and distance constraints, and develop the Lagrangian dual formulation for this problem. The model that we consider represents the most general location model in which the dual formulation is not found in the literature. We find that, because of its linear objective function and less number of variables, the Lagrangian dual is more useful. Additionally, the dual formulation eliminates the differentiability problem in the primal formulation. We also provide the Lagrangian dual formulation of the multi‐facility minisum location problem with the ??pb‐norm. Finally, we provide a numerical example for solving the Lagrangian dual formulation and obtaining the optimum facility locations from the solution of the dual formulation. © 2002 Wiley Periodicals, Inc. Naval Research Logistics 49: 410–421, 2002; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/nav.10010 相似文献
718.
719.
Snke Hartmann 《海军后勤学研究》2002,49(5):433-448
This papers deals with the classical resource‐constrained project scheduling problem (RCPSP). There, the activities of a project have to be scheduled subject to precedence and resource constraints. The objective is to minimize the makespan of the project. We propose a new heuristic called self‐adapting genetic algorithm to solve the RCPSP. The heuristic employs the well‐known activity list representation and considers two different decoding procedures. An additional gene in the representation determines which of the two decoding procedures is actually used to compute a schedule for an individual. This allows the genetic algorithm to adapt itself to the problem instance actually solved. That is, the genetic algorithm learns which of the alternative decoding procedures is the more successful one for this instance. In other words, not only the solution for the problem, but also the algorithm itself is subject to genetic optimization. Computational experiments show that the mechanism of self‐adaptation is capable to exploit the benefits of both decoding procedures. Moreover, the tests show that the proposed heuristic is among the best ones currently available for the RCPSP. © 2002 Wiley Periodicals, Inc. Naval Research Logistics 49: 433–448, 2002; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/nav.10029 相似文献
720.
邱建雄 《国防科技大学学报》2002,24(1):77-80
介绍了Hook技术的基本概念和方法 ,对常用的几类Hook技术重点进行了分析 ,并举例说明了在进行软件研发时 ,这些Hook技术可以应用的场合 ,最后介绍了在电子字典 ,带滚轮的鼠标驱动程序等实际软件开发项目过程中 ,如何应用Hook技术的详细方法和步骤 相似文献