首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   653篇
  免费   0篇
  653篇
  2021年   7篇
  2019年   12篇
  2018年   8篇
  2017年   10篇
  2016年   14篇
  2015年   8篇
  2014年   6篇
  2013年   110篇
  2009年   10篇
  2008年   5篇
  2007年   14篇
  2005年   10篇
  2004年   10篇
  2003年   11篇
  2002年   8篇
  2000年   6篇
  1999年   7篇
  1998年   8篇
  1997年   10篇
  1996年   16篇
  1995年   6篇
  1994年   11篇
  1993年   13篇
  1992年   12篇
  1991年   21篇
  1990年   11篇
  1989年   22篇
  1988年   17篇
  1987年   14篇
  1986年   21篇
  1985年   18篇
  1984年   7篇
  1983年   6篇
  1982年   11篇
  1981年   8篇
  1980年   10篇
  1979年   11篇
  1978年   10篇
  1977年   10篇
  1976年   8篇
  1975年   5篇
  1974年   13篇
  1973年   7篇
  1972年   10篇
  1971年   11篇
  1970年   12篇
  1969年   9篇
  1968年   5篇
  1967年   10篇
  1948年   5篇
排序方式: 共有653条查询结果,搜索用时 0 毫秒
641.
We consider a generalized minmax programming problem, and establish, under certain weaker convexity assumptions, the Fritz John sufficient optimality conditions for such a problem. A dual program is introduced and using those optimality conditions duality theorems are proved relating the dual and the primal. Duality for the generalized fractional programming problem is considered as an application of the results proved.  相似文献   
642.
This article is devoted to an MCDM problem connected with locational analysis. The MCDM problem can be formulated so as to minimize the distance between a facility and a given set of points. The efficient points of this problem are candidates for optimal solutions to many location problems. We propose an algorithm to find all efficient points when distance is measured by any polyhedral norm.  相似文献   
643.
644.
    
We present techniques for classifying Markov chains with a continuous state space as either ergodic or recurrent. These methods are analogous to those of Foster for countable space chains. The theory is presented in the first half of the paper, while the second half consists of examples illustrating these techniques. The technique for proving ergodicity involves, in practice, three steps: showing that the chain is irreducible in a suitable sense; verifying that the mean hitting times on certain (usually bounded) sets are bounded, by using a “mean drift” criterion analogous to that of Foster; and finally, checking that the chain is such that bounded mean hitting times for these sets does actually imply ergodicity. The examples comprise a number of known and new results: using our techniques we investigate random walks, queues with waiting-time-dependent service times, dams with general and random-release rules, the s-S inventory model, and feedback models.  相似文献   
645.
    
A simple method is presented for deriving the mean and variance of the queueing time distribution in an M/G/1 queue when the priorities assigned to customers have an assignment probability distribution. Several examples illustrate the results. The mean and variance of the queueing time distribution for the longest service time discipline are derived, and its disadvantages are discussed.  相似文献   
646.
    
It is well known that a minimal makespan permutation sequence exists for the n × 3 flow shop problem and for the n × m flow shop problem with no inprocess waiting when processing times for both types of problems are positive. It is shown in this paper that when the assumption of positive processing times is relaxed to include nonnegative processing times, optimality of permutation schedules cannot be guaranteed.  相似文献   
647.
    
This paper describes a technique for the calculation of the probability that a helicopter can lift a specified load, or number of loads with a specified frequency distribution, in a given geographical region. This probability is computed by determining the bivariate altitude-temperature probability distribution for the specified region. The payload capability at any given temperature and altitude is calculated from standard performance equations. By integrating this over the altitude-temperature distribution, it is possible to obtain the probability distribution of payload capability, from which the required probabilities of lifting specific loads can be determined.  相似文献   
648.
In this article an algorithm for computing upper and lower ? approximations of a (implicitly or explicitly) given convex function h defined on an interval of length T is developed. The approximations can be obtained under weak assumptions on h (in particular, no differentiability), and the error decreases quadratically with the number of iterations. To reach an absolute accuracy of ? the number of iterations is bounded by

  相似文献   

649.
    
We formulate exact expressions for the expected values of selected estimators of the variance parameter (that is, the sum of covariances at all lags) of a steady‐state simulation output process. Given in terms of the autocovariance function of the process, these expressions are derived for variance estimators based on the simulation analysis methods of nonoverlapping batch means, overlapping batch means, and standardized time series. Comparing estimator performance in a first‐order autoregressive process and the M/M/1 queue‐waiting‐time process, we find that certain standardized time series estimators outperform their competitors as the sample size becomes large. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007  相似文献   
650.
Two big ideas have shaped recent debate about military doctrine: the Revolution in Military Affairs (RMA) and Counterinsurgency (COIN). These ‘network centric’ and ‘population centric’ worldviews appear contradictory, but this is a false dichotomy. American forces have actively developed RMA concepts in COIN environments during recent wars in Iraq and Afghanistan; the exemplar par excellence is innovation by US Special Operations Command (SOCOM) in doctrine, technology, and organization for counterterrorism. Ironically, SOCOM's reimagining of the RMA managed to both improve the strengths and underscore the weaknesses of the American military's technological prowess.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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