首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   491篇
  免费   7篇
  2021年   4篇
  2019年   9篇
  2018年   12篇
  2017年   8篇
  2016年   10篇
  2015年   5篇
  2014年   6篇
  2013年   120篇
  2010年   7篇
  2008年   7篇
  2006年   3篇
  2005年   7篇
  2004年   6篇
  2003年   8篇
  2002年   8篇
  2001年   4篇
  2000年   7篇
  1999年   3篇
  1998年   6篇
  1997年   7篇
  1996年   11篇
  1995年   6篇
  1994年   5篇
  1993年   9篇
  1992年   8篇
  1991年   11篇
  1990年   7篇
  1989年   11篇
  1988年   9篇
  1987年   13篇
  1986年   10篇
  1985年   7篇
  1984年   8篇
  1983年   3篇
  1982年   6篇
  1981年   7篇
  1980年   11篇
  1979年   6篇
  1978年   12篇
  1977年   5篇
  1976年   7篇
  1975年   8篇
  1974年   7篇
  1972年   6篇
  1971年   11篇
  1970年   6篇
  1969年   7篇
  1968年   7篇
  1967年   5篇
  1966年   7篇
排序方式: 共有498条查询结果,搜索用时 500 毫秒
141.
The compound Poisson “local” formulation of the Stein-Chen method is applied to problems in reliability theory. Bounds for the accuracy of the approximation of the reliability by an appropriate compound Poisson distribution are derived under fairly general conditions, and are applied to consecutive-2 and connected-s systems, and the 2-dimensional consecutive-k-out-ofn system, together with a pipeline model. The approximations are usually better than the Poisson “local” approach would give. © 1996 John Wiley & Sons, Inc.  相似文献   
142.
Components in a complex system are usually not structurally identical. However, in many cases we may find components that are structurally symmetric, and one should make use of this additional information to simplify reliability analysis. The main purpose of this article is to define and study one such class of systems, namely, those having symmetric components, and to derive some reliability-related properties. © 1996 John Wiley & Sons, Inc.  相似文献   
143.
We schedule a set of illuminators (homing devices) to strike a set of targets using surface-to-air missiles in a naval battle. The task is viewed as a production floor shop scheduling problem of minimizing the total weighted flow time, subject to time-window job availability and machine downtime side constraints. A simple algorithm based on solving assignment problems is developed for the case when all the job processing times are equal and the data are all integer. For the general case of scheduling jobs with unequal processing times, we develop two alternate formulations and analyze their relative strengths by comparing their respective linear programming relaxations. We select the better formulation in this comparison and exploit its special structures to develop several effective heuristic algorithms that provide good-quality solutions in real time; this is an essential element for use by the Navy. © 1995 John Wiley & Sons, Inc.  相似文献   
144.
The problem of scheduling n jobs on m parallel machines is considered when the machines are subject to random breakdowns and job processing times are random variables. An objective function of mean flow time is developed for a general parallel machine system, and an expression of its expected value is derived. The problem is transformed into a deterministic unrelated parallel machine scheduling model with modified processing times when the number of breakdowns is modeled as a generalized Poisson process. © 1994 John Wiley & Sons, Inc.  相似文献   
145.
The United States military frequently has difficulty retaining enlisted personnel beyond their initial enlistment. A bonus program within each service, called a Selective Reenlistment Bonus (SRB) program, seeks to enhance reenlistments and thus reduce personnel shortages in critical military occupational specialties (MOSs). The amount of bonus is set by assigning “SRB multipliers” to each MOS. We develop a nonlinear integer program to select multipliers which minimize a function of deviations from desired reenlistment targets. A Lagrangian relaxation of a linearized version of the integer program is used to obtain lower bounds and feasible solutions. The best feasible solution, discovered in a coordinate search of the Lagrangian function, is heuristically improved by apportioning unexpended funds. For large problems a heuristic variable reduction is employed to speed model solution. U.S. Army data and requirements for FY87 yield a 0-1 integer program with 12,992 binary variables and 273 constraints, which is solved within 0.00002% of optimality on an IBM 3033AP in less than 1.7 seconds. More general models with up to 463,000 binary variables are solved, on average, to within 0.009% of optimality in less than 1.8 minutes. The U.S. Marine Corps has used a simpler version of this model since 1986. © 1993 John Wiley & Sons, Inc.  相似文献   
146.
147.
In this article we study the quadratic assignment problem by embedding the actual data in a data space which satisfies an extension of the metric triangle property. This leads to simpler computations for the determination of heuristic solutions. Bounds are given for the loss of optimality which such heuristic solutions would involve in any specific instance. © 1993 John Wiley & Sons, Inc.  相似文献   
148.
The system under study is a single item, two‐echelon production‐inventory system consisting of a capacitated production facility, a central warehouse, and M regional distribution centers that satisfy stochastic demand. Our objective is to determine a system base‐stock level which minimizes the long run average system cost per period. Central to the approach are (1) an inventory allocation model and associated convex cost function designed to allocate a given amount of system inventory across locations, and (2) a characterization of the amount of available system inventory using the inventory shortfall random variable. An exact model must consider the possibility that inventories may be imbalanced in a given period. By assuming inventory imbalances cannot occur, we develop an approximation model from which we obtain a lower bound on the per period expected cost. Through an extensive simulation study, we analyze the quality of our approximation, which on average performed within 0.50% of the lower bound. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 377–398, 2000  相似文献   
149.
针对单一算法对混合尺寸目标进行时域电磁分析的困难,提出一种时域伪谱(PSTD)同时域有限体积(FVTD)混合方法。FVTD可方便地分析复杂的几何结构和材料,但是难以计算电大尺寸的目标,PSTD则特别适合计算电大尺寸的规则结构,但在模拟复杂的几何结构尤其是带有曲边结构以及电大、电小共存结构时存在困难。混合方法克服了单独算法的缺点,融合各自的优势,提高了算法的求解能力和应用范围。为了减小两种算法连接边界带来的反射,采用了FVTD计算面均值的二次函数重构方法,给出了交叠网格和非交叠网格两种混合方案。数值试验表明,混合方法有较高的精度,具有时域分析混合尺寸目标电磁问题的能力。  相似文献   
150.
What is the relationship between drug violence and political attitudes? In this article, we test the relationship between violence and trust using both individual and municipality data for Mexico from 2006 to 12. Using multilevel analysis, we find no support for the thesis that individual experiences with criminal violence drives trust, nor do we find a relationship between levels of violence at the municipio level and trust. However, we do find that perceived threats to individual security leads to less social and institutional trust, but this is independent of personal experience and whether the individual resides in violent communities.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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