全文获取类型
收费全文 | 506篇 |
免费 | 17篇 |
出版年
2021年 | 10篇 |
2020年 | 5篇 |
2019年 | 13篇 |
2018年 | 5篇 |
2017年 | 7篇 |
2016年 | 12篇 |
2015年 | 9篇 |
2014年 | 7篇 |
2013年 | 77篇 |
2011年 | 6篇 |
2009年 | 6篇 |
2007年 | 15篇 |
2005年 | 5篇 |
2004年 | 7篇 |
2003年 | 9篇 |
2002年 | 8篇 |
2001年 | 5篇 |
1999年 | 10篇 |
1998年 | 9篇 |
1997年 | 10篇 |
1996年 | 10篇 |
1995年 | 4篇 |
1994年 | 9篇 |
1993年 | 13篇 |
1992年 | 11篇 |
1991年 | 13篇 |
1990年 | 12篇 |
1989年 | 19篇 |
1988年 | 18篇 |
1987年 | 8篇 |
1986年 | 15篇 |
1985年 | 8篇 |
1984年 | 6篇 |
1982年 | 10篇 |
1981年 | 8篇 |
1980年 | 7篇 |
1979年 | 9篇 |
1978年 | 9篇 |
1977年 | 7篇 |
1976年 | 6篇 |
1975年 | 5篇 |
1974年 | 12篇 |
1973年 | 5篇 |
1972年 | 4篇 |
1971年 | 10篇 |
1970年 | 6篇 |
1969年 | 7篇 |
1968年 | 4篇 |
1967年 | 7篇 |
1948年 | 5篇 |
排序方式: 共有523条查询结果,搜索用时 15 毫秒
421.
Given a positive integer R and a weight for each vertex in a graph, the maximum-weight connected graph problem (MCG) is to find a connected subgraph with R vertices that maximizes the sum of their weights. MCG has applications to communication network design and facility expansion. The constrained MCG (CMCG) is MCG with a constraint that one predetermined vertex must be included in the solution. In this paper, we introduce a class of decomposition algorithms for MCG. These algorithms decompose MCG into a number of small CMCGs by adding vertices one at a time and building a partial graph. They differ in the ordering of adding vertices. Proving that finding an ordering that gives the minimum number of CMCGs is NP-complete, we present three heuristic algorithms. Experimental results show that these heuristics are very effective in reducing computation and that different orderings can significantly affect the number of CMCGs to be solved. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 817–837, 1998 相似文献
422.
We describe the development of a heuristic algorithm for determining efficient 2-dimensional packings in cargo aircraft where cargo placement constraints are critically important in determining the feasibility of packing locations. We review the performance of a new algorithm versus some traditional ones for aircraft loading. The algorithm is also tested in a more generalized setting where there exist no additional constraints on items, to suggest applicability in other environments. The new algorithm has been used worldwide in the Automated Air Load Planning System (AALPS) for cargo aircraft loading, with much success. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 751–768, 1998 相似文献
423.
424.
Ken R. McNaught 《海军后勤学研究》2002,49(7):627-646
In this paper, Markovian models of three‐on‐one stochastic firefights between ground‐based weapon systems are developed. These models address a common scenario of interest to the military, but one which has been much neglected in analytic combat models, that of combat between a hidden defender and an exposed attacking force. Each combatant must detect an opponent before commencing their firing cycle, a task which is considerably more difficult for the attacker. In the models developed here, the defender detects the exposed attacking group after an exponentially distributed time interval, while each attacker has a fixed probability of detecting the defender via the flash signature produced after each shot fired by him. The utility of the approach is demonstrated by investigating what impact the introduction of a coordinated gun‐laying system for the attacking force might have, a system made possible by battlefield digitization. The method used here allows models to be developed incrementally. This and other advantages of the Markovian approach are discussed. © 2002 Wiley Periodicals, Inc. Naval Research Logistics 49: 627–646, 2002; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/nav.10041 相似文献
425.
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 相似文献
426.
427.
This article examines measures of economic efficiency in aircraft production. In particular, a type of nonlinear frontier estimation is contrasted with more traditional methods for estimating a dynamic cost function. This cost function is grounded in economic theory, and it is consistent with knowledge of the aircraft-production process. The model includes the effects of both learning and production rate on total program costs. The usefulness of the model is demonstrated with an example that relates to the acquisition of military equipment. It is shown through various sensitivity analyses that an alternative procurement policy for an aircraft program could have resulted in increased efficiency and hence a lower total program cost to the government. 相似文献
428.
In this article we consider a single-server, bulk-service queueing system in which the waiting room is of finite capacity. Arrival process is Poisson and all the arrivals taking place when the waiting room is full are lost. The service times are generally distributed independent random variables and the distribution is depending on the batch size being served. Using renewal theory, we derive the time-dependent solution for the system-size probabilities at arbitrary time points. Also we give expressions for the distribution of virtual waiting time in the queue at any time t. 相似文献
429.
The problem considered in this article is a generalization of the familiar makespan problem, in which n jobs are allocated among m parallel processors, so as to minimize the maximum time (or cost) on any processor. Our problem is more general, in that we allow the processors to have (a) different initial costs, (b) different utilization levels before new costs are incurred, and (c) different rates of cost increase. A heuristic adapted from the bin-packing problem is shown to provide solutions which are close to optimal as the number of iterations is allowed to increase. Computational testing, over a large number of randomly generated problem instances, suggests that heuristic errors are, on average, very small. 相似文献
430.
This article is devoted to an MCDM problem connected with locational analysis. The MCDM problem can be formulated so as to minimize the distance between a facility and a given set of points. The efficient points of this problem are candidates for optimal solutions to many location problems. We propose an algorithm to find all efficient points when distance is measured by any polyhedral norm. 相似文献