全文获取类型
收费全文 | 594篇 |
免费 | 13篇 |
出版年
2019年 | 15篇 |
2018年 | 9篇 |
2017年 | 11篇 |
2016年 | 12篇 |
2015年 | 11篇 |
2014年 | 6篇 |
2013年 | 124篇 |
2011年 | 6篇 |
2010年 | 8篇 |
2007年 | 6篇 |
2006年 | 7篇 |
2005年 | 12篇 |
2004年 | 9篇 |
2003年 | 5篇 |
2001年 | 5篇 |
2000年 | 9篇 |
1999年 | 6篇 |
1998年 | 8篇 |
1997年 | 10篇 |
1996年 | 14篇 |
1995年 | 6篇 |
1994年 | 10篇 |
1993年 | 8篇 |
1992年 | 12篇 |
1991年 | 17篇 |
1990年 | 9篇 |
1989年 | 13篇 |
1988年 | 11篇 |
1987年 | 14篇 |
1986年 | 12篇 |
1985年 | 14篇 |
1984年 | 9篇 |
1983年 | 9篇 |
1982年 | 6篇 |
1981年 | 9篇 |
1980年 | 10篇 |
1979年 | 11篇 |
1978年 | 9篇 |
1977年 | 9篇 |
1976年 | 11篇 |
1975年 | 7篇 |
1974年 | 11篇 |
1973年 | 10篇 |
1972年 | 12篇 |
1971年 | 14篇 |
1970年 | 6篇 |
1969年 | 8篇 |
1968年 | 5篇 |
1967年 | 6篇 |
1966年 | 5篇 |
排序方式: 共有607条查询结果,搜索用时 0 毫秒
471.
Determination of the gunfire probability of kill against a target requires two parameters to be taken into consideration: the likelihood of hitting the target (susceptibility) and the conditional probability of kill given a hit (vulnerability). Two commonly used methods for calculating the latter probability are (1) treating each hit upon the target independently, and (2) setting an exact number of hits to obtain a target kill. Each of these methods contains an implicit assumption about the probability distribution of the number of hits‐to‐kill. Method (1) assumes that the most likely kill scenario occurs with exactly one hit, whereas (2) implies that achieving a precise number of hits always results in a kill. These methods can produce significant differences in the predicted gun effectiveness, even if the mean number of hits‐to‐kill for each distribution is the same. We therefore introduce a new modeling approach with a more general distribution for the number of hits‐to‐kill. The approach is configurable to various classes of damage mechanism and is able to match both methods (1) and (2) with a suitable choice of parameter. We use this new approach to explore the influence of various damage accumulation models on the predicted effectiveness of weapon‐target engagements. 相似文献
472.
Lauren R. Heller Robert A. Lawson Ryan H. Murphy Claudia R. Williamson 《Defence and Peace Economics》2018,29(4):355-382
Economic freedom has increased living standards worldwide. Concurrent with such gains are rising concerns about potential human costs associated with free markets. This paper uses data on human trafficking and anti-trafficking policies, in conjunction with a measure of economic freedom, to examine whether free markets exacerbate or attenuate the incidence of human trafficking and policies designed to combat it. We do not find evidence suggesting that economic freedom is associated with human trafficking. In addition, our results suggest that economically free countries are more likely to enact and enforce policies to fight human trafficking. 相似文献
473.
This article provides conditions under which total‐cost and average‐cost Markov decision processes (MDPs) can be reduced to discounted ones. Results are given for transient total‐cost MDPs with transition rates whose values may be greater than one, as well as for average‐cost MDPs with transition probabilities satisfying the condition that there is a state such that the expected time to reach it is uniformly bounded for all initial states and stationary policies. In particular, these reductions imply sufficient conditions for the validity of optimality equations and the existence of stationary optimal policies for MDPs with undiscounted total cost and average‐cost criteria. When the state and action sets are finite, these reductions lead to linear programming formulations and complexity estimates for MDPs under the aforementioned criteria.© 2017 Wiley Periodicals, Inc. Naval Research Logistics 66:38–56, 2019 相似文献
474.
We study an (R, s, S) inventory control policy with stochastic demand, lost sales, zero lead‐time and a target service level to be satisfied. The system is modeled as a discrete time Markov chain for which we present a novel approach to derive exact closed‐form solutions for the limiting distribution of the on‐hand inventory level at the end of a review period, given the reorder level (s) and order‐up‐to level (S). We then establish a relationship between the limiting distributions for adjacent values of the reorder point that is used in an efficient recursive algorithm to determine the optimal parameter values of the (R, s, S) replenishment policy. The algorithm is easy to implement and entails less effort than solving the steady‐state equations for the corresponding Markov model. Point‐of‐use hospital inventory systems share the essential characteristics of the inventory system we model, and a case study using real data from such a system shows that with our approach, optimal policies with significant savings in inventory management effort are easily obtained for a large family of items. 相似文献
475.
Corine M. Laan Ana Isabel Barros Richard J. Boucherie Herman Monsuur Judith Timmer 《海军后勤学研究》2019,66(2):174-190
In this paper, we introduce partially observable agent‐intruder games (POAIGs). These games model dynamic search games on graphs between security forces (an agent) and an intruder given possible (border) entry points and high value assets that require protection. The agent faces situations with dynamically changing, partially observable information about the state of the intruder and vice versa. The agent may place sensors at selected locations, while the intruder may recruit partners to observe the agent's movement. We formulate the problem as a two‐person zero‐sum game, and develop efficient algorithms to compute each player's optimal strategy. The solution to the game will help the agent choose sensor locations and design patrol routes that can handle imperfect information. First, we prove the existence of ?‐optimal strategies for POAIGs with an infinite time horizon. Second, we introduce a Bayesian approximation algorithm to identify these ?‐optimal strategies using belief functions that incorporate the imperfect information that becomes available during the game. For the solutions of large POAIGs with a finite time horizon, we use a solution method common to extensive form games, namely, the sequence form representation. To illustrate the POAIGs, we present several examples and numerical results. 相似文献
476.
We consider a problem of scheduling jobs on m parallel machines. The machines are dedicated, i.e., for each job the processing machine is known in advance. We mainly concentrate on the model in which at any time there is one unit of an additional resource. Any job may be assigned the resource and this reduces its processing time. A job that is given the resource uses it at each time of its processing. No two jobs are allowed to use the resource simultaneously. The objective is to minimize the makespan. We prove that the two‐machine problem is NP‐hard in the ordinary sense, describe a pseudopolynomial dynamic programming algorithm and convert it into an FPTAS. For the problem with an arbitrary number of machines we present an algorithm with a worst‐case ratio close to 3/2, and close to 3, if a job can be given several units of the resource. For the problem with a fixed number of machines we give a PTAS. Virtually all algorithms rely on a certain variant of the linear knapsack problem (maximization, minimization, multiple‐choice, bicriteria). © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008 相似文献
477.
The article considers a two-person competitive problem in which a traveller wishes to choose a path across a rectangle from left to right in such a way as to avoid being ambushed by his adversary who has placed obstacles within the rectangle. Our results supplement those that have already been obtained by Ruckle and they indicate that, under certain conditions, the players need to adopt rather sophisticated strategies if they are to act optimally. This suggests that a complete solution to the problem could be difficult. 相似文献
478.
Given point-to-point demand forecasts of transmission facilities for services such as voice or data transmission in each period of a finite planning horizon, a decision has to be made as to which types of transmission facilities—together with the amounts of transmission circuits—are to be installed, if any, on each link of the telecommunications network, in each period of the planning horizon. The availability of alternative transmission systems with significantly different costs and circuit capacities necessitates the determination of a minimum (discounted) cost facility installation scheme. This combinatoric choice problem is complicated by the availability of switching equipments enabling the transmission of some of the traffic through intermediary points. This possibility of alternately routing the traffic or the facility requirements of certain point pairs further complicates the problem while creating the opportunity to benefit from economies of scale. We present here a heuristic method for finding a good solution for the general problem; namely, we consider multiple transmission systems and multiple alternate routes. Numerical examples are given and computational experience is reported. 相似文献
479.
In this article we model a two-echelon (two levels of repair, one level of supply) repairable-item inventory system using continuous-time Markov processes. We analyze two models. In the first model we assume a system with a single base. In the second model we expand this model to include n bases. The Markov approach gives rise to multidimensional state spaces that are large even for relatively small problems. Because of this, we utilize aggregate/disaggregate techniques to develop a solution algorithm for finding the steady-state distribution. This algorithm is exact for the single-base model and is an approximation for the n-base model, in which case it is found to be very accurate and computationally very efficient. 相似文献
480.
Previous lot-sizing models incorporating learning effects focus exclusively on worker learning. We extend these models to include the presence of setup learning, which occurs when setup costs exhibit a learning curve effect as a function of the number of lots produced. The joint worker/setup learning problem can be solved to optimality by dynamic programming. Computational experience indicates, however, that solution times are sensitive to certain problem parameters, such as the planning horizon and/or the presence of a lower bound on worker learning. We define a two-phase EOQ-based heuristic for the problem when total transmission of worker learning occurs. Numerical results show that the heuristic consistently generates solutions well within 1% of optimality. 相似文献