首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   572篇
  免费   13篇
  2021年   6篇
  2019年   13篇
  2018年   9篇
  2017年   11篇
  2016年   9篇
  2015年   9篇
  2013年   105篇
  2010年   5篇
  2009年   9篇
  2008年   10篇
  2006年   5篇
  2005年   8篇
  2004年   12篇
  2003年   8篇
  2002年   5篇
  2001年   5篇
  2000年   7篇
  1999年   5篇
  1998年   7篇
  1997年   6篇
  1996年   17篇
  1995年   7篇
  1994年   9篇
  1993年   7篇
  1992年   11篇
  1991年   18篇
  1990年   7篇
  1989年   12篇
  1988年   12篇
  1987年   14篇
  1986年   16篇
  1985年   18篇
  1984年   9篇
  1983年   5篇
  1982年   5篇
  1981年   6篇
  1980年   12篇
  1979年   6篇
  1978年   9篇
  1977年   9篇
  1976年   9篇
  1975年   7篇
  1974年   8篇
  1972年   11篇
  1971年   12篇
  1970年   11篇
  1969年   8篇
  1968年   9篇
  1967年   9篇
  1966年   9篇
排序方式: 共有585条查询结果,搜索用时 15 毫秒
81.
ABSTRACT

When on the wrong end of an asymmetry in the projection of hard power, weaker sides countenance the grim arithmetic of avoiding direct and massed confrontations. Invariably, insurgents have over the ages tended to employ indirect tactical methods to render their stronger opponents ineffective. Ultimately – interest asymmetry, regime type, asymmetries of strategy, and external intervention – combine in a complex interplay and pattern, to militate against a strong side. In Sudan, these factors interacted throughout the civil wars to produce regional autonomy and finally an independent South Sudan in 2011. Similar strategic logic had confronted many large African states battling insurgencies in Ethiopia, Angola, Nigeria, Zaire, and apartheid-era South Africa. Oftentimes, weakening public resolve has caused these governments to accommodate, capitulate or withdraw even if they try not to blink. Notwithstanding the regime type, it can be concluded that the majority of strong actors are prone to fail in a protracted, asymmetric conflict. Hence, the notion of linking victory in counterinsurgency to the degree of openness (democratic polyarchies); or closeness (totalitarianism) – is still valid but highly contestable in the case of Africa’s large dysfunctional states.  相似文献   
82.
A new class of nonparametric reliability models is introduced and studied. A distribution is said to be better at age s than at age t (sBt) if the residual lifetime at age s is stochastically greater than or equal to the residual lifetime at age t. Applications to various forms of replacement policies, including the cannibalization of failed systems, are noted. For fixed s < t, the problem of estimating a survival curve assumed to belong to the sBt class is addressed using recursive methods. An sBt estimator is derived in closed form, and its uniform strong consistency at an optimal rate of convergence is demonstrated. A simulation study strongly supports the claim that the sBt estimator tends to outperform the empirical survivor function in small- and moderate-size samples. © 1993 John Wiley & Sons, Inc.  相似文献   
83.
We consider the problem of finding a plan that maximizes the expected discounted return when extracting a nonrenewable resource having uncertain reserves. An extraction plan specifies the rate at which the resource is extracted as a function of time until the resource is exhausted or the time horizon is reached. The return per unit of resource extracted may depend on the rate of extraction, time, and the amount of resource previously extracted. We apply a new method called the generalized search optimization technique to find qualitative features of optimal plans and to devise algorithms for the numerical calculation of optimal plans.  相似文献   
84.
Jobs with known processing times and due dates have to be processed on a machine which is subject to a single breakdown. The moment of breakdown and the repair time are independent random variables. Two cases are distinguished with reference to the processing time preempted by the breakdown (no other preemptions are allowed): (i) resumption without time losses and (ii) restart from the beginning. Under certain compatible conditions, we find the policies which minimize stochastically the number of tardy jobs.  相似文献   
85.
We consider a one-machine scheduling problem with earliness and tardiness penalties. All jobs are assigned a common due date and the objective is to minimize the total penalty due to job earliness and tardiness. We are interested in finding the optimal combination of the common due-date value and the job sequence. Despite the fact that this problem in general is very hard to solve, we prove that there exists at least a common property for all optimal solutions: The first job in an optimal sequence is one of the longest jobs. We also prove that this property holds for a general class of unimodal penalty functions.  相似文献   
86.
87.
A generalization of the equi-partitioning problem, termed the 2D-Partition Problem, is formulated. The motivation is an aircraft maintenance scheduling problem with the following characteristics. The complete maintenance overhaul of a single aircraft requires the completion of some 350 tasks. These tasks require a varying number of technicians working at the same time. For large subsets of these 350 tasks, the constraining resource is physical space—tasks must be completed in a physical space of limited size such as the cockpit. Furthermore, there is no precedence relationship among the tasks. For each subset, the problem is to schedule the tasks to minimize makespan. Let m denote the maximum number of technicians that can work at the same time in the physical area under consideration. We present optimization algorithms for m = 2 and 3. © 1996 John Wiley & Sons, Inc.  相似文献   
88.
This article develops a robust, exact algorithm for the maximal covering problem (MCP) using dual-based solution methods and greedy heuristics in branch and bound. Based on tests using randomly generated problems with problem parameters similar to those in the existing literature, the hybrid approach developed in this work appears to be effective over a wide range of MCP model parameters. The method is further validated on problems constructed from three real-world data sets. The extensive computational study compares the new method with other existing exact methods using problems that are as big, or larger than, those used in previous work on MCP. The results show that the proposed method is effective in most instances of MCP. In particular, it is shown that bounding schemes using Lagrangian relaxation are effective on MCP as a method of obtaining both exact and heuristic solutions. © 1996 John Wiley & Sons, Inc.  相似文献   
89.
Until only recently, the mechanism behind determining item price has been ignored and the discount price taken as a given in quantity-discount inventory decision problems. Inventory subject to declining demand further complicates both pricing and replenishment decisions. This article provides the vendor with the means for optimally determining both the discount price and replenishment order frequency for all buyers in the system in an environment of declining demand. In the multiple-buyer case, we provide an efficient algorithm for classifying buyers into homogeneous subgroups to further enhance joint cost savings among all system participants.  相似文献   
90.
Abstract

The Military Compensation and Retirement Modernization Commission was established by the Congress in 2013 to perform a systematic review of military compensation to address rising costs and other trends. Their recommendation for reforming the TRICARE health care program was sweeping, and differed greatly from earlier proposals that focused on increasing beneficiary cost shares. Specifically, the commission proposed overhauling the current benefit delivery model and replacing it with a premium-based insurance model offering a menu of DoD-sponsored private health plans. The analysis presented here is based on work that supported the commission by estimating the budgetary impact of its proposed reforms. Results indicate that movement towards the premium-based model would produce an annual budgetary cost savings in the $2 billion to $4 billion range, with a best savings estimate of $3.2 billion.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号