全文获取类型
收费全文 | 440篇 |
免费 | 15篇 |
国内免费 | 1篇 |
出版年
2021年 | 10篇 |
2019年 | 13篇 |
2018年 | 11篇 |
2017年 | 7篇 |
2016年 | 8篇 |
2014年 | 10篇 |
2013年 | 70篇 |
2012年 | 6篇 |
2010年 | 8篇 |
2009年 | 8篇 |
2007年 | 10篇 |
2006年 | 4篇 |
2005年 | 8篇 |
2004年 | 8篇 |
2002年 | 12篇 |
2001年 | 6篇 |
2000年 | 6篇 |
1999年 | 6篇 |
1998年 | 10篇 |
1997年 | 10篇 |
1996年 | 5篇 |
1995年 | 10篇 |
1994年 | 8篇 |
1993年 | 13篇 |
1992年 | 9篇 |
1991年 | 11篇 |
1990年 | 10篇 |
1989年 | 9篇 |
1988年 | 12篇 |
1987年 | 9篇 |
1986年 | 9篇 |
1985年 | 6篇 |
1984年 | 5篇 |
1983年 | 5篇 |
1982年 | 6篇 |
1981年 | 8篇 |
1980年 | 6篇 |
1979年 | 6篇 |
1978年 | 8篇 |
1977年 | 8篇 |
1976年 | 5篇 |
1975年 | 6篇 |
1974年 | 5篇 |
1973年 | 8篇 |
1972年 | 4篇 |
1971年 | 3篇 |
1969年 | 5篇 |
1968年 | 6篇 |
1966年 | 3篇 |
1948年 | 3篇 |
排序方式: 共有456条查询结果,搜索用时 15 毫秒
61.
Arriving (generic) jobs may be processed at one of several service stations, but only when no other (dedicated) jobs are waiting there. We consider the problem of how to route these incoming background jobs to make best use of the spare service capacity available at the stations. We develop an approximative approach to Whittle's proposal for restless bandits to obtain an index policy for routing. The indices concerned are increasing and nonlinear in the station workload. A numerical study testifies to the strong performance of the index policies developed. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004 相似文献
62.
In this paper we study higher‐order Markov chain models for analyzing categorical data sequences. We propose an efficient estimation method for the model parameters. Data sequences such as DNA and sales demand are used to illustrate the predicting power of our proposed models. In particular, we apply the developed higher‐order Markov chain model to the server logs data. The objective here is to model the users' behavior in accessing information and to predict their behavior in the future. Our tests are based on a realistic web log and our model shows an improvement in prediction. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004 相似文献
63.
The ability to effectively match supply and demand under uncertainty can result in significant revenue benefits in the airline industry. We study the benefits of a Demand Driven Swapping (DDS) approach that takes advantage of the flexibilities in the system and dynamically swaps aircraft as departures near and more accurate demand information is obtained. We analyze the effectiveness of different DDS strategies, characterized by their frequency (how often the swapping decision is revised), in hedging against demand uncertainty. Swapping aircraft several weeks prior to departures will not cause much disturbance to revenue management and operations, but will be based on highly uncertain demands. On the other hand, revising the swapping decision later will decrease the possibility of bad swaps, but at a higher cost of disrupting airport services and operations. Our objective is to provide guidelines on how the flexible (swappable) capacity should be managed in the system. We study analytical models to gain insights into the critical parameters that affect the revenue benefits of the different swapping strategies. Our study determines the conditions under which each of the different DDS strategies is effective. We complement our analysis by testing the proposed DDS strategies on a set of flight legs, using data obtained from United Airlines. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004. 相似文献
64.
Matthew H. Wahlert 《Defense & Security Analysis》2012,28(3):247-259
The goal of this article is to challenge the assumption of rationality in the behavior of decision-making units involved in security, defense, intelligence and warfare and to consider the influence of “motivated bias” in such instances. A review of motivational literature within international politics and a discussion of literature applying “motivated biases” to warfare and strategic surprise will offer an alternative view of the primacy of rationality in such decisions. 相似文献
65.
66.
In many location problems, the solution is constrained to lie within a closed set. In this paper, optimal solutions to a special type of constrained location problem are characterized. In particular, the location problem with the solution constrained to be within a maximum distance of each demand point is considered, and an algorithm for its solution is developed and discussed. 相似文献
67.
Let X1 < X2 <… < Xn denote an ordered sample of size n from a Weibull population with cdf F(x) = 1 - exp (?xp), x > 0. Formulae for computing Cov (Xi, Xj) are well known, but they are difficult to use in practice. A simple approximation to Cov(Xi, Xj) is presented here, and its accuracy is discussed. 相似文献
68.
Computerized Scheduling of Seagoing Tankers The tanker scheduling problem considered in this paper is that of the Defense Fuel Supply Center (DFSC) and the Military Sealift Command (MSC) in the worldwide distribution of bulk petroleum products. Routes and cargoes which meet delivery schedule dates for a multiplicity of product requirements at minimum cost are to be determined for a fleet of tankers. A general mathematical programming model is presented, and then a mixed integer model is developed which attempts to reflect the true scheduling task of DFSC and MSC as closely as possible. The problem is kept to within a workable size by the systematic construction of a set of tanker routes which does not contain many possible routes that can be judged unacceptable from practical considerations alone. 相似文献
69.
A modified generalized programming procedure is presented for solving concave programming problems with equality constraints. The procedure constructs convenient linear approximations of the gradient of the dual and finds points where the approximating functions vanish. In the quadratic programming case, the procedure is finitely convergent. Global convergence is established for the non-quadratic case. Illustrative numerical examples are included. 相似文献
70.
Charles H. Heider 《海军后勤学研究》1973,20(4):699-724
The component placement problem is a specialization of the quadratic assignment problem that has been extensively studied for a decade and which is of considerable practical value. Recently, interest in component placement algorithms has risen primarily as a result of increased activity in the field of computer-aided design automation. This paper deals with the methodology of component placement and is based on the results of considerable operational experience. A tutorial presentation of tree search placement algorithms is provided, and an improved placement procedure is described which is demonstrated to be effective in generating near optimal solutions to the component placement problem. These solutions are completely reproducible and are obtained at an acceptable expenditure of computational resources. An additional objective is an assessment of performance of the class of near optimal algorithms. In particular, the question- how close to optimal are the near optimal solutions- is examined. 相似文献