全文获取类型
收费全文 | 414篇 |
免费 | 11篇 |
出版年
2020年 | 3篇 |
2019年 | 7篇 |
2018年 | 5篇 |
2017年 | 8篇 |
2016年 | 10篇 |
2015年 | 8篇 |
2014年 | 5篇 |
2013年 | 105篇 |
2011年 | 5篇 |
2010年 | 3篇 |
2009年 | 7篇 |
2008年 | 7篇 |
2006年 | 3篇 |
2005年 | 8篇 |
2004年 | 8篇 |
2003年 | 4篇 |
2000年 | 3篇 |
1999年 | 4篇 |
1998年 | 5篇 |
1997年 | 3篇 |
1996年 | 9篇 |
1995年 | 4篇 |
1994年 | 7篇 |
1993年 | 6篇 |
1992年 | 10篇 |
1991年 | 13篇 |
1990年 | 3篇 |
1989年 | 6篇 |
1988年 | 6篇 |
1987年 | 10篇 |
1986年 | 12篇 |
1985年 | 15篇 |
1984年 | 4篇 |
1983年 | 5篇 |
1981年 | 2篇 |
1980年 | 4篇 |
1979年 | 6篇 |
1978年 | 4篇 |
1977年 | 6篇 |
1976年 | 6篇 |
1975年 | 2篇 |
1974年 | 5篇 |
1973年 | 4篇 |
1972年 | 12篇 |
1971年 | 6篇 |
1970年 | 11篇 |
1969年 | 6篇 |
1968年 | 4篇 |
1967年 | 7篇 |
1966年 | 6篇 |
排序方式: 共有425条查询结果,搜索用时 62 毫秒
131.
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. 相似文献
132.
The reformulation‐linearization technique (RLT) is a methodology for constructing tight linear programming relaxations of mixed discrete problems. A key construct is the multiplication of “product factors” of the discrete variables with problem constraints to form polynomial restrictions, which are subsequently linearized. For special problem forms, the structure of these linearized constraints tends to suggest that certain classes may be more beneficial than others. We examine the usefulness of subsets of constraints for a family of 0–1 quadratic multidimensional knapsack programs and perform extensive computational tests on a classical special case known as the 0–1 quadratic knapsack problem. We consider RLT forms both with and without these inequalities, and their comparisons with linearizations derived from published methods. Interestingly, the computational results depend in part upon the commercial software used. © 2009 Wiley Periodicals, Inc. Naval Research Logistics, 2010 相似文献
133.
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. 相似文献
134.
Richard M. Soland 《海军后勤学研究》1987,34(3):337-363
It is desired to select numbers of area and point interceptors that minimize the cost of such defensive missiles under the condition that the maximum total expected damage produced by an unknown number of attacking missiles A be bounded above by a given function of A. Area coverages may overlap. The attacker is assumed to know the numbers of area and point interceptors and to launch a simultaneous attack (of arbitrary size A) against all targets, which is optimal against the given defenses. The defender is assumed to observe the attack and then allocate his area and point interceptors against attacking missiles so as to minimize the total expected damage. Upper and lower bounds on the minimal cost are obtained by solving integer programming problems. 相似文献
135.
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. 相似文献
136.
137.
We consider a processing network in which jobs arrive at a fork‐node according to a renewal process. Each job requires the completion of m tasks, which are instantaneously assigned by the fork‐node to m task‐processing nodes that operate like G/M/1 queueing stations. The job is completed when all of its m tasks are finished. The sojourn time (or response time) of a job in this G/M/1 fork‐join network is the total time it takes to complete the m tasks. Our main result is a closed‐form approximation of the sojourn‐time distribution of a job that arrives in equilibrium. This is obtained by the use of bounds, properties of D/M/1 and M/M/1 fork‐join networks, and exploratory simulations. Statistical tests show that our approximation distributions are good fits for the sojourn‐time distributions obtained from simulations. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008 相似文献
138.
Richard A. Aborisade 《African Security Review》2018,27(2):177-190
This article focuses on the systemic failures of the Nigerian police force to unravel the mysteries surrounding homicides in the country, along with the security, social and political implications of the ongoing trend. The article draws on documented pieces of evidence of high-profile murders, along with the causes of the upsurge in murder incidences and the inhibitive factors relating to the investigative procedures of the police. The suitability of the theory of subaltern realism and the concept of third-world security predicaments in explaining the peculiarities of Nigeria’s internal security challenges is examined, along with the problems of the legitimacy of political regimes and weak borders. There is a need for the National Assembly of Nigeria to exercise its constituted powers in reawakening and supervising investigations into dormant cases of murder through its committees on police affairs, public safety and national security. The police should check its organisational failures, which may be related to using the wrong investigative approaches, low levels of information, limited resources, corrupt practices, and pressure to obtain quick results. 相似文献
139.
140.
It has been argued that the discovery of a new natural resource greatly increases the risk of conflict. This research aims to study the effect of natural resources on military spending, using the data from rentier states in the Middle East and North Africa (MENA) countries from 1987 to 2012. In considering the ‘resource curse,’ the types of natural resources matter. Our empirical results demonstrate that the ‘resource curse’ arising from the abundance of certain natural resources, particularly oil and forest resources, leads to increases in military spending. In contrast, the rent from coal and natural gas has a negative impact on military spending, while the rent from minerals has no impact on military spending, controlling for GDP growth and per capita income. 相似文献