全文获取类型
收费全文 | 449篇 |
免费 | 10篇 |
出版年
2020年 | 6篇 |
2019年 | 11篇 |
2018年 | 12篇 |
2017年 | 12篇 |
2016年 | 12篇 |
2015年 | 11篇 |
2013年 | 117篇 |
2011年 | 4篇 |
2009年 | 7篇 |
2008年 | 7篇 |
2007年 | 3篇 |
2006年 | 5篇 |
2005年 | 7篇 |
2004年 | 7篇 |
2003年 | 4篇 |
2001年 | 3篇 |
2000年 | 4篇 |
1999年 | 6篇 |
1998年 | 6篇 |
1997年 | 6篇 |
1996年 | 12篇 |
1995年 | 6篇 |
1994年 | 10篇 |
1993年 | 6篇 |
1992年 | 8篇 |
1991年 | 15篇 |
1990年 | 5篇 |
1989年 | 7篇 |
1988年 | 6篇 |
1987年 | 8篇 |
1986年 | 13篇 |
1985年 | 13篇 |
1984年 | 5篇 |
1983年 | 3篇 |
1982年 | 4篇 |
1980年 | 5篇 |
1979年 | 3篇 |
1978年 | 3篇 |
1977年 | 5篇 |
1976年 | 4篇 |
1975年 | 3篇 |
1974年 | 5篇 |
1973年 | 3篇 |
1972年 | 9篇 |
1971年 | 6篇 |
1970年 | 8篇 |
1969年 | 4篇 |
1968年 | 6篇 |
1967年 | 5篇 |
1966年 | 4篇 |
排序方式: 共有459条查询结果,搜索用时 0 毫秒
111.
The paper proposes an algorithm for the determination of the solution of the activities to be shortened and the amount by which they are to be shortened in order to minimize the total cost of project completion. This cost involves a linear penalty for tardienss of a set of key events and a linear cost of activity compression from its normal duration. The procedure is a generalization of the work of Fulkerson. 相似文献
112.
Alvin E. Roth 《海军后勤学研究》1978,25(2):365-367
We consider a class of asymmetric two-person games played on graphs, and characterize all the positions in the game. 相似文献
113.
114.
The maximum likelihood estimator (MLE) for a distribution function with increasing failure rate is derived, based on a collection of series system data. Applications can arise in industries where operating environments make available only such system-level data, due to system configuration or type-II censoring. The estimator can be solved using isotonic regression. For the special case in which systems contain one component, the estimator is equivalent to the restricted maximum likelihood estimator of Marshall and Proschan [9]. The MLE is illustrated using emergency diesel generator failure data from the nuclear industry. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 115–123, 1998 相似文献
115.
This paper introduces a general or “distribution‐free” model to analyze the lifetime of components under accelerated life testing. Unlike the accelerated failure time (AFT) models, the proposed model shares the advantage of being “distribution‐free” with the proportional hazard (PH) model and overcomes the deficiency of the PH model not allowing survival curves corresponding to different values of a covariate to cross. In this research, we extend and modify the extended hazard regression (EHR) model using the partial likelihood function to analyze failure data with time‐dependent covariates. The new model can be easily adopted to create an accelerated life testing model with different types of stress loading. For example, stress loading in accelerated life testing can be a step function, cyclic, or linear function with time. These types of stress loadings reduce the testing time and increase the number of failures of components under test. The proposed EHR model with time‐dependent covariates which incorporates multiple stress loadings requires further verification. Therefore, we conduct an accelerated life test in the laboratory by subjecting components to time‐dependent stresses, and we compare the reliability estimation based on the developed model with that obtained from experimental results. The combination of the theoretical development of the accelerated life testing model verified by laboratory experiments offers a unique perspective to reliability model building and verification. © 1999 John Wiley & Sons, Inc. Naval Research Logistics 46: 303–321, 1999 相似文献
116.
Scheduling a set of n jobs on a single machine so as to minimize the completion time variance is a well‐known NP‐hard problem. In this paper, we propose a sequence, which can be constructed in O(n log n) time, as a solution for the problem. Our primary concern is to establish the asymptotical optimality of the sequence within the framework of probabilistic analysis. Our main result is that, when the processing times are randomly and independently drawn from the same uniform distribution, the sequence is asymptotically optimal in the sense that its relative error converges to zero in probability as n increases. Other theoretical results are also derived, including: (i) When the processing times follow a symmetric structure, the problem has 2⌊(n−1)/2⌋ optimal sequences, which include our proposed sequence and other heuristic sequences suggested in the literature; and (ii) when these 2⌊(n−1)/2⌋ sequences are used as approximate solutions for a general problem, our proposed sequence yields the best approximation (in an average sense) while another sequence, which is commonly believed to be a good approximation in the literature, is interestingly the worst. © 1999 John Wiley & Sons, Inc. Naval Research Logistics 46: 373–398, 1999 相似文献
117.
Richard E. Chatwin 《海军后勤学研究》1996,43(5):603-612
Consider a multi-period multi-fare class airline overbooking problem that relates to a single-leg flight. Passengers may cancel their reservations at any time, including being no-shows at flight-time. Canceling passengers receive a refund that depends on their fare class, e.g., supersaver, coach, etc. At flight-time, the airline bumps passengers in excess of flight capacity and pays a penalty for so doing. A continuous state-space dynamic programming model is developed in which the state is the numbers of reservations currently on hand in each fare class. In each period, reservation requests occur in only one fare class and the fraction of reservations canceling in each class is independent of the number of reservations therein. A booking-limit policy is optimal, i.e., in each period the airline accepts reservation requests up to a booking limit if the number of initial reservations in the fare class is less than the booking limit, and declines reservation requests otherwise. The booking limits for each class depend on the numbers of reservations in the other classes. When there are two fare classes the optimal booking limits in each class decrease with the number of reservations in the other class. © 1996 John Wiley & Sons, Inc. 相似文献
118.
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. 相似文献
119.
The rise of China has been fuelled by a massive military modernisation programme relying, in large part, on the acquisition of foreign military equipment. The question of how the world’s major powers define their arms transfer policies towards China is therefore crucially important. This article makes two original contributions. First, drawing on neoclassical realism, it proposes an explanatory framework integrating international and domestic factors to explain variations in major powers’ arms transfers. Second, based on a large body of elite interviews and diplomatic cables, it offers the first comprehensive comparison of American, British, French and Russian arms transfer policies towards China since the end of the Cold War. 相似文献
120.
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. 相似文献