全文获取类型
收费全文 | 461篇 |
免费 | 11篇 |
国内免费 | 1篇 |
出版年
2019年 | 10篇 |
2018年 | 14篇 |
2017年 | 9篇 |
2016年 | 12篇 |
2015年 | 3篇 |
2014年 | 10篇 |
2013年 | 122篇 |
2012年 | 5篇 |
2010年 | 9篇 |
2007年 | 6篇 |
2005年 | 10篇 |
2004年 | 5篇 |
2003年 | 7篇 |
2002年 | 12篇 |
2000年 | 4篇 |
1999年 | 7篇 |
1998年 | 8篇 |
1997年 | 11篇 |
1996年 | 5篇 |
1995年 | 4篇 |
1994年 | 10篇 |
1993年 | 14篇 |
1992年 | 9篇 |
1991年 | 10篇 |
1990年 | 9篇 |
1989年 | 7篇 |
1988年 | 8篇 |
1987年 | 10篇 |
1986年 | 7篇 |
1985年 | 7篇 |
1984年 | 3篇 |
1983年 | 3篇 |
1982年 | 7篇 |
1981年 | 6篇 |
1980年 | 4篇 |
1979年 | 6篇 |
1978年 | 9篇 |
1977年 | 4篇 |
1976年 | 6篇 |
1975年 | 5篇 |
1974年 | 6篇 |
1973年 | 4篇 |
1972年 | 6篇 |
1971年 | 4篇 |
1970年 | 2篇 |
1969年 | 5篇 |
1968年 | 7篇 |
1967年 | 3篇 |
1966年 | 4篇 |
1948年 | 2篇 |
排序方式: 共有473条查询结果,搜索用时 15 毫秒
421.
John Stone 《Small Wars & Insurgencies》2014,25(3):669-684
The use of conventional armed forces in a deterrent role merits close consideration. Instability in weak or failing states can have global ramifications, while efforts to build stability take time. In principle, conventional deterrence can be used to buy the time required for such stabilization efforts. Attempts at deterrence will, however, need to overcome credibility problems stemming from the technical limitations associated with conventional armed forces, and with the likely requirement for multiple external actors to deter multiple intrastate audiences. While deterrence might work under certain circumstances, it will not play as central a role in strategy as it did during the Cold War. 相似文献
422.
Computational complexity of finding Pareto efficient outcomes for biobjective lot‐sizing models 下载免费PDF全文
In this article, we study a biobjective economic lot‐sizing problem with applications, among others, in green logistics. The first objective aims to minimize the total lot‐sizing costs including production and inventory holding costs, whereas the second one minimizes the maximum production and inventory block expenditure. We derive (almost) tight complexity results for the Pareto efficient outcome problem under nonspeculative lot‐sizing costs. First, we identify nontrivial problem classes for which this problem is polynomially solvable. Second, if we relax any of the parameter assumptions, we show that (except for one case) finding a single Pareto efficient outcome is an ‐hard task in general. Finally, we shed some light on the task of describing the Pareto frontier. © 2014 Wiley Periodicals, Inc. Naval Research Logistics 61: 386–402, 2014 相似文献
423.
We consider a class of facility location problems with a time dimension, which requires assigning every customer to a supply facility in each of a finite number of periods. Each facility must meet all assigned customer demand in every period at a minimum cost via its production and inventory decisions. We provide exact branch‐and‐price algorithms for this class of problems and several important variants. The corresponding pricing problem takes the form of an interesting class of production planning and order selection problems. This problem class requires selecting a set of orders that maximizes profit, defined as the revenue from selected orders minus production‐planning‐related costs incurred in fulfilling the selected orders. We provide polynomial‐time dynamic programming algorithms for this class of pricing problems, as well as for generalizations thereof. Computational testing indicates the advantage of our branch‐and‐price algorithm over various approaches that use commercial software packages. These tests also highlight the significant cost savings possible from integrating location with production and inventory decisions and demonstrate that the problem is rather insensitive to forecast errors associated with the demand streams. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011 相似文献
424.
Passenger prescreening is a critical component of aviation security systems. This paper introduces the Multilevel Allocation Problem (MAP), which models the screening of passengers and baggage in a multilevel aviation security system. A passenger is screened by one of several classes, each of which corresponds to a set of procedures using security screening devices, where passengers are differentiated by their perceived risk levels. Each class is defined in terms of its fixed cost (the overhead costs), its marginal cost (the additional cost to screen a passenger), and its security level. The objective of MAP is to assign each passenger to a class such that the total security is maximized subject to passenger assignments and budget constraints. This paper shows that MAP is NP‐hard and introduces a Greedy heuristic that obtains approximate solutions to MAP that use no more than two classes. Examples are constructed using data extracted from the Official Airline Guide. Analysis of the examples suggests that fewer security classes for passenger screening may be more effective and that using passenger risk information can lead to more effective security screening strategies. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006 相似文献
425.
对海战场综合态势进行态势评估和威胁分析是信息融合系统的最高层级,态势评估结果将对指挥员的指挥决策起到非常重要的作用。根据海军作战理论分析了海战场态势的表示方法,并基于模板方法设计了一种战场当前态势与模板数据库中态势进行匹配的算法。该算法特别适用于高层推理如态势或威胁评估。 相似文献
426.
R. H. Baker 《Defense & Security Analysis》1989,5(3):271-274
Izbrannye Proizvedennia. By M. V. Frunze. Moscow (1957) 相似文献
427.
428.
The bivariate negative binomial distribution of Mitchell and Paulson [17] for the case b = c = 0 is shown to be equivalent to the accident proneness model of Edwards and Gurland [4] and Subrahmaniam [19,20]. The diagonal series expansion of its joint probability function is then derived. Two other formulations of this distribution are also considered: (i) as a mixture model, which showed how it arises as the discrete analogue to the Wicksell-Kibble bivariate gamma distribution, and (ii) as a consequence of the linear birth-and-death process with immigration. 相似文献
429.
Soung H. Kim 《海军后勤学研究》1985,32(3):491-496
In the framework of a discrete Markov decision process with state information lag, this article suggests a way for selecting an optimal policy using the control limit rule. The properties sufficient for an optimal decision rule to be contained in the class of control limit rules are also studied. The degradation in expected reward from that of the perfect information process provides a measure of the potential value of improving the information system. 相似文献
430.
Consider the following situation: Each of N different combat units is presented with a number of requirements to satisfy, each requirement being classified into one of K mutually exclusive categories. For each unit and each category, an estimate of the probability of that unit satisfying any requirement in that category is desired. The problem can be generally stated as that of estimating N different K-dimensional vectors of probabilities based upon a corresponding set of K-dimensional vectors of sample proportions. An empirical Bayes model is formulated and applied to an example from the Marine Corps Combat Readiness Evaluation System (MCCRES). The EM algorithm provides a convenient method of estimating the prior parameters. The Bayes estimates are compared to the ordinary estimates, i.e., the sample proportions, by means of cross validation, and the Bayes estimates are shown to provide considerable improvement. 相似文献