全文获取类型
收费全文 | 651篇 |
免费 | 17篇 |
出版年
2019年 | 8篇 |
2018年 | 7篇 |
2017年 | 12篇 |
2016年 | 12篇 |
2015年 | 13篇 |
2014年 | 7篇 |
2013年 | 119篇 |
2011年 | 7篇 |
2009年 | 10篇 |
2007年 | 8篇 |
2005年 | 10篇 |
2004年 | 13篇 |
2003年 | 8篇 |
2002年 | 9篇 |
2001年 | 8篇 |
2000年 | 6篇 |
1999年 | 9篇 |
1998年 | 9篇 |
1997年 | 11篇 |
1996年 | 14篇 |
1995年 | 13篇 |
1994年 | 16篇 |
1993年 | 12篇 |
1992年 | 16篇 |
1991年 | 23篇 |
1990年 | 8篇 |
1989年 | 9篇 |
1988年 | 12篇 |
1987年 | 14篇 |
1986年 | 12篇 |
1985年 | 18篇 |
1984年 | 10篇 |
1983年 | 8篇 |
1982年 | 6篇 |
1981年 | 10篇 |
1980年 | 9篇 |
1979年 | 14篇 |
1978年 | 10篇 |
1977年 | 10篇 |
1976年 | 11篇 |
1975年 | 10篇 |
1974年 | 12篇 |
1973年 | 8篇 |
1972年 | 16篇 |
1971年 | 12篇 |
1970年 | 11篇 |
1969年 | 8篇 |
1968年 | 8篇 |
1967年 | 10篇 |
1966年 | 5篇 |
排序方式: 共有668条查询结果,搜索用时 15 毫秒
211.
We consider server scheduling on parallel dedicated machines to minimize the makespan. Each job has a loading operation and a processing operation. The loading operation requires a server that serves all the jobs. Each machine has a given set of jobs to process, and the processing sequence is known and fixed. We design a polynomial‐time algorithm to solve the two‐machine case of the problem. When the number of machines is arbitrary, the problem becomes strongly NP‐hard even if all the jobs have the same processing length or all the loading operations require a unit time. We design two heuristic algorithms to treat the case where all the loading times are unit and analyze their performance. 相似文献
212.
Thomas C. Bruneau 《Defense & Security Analysis》2018,34(4):345-364
ABSTRACTThe article argues that current conceptual approaches in civil-military relations are deeply flawed resulting in its irrelevance in analyzing major issues including war and the collapse of democracy. After highlighting major flaws in the work of the late Samuel Huntington and those who follow his approach, the article argues that other conceptual approaches, including Security Sector Reform, are also flawed, or in the case of the “military effectiveness” literature, largely irrelevant. In explaining the main causes of the flawed conceptual literature, the article highlights the absence of good data and challenges in methodology. While arguing that military forces are very unlikely to engage in armed combat, it highlights the roles and missions which in the world today are implanted by these forces. As it is virtually impossible to prove effectiveness of the armed forces in these roles and missions, the article proposes a conceptual approach based on requirements. 相似文献
213.
Ana E. Juncos 《Contemporary Security Policy》2018,39(4):559-574
With the failure of liberal peace strategies in the Global South, resilience has recently become the risk management strategy par excellence in peacebuilding. Since it is not possible to predict when the next crisis will take place, peacebuilders must invest in bottom-up adaptive capacities to cope with external shocks. This article moves away from governmentality accounts of resilience which are overtly deterministic and depoliticizing. Instead, it posits that the uncertainty, ambiguity, and complexity associated with resilience mean that we should expect opportunities for contestation and institutional agency. This argument will be illustrated by drawing upon the European Union’s adoption of the resilience approach in its peacebuilding and security policies. The article argues that while uncertainty, ambiguity, and complexity constitute the ontological conditions that underpin the rise of resilience in peacebuilding, they are also likely to lead to its potential demise. 相似文献
214.
Discrete‐time queues with D‐MAP arrival process are more useful in modeling and performance analysis of telecommunication networks based on the ATM environment. This paper analyzes a finite‐buffer discrete‐time queue with general bulk‐service rule, wherein the arrival process is D‐MAP and service times are arbitrarily and independently distributed. The distributions of buffer contents at various epochs (departure, random, and prearrival) have been obtained using imbedded Markov chain and supplementary variable methods. Finally, some performance measures such as loss probability and average delay are discussed. Numerical results are also presented in some cases. © 2003 Wiley Periodicals, Inc. Naval Research Logistics 50: 345–363, 2003. 相似文献
215.
T.C. Edwin Cheng Qing Ding Mikhail Y. Kovalyov Aleksander Bachman Adam Janiak 《海军后勤学研究》2003,50(6):531-554
We study the problems of scheduling a set of nonpreemptive jobs on a single or multiple machines without idle times where the processing time of a job is a piecewise linear nonincreasing function of its start time. The objectives are the minimization of makespan and minimization of total job completion time. The single machine problems are proved to be NP‐hard, and some properties of their optimal solutions are established. A pseudopolynomial time algorithm is constructed for makespan minimization. Several heuristics are derived for both total completion time and makespan minimization. Computational experiments are conducted to evaluate their efficiency. NP‐hardness proofs and polynomial time algorithms are presented for some special cases of the parallel machine problems. © 2003 Wiley Periodicals, Inc. Naval Research Logistics 50: 531–554, 2003 相似文献
216.
John E. Angus 《海军后勤学研究》1987,34(6):845-851
The confidence coefficient of a two-sided confidence interval for the binomial parameter p is the infimum of the coverage probability of the interval as p ranges between 0 and 1. The confidence coefficients for five different approximate confidence intervals are computed and compared to the confidence coefficient for the two-sided Clopper-Pearson confidence interval. Pratt's approximation method [10] yields virtually the same confidence coefficients as the Clopper-Pearson interval, and is easily computed without resorting to interative methods. 相似文献
217.
A problem often arising in applied linear regression modeling is determining the appropriate weight to attach to each observation. In the extreme, the problem extends to the deletion of observations from a data base. Since the choice of weights, fitting criteria, and estimation procedure depend on the specific objectives of the modeling, universally applicable guidelines are virtually nonexistent. However, the sensitivity of analytic conclusions to weights assigned to “suspect” observations can be conveniently assessed using a graphical display. This report develops such a display based on a modeling of outliers which leads naturally to estimators based on a weighted least-squares criterion, and a data-analytic method for determining how much downweighting to impose on a specific subset of observations. This technique is illustrated with several examples, including one relating air pollution to human mortality. 相似文献
218.
In an earlier article we showed that, for facilities-location problems characterized by generalized distance norms and any even number of existing facilities, the optimal location of the new facility is at the intersection of the lines joining the pairs of facilities if these lines intersect at a single point. In this article we extend this concept to show that, for a more general class of problems, the optimal location is one of a set of points which is specified by the existing facilities. 相似文献
219.
In this article we present and test two heuristics for the economic lot scheduling problem. The first heuristic was developed by one of us (P.C. Geng) during Ph.D. research, while the other is a convergent implementation of an algorithm due to Doll and Whybark. We study the performance of these heuristics on a large set of test problems constructed using a new form of problem generation that yields random problems within an experimental design. 相似文献
220.