首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   653篇
  免费   13篇
  2021年   7篇
  2020年   6篇
  2019年   10篇
  2018年   5篇
  2017年   15篇
  2016年   14篇
  2015年   9篇
  2014年   13篇
  2013年   85篇
  2012年   22篇
  2011年   28篇
  2010年   24篇
  2009年   17篇
  2008年   30篇
  2007年   14篇
  2006年   18篇
  2005年   8篇
  2004年   6篇
  2002年   9篇
  2001年   7篇
  1999年   4篇
  1998年   8篇
  1997年   10篇
  1995年   6篇
  1994年   6篇
  1993年   18篇
  1992年   10篇
  1991年   9篇
  1989年   15篇
  1988年   13篇
  1987年   12篇
  1986年   16篇
  1985年   16篇
  1984年   9篇
  1983年   7篇
  1982年   7篇
  1981年   9篇
  1980年   14篇
  1979年   14篇
  1978年   8篇
  1977年   11篇
  1976年   9篇
  1975年   7篇
  1974年   8篇
  1972年   14篇
  1971年   10篇
  1970年   6篇
  1969年   12篇
  1968年   8篇
  1966年   4篇
排序方式: 共有666条查询结果,搜索用时 15 毫秒
61.
In this paper, we derive new families of facet‐defining inequalities for the finite group problem and extreme inequalities for the infinite group problem using approximate lifting. The new valid inequalities for the finite group problem include two‐ and three‐slope facet‐defining inequalities as well as the first family of four‐slope facet‐defining inequalities. The new valid inequalities for the infinite group problem include families of two‐ and three‐slope extreme inequalities. These new inequalities not only illustrate the diversity of strong inequalities for the finite and infinite group problems, but also provide a large variety of new cutting planes for solving integer and mixed‐integer programming problems. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008  相似文献   
62.
军事总体设计是技术总体设计的基础,是模拟训练系统设计的首要任务.对于战术互联网模拟训练系统军事总体设计中的有关问题,采用对比和比较法,对系统军事总体需求和框架进行了研究,明确了战术互联网模拟训练系统的训练方式、使用流程、功能体系等内容,为下一步系统的技术总体方案设计以及实现奠定了良好基础.  相似文献   
63.
对于机动目标,运动补偿后目标相对于雷达的转动不能近似为匀速转动,而是更接近于匀加速转动,此时传统的距离多普勒成像算法不能得到很好的成像结果.分析总结了几种针对非匀速转动的时频联合分析算法,提出了一种基于参数化时频分析-AGCD快速算法的匀加速旋转目标成像算法,仿真表明了该算法具有精度高、速度快且无交叉项的优点,比原有的一些算法有较大的改进.  相似文献   
64.
影响图建模算法的改进   总被引:1,自引:0,他引:1  
影响图建模方法是一种规范化的复杂系统建模方法,其实质是将表征复杂系统的参量及参量间的耦合关系进行分类,并以此为基础建立系统的数学模型.影响图建模算法就是将系统的参量及参量间的耦合关系进行分类的算法.目前使用的算法是James R.Burns于1979年提出的.该算法仅考虑了最小的反馈回路,而没有考虑影响图中存在的一般反馈回路,且一些操作造成了不必要的循环.在分析该算法的基础上,考虑了一般的反馈回路,并对原算法的操作步骤进行了优化重组.  相似文献   
65.
A machine-replacement problem is analyzed in a technological-development environment, in which a new-type machine (built by a new technology) may appear in the future. The solution of the replacement problem depends on purchasing, operating, and resale costs, and on the probability distribution of the market debut of the new technology, and it indicates whether to replace the existing machine now with an available similar type of machine, or to continue to operate the existing machine for at least one more period. A dynamic discounted cost model is presented, and a method is suggested for finding the optimal age for replacement of an existing machine (under rather general conditions of a technological environment). A solution procedure and a numerical example are given.  相似文献   
66.
Observations from inspection by a “test” method and a standard method are combined to provide estimators of population proportion, and of probabilities of misclassification for the test method. Results of Hochberg and Tenenbein [3] and of Albers and Veldman [1] are extended to the case where the standard method is not perfect, but its misclassification probabilities have known values. Both moment and maximum-likelihood estimators are considered and some asymptotic properties of the resulting estimators are compared.  相似文献   
67.
Orienteering is a sport in which start and end points are specified along with other locations. These other locations have associated scores. Competitors seek to visit, in a fixed amount of time, a subset of these locations on the way from the start point to the end point in order to maximize the total score. An effective center-of-gravity heuristic is presented that outperforms heuristics from the literature.  相似文献   
68.
Variations of Hale's channel assignment problem, the L(j, k)‐labeling problem and the radio labeling problem require the assignment of integers to the vertices of a graph G subject to various distance constraints. The λj,k‐number of G and the radio number of G are respectively the minimum span among all L(j, k)‐labelings, and the minimum span plus 1 of all radio labelings of G (defined in the Introduction). In this paper, we establish the λj,k‐number of ∏ K for pairwise relatively prime integers t1 < t2 < … < tq, t1 ≥ 2. We also show the existence of an infinite class of graphs G with radio number |V(G)| for any diameter d(G). © 2003 Wiley Periodicals, Inc. Naval Research Logistics, 2005  相似文献   
69.
In this article, we discuss the optimal allocation problem in a multiple stress levels life‐testing experiment when an extreme value regression model is used for statistical analysis. We derive the maximum likelihood estimators, the Fisher information, and the asymptotic variance–covariance matrix of the maximum likelihood estimators. Three optimality criteria are defined and the optimal allocation of units for two‐ and k‐stress level situations are determined. We demonstrate the efficiency of the optimal allocation of units in a multiple stress levels life‐testing experiment by using real experimental situations discussed earlier by McCool and Nelson and Meeker. Monte Carlo simulations are used to show that the optimality results hold for small sample sizes as well. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2007  相似文献   
70.
We consider the integrated problem of optimally maintaining an imperfect, deteriorating sensor and the safety‐critical system it monitors. The sensor's costless observations of the binary state of the system become less informative over time. A costly full inspection may be conducted to perfectly discern the state of the system, after which the system is replaced if it is in the out‐of‐control state. In addition, a full inspection provides the opportunity to replace the sensor. We formulate the problem of adaptively scheduling full inspections and sensor replacements using a partially observable Markov decision process (POMDP) model. The objective is to minimize the total expected discounted costs associated with system operation, full inspection, system replacement, and sensor replacement. We show that the optimal policy has a threshold structure and demonstrate the value of coordinating system and sensor maintenance via numerical examples. © 2017 Wiley Periodicals, Inc. Naval Research Logistics 64: 399–417, 2017  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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