全文获取类型
收费全文 | 437篇 |
免费 | 5篇 |
出版年
2019年 | 4篇 |
2018年 | 8篇 |
2017年 | 8篇 |
2016年 | 11篇 |
2015年 | 6篇 |
2014年 | 4篇 |
2013年 | 135篇 |
2010年 | 5篇 |
2008年 | 4篇 |
2007年 | 3篇 |
2006年 | 3篇 |
2005年 | 8篇 |
2004年 | 3篇 |
2003年 | 6篇 |
2002年 | 7篇 |
2000年 | 5篇 |
1999年 | 5篇 |
1997年 | 4篇 |
1996年 | 6篇 |
1995年 | 7篇 |
1994年 | 8篇 |
1993年 | 8篇 |
1992年 | 5篇 |
1991年 | 6篇 |
1990年 | 3篇 |
1989年 | 8篇 |
1988年 | 7篇 |
1987年 | 10篇 |
1986年 | 10篇 |
1985年 | 6篇 |
1984年 | 3篇 |
1983年 | 4篇 |
1982年 | 9篇 |
1981年 | 3篇 |
1980年 | 6篇 |
1979年 | 5篇 |
1978年 | 9篇 |
1977年 | 5篇 |
1976年 | 4篇 |
1975年 | 7篇 |
1974年 | 7篇 |
1973年 | 6篇 |
1972年 | 8篇 |
1971年 | 10篇 |
1970年 | 5篇 |
1969年 | 8篇 |
1968年 | 7篇 |
1967年 | 3篇 |
1966年 | 3篇 |
1948年 | 3篇 |
排序方式: 共有442条查询结果,搜索用时 15 毫秒
221.
222.
223.
224.
The article develops a theorem which shows that the Lanchester linear war equations are not in general equal to the Kolmogorov linear war equations. The latter are time‐consuming to solve, and speed is important when a large number of simulations must be run to examine a large parameter space. Run times are provided, where time is a scarce factor in warfare. Four time efficient approximations are presented in the form of ordinary differential equations for the expected sizes and variances of each group, and the covariance, accounting for reinforcement and withdrawal of forces. The approximations are compared with “exact” Monte Carlo simulations and empirics from the WWII Ardennes campaign. The band spanned out by plus versus minus the incremented standard deviations captures some of the scatter in the empirics, but not all. With stochastically varying combat effectiveness coefficients, a substantial part of the scatter in the empirics is contained. The model is used to forecast possible futures. The implications of increasing the combat effectiveness coefficient governing the size of the Allied force, and injecting reinforcement to the German force during the Campaign, are evaluated, with variance assessments. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005. 相似文献
225.
Modeling R&D as standard sequential search, we consider a monopolist who can implement a sequence of technological discoveries during the technology search process: he earns revenue on his installed technology while he engages in R&D to find improved technology. What is not standard is that he has a finite number of opportunities to introduce improved technology. We show that his optimal policy is characterized by thresholds ξi(x): introduce the newly found technology if and only if it exceeds ξi(x) when x is the state of the currently installed technology and i is the number of remaining introductions allowed. We also analyze a nonstationary learning‐by‐doing model in which the monopolist's experience in implementing new technologies imparts increased capability in generating new technologies. Because this nonstationary model is not in the class of monotone stopping problems, a number of surprising results hold and several seemingly obvious properties of the stationary model no longer hold. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011 相似文献
226.
We develop models that lend insight into how to design systems that enjoy economies of scale in their operating costs, when those systems will subsequently face disruptions from accidents, acts of nature, or an intentional attack from a well‐informed attacker. The systems are modeled as parallel M/M/1 queues, and the key question is how to allocate service capacity among the queues to make the system resilient to worst‐case disruptions. We formulate this problem as a three‐level sequential game of perfect information between a defender and a hypothetical attacker. The optimal allocation of service capacity to queues depends on the type of attack one is facing. We distinguish between deterministic incremental attacks, where some, but not all, of the capacity of each attacked queue is knocked out, and zero‐one random‐outcome (ZORO) attacks, where the outcome is random and either all capacity at an attacked queue is knocked out or none is. There are differences in the way one should design systems in the face of incremental or ZORO attacks. For incremental attacks it is best to concentrate capacity. For ZORO attacks the optimal allocation is more complex, typically, but not always, involving spreading the service capacity out somewhat among the servers. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011 相似文献
227.
In this paper we study a capacity allocation problem for two firms, each of which has a local store and an online store. Customers may shift among the stores upon encountering a stockout. One question facing each firm is how to allocate its finite capacity (i.e., inventory) between its local and online stores. One firm's allocation affects the decision of the rival, thereby creating a strategic interaction. We consider two scenarios of a single‐product single‐period model and derive corresponding existence and stability conditions for a Nash equilibrium. We then conduct sensitivity analysis of the equilibrium solution with respect to price and cost parameters. We also prove the existence of a Nash equilibrium for a generalized model in which each firm has multiple local stores and a single online store. Finally, we extend the results to a multi‐period model in which each firm decides its total capacity and allocates this capacity between its local and online stores. A myopic solution is derived and shown to be a Nash equilibrium solution of a corresponding “sequential game.” © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006 相似文献
228.
229.
The British Military Covenant can be located in and from many sources and from 2011 onwards in primary legislation. This article argues that the provision of military housing amounts to an early test of how the military covenant is understood and used by those involved in defence policy, and those in the armed forces affected by it. It finds that housing was a prominent feature of how service personnel understood how they were valued, but was not explicitly understood as a covenant issue by those personnel or the officials in charge of the Defence Estates. We locate three reasons for this: (1) the covenant has been poorly translated from aspiration into policy practice, (2) the covenant is unevenly understood across its stakeholders which has the effect of generating disappointment through misaligned expectations, (3) those engaged in the reform process surrounding the Defence Infrastructure Organisation (DIO) saw the covenant as a means to energise reform. Ultimately housing was seen as a dry and technocratic business area and thus an issue ripe for being refracted through the covenant was ultimately left outside of its remit. 相似文献
230.
In a recent article we demonstrated that implicit optimal modeling for shift scheduling (P2) has inherent size and execution time advantages over the general set-covering formulation for shift scheduling (P1) [11, 13]. We postulated that the absence of extraordinary overlap (EO) was a requirement for the equivalence of P1 and P2. We have defined EO as the condition in which the earliest and latest starts for a break in one shift are earlier and later than the earliest and latest starts for a break in any other shift(s). In this article, we prove that our earlier postulate was accurate. Additionally, we discuss research extensions and note other scheduling problems for which implicit modeling may be appropriate. © 1996 John Wiley & Sons, Inc. 相似文献