首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   498篇
  免费   10篇
  2021年   5篇
  2019年   13篇
  2018年   9篇
  2017年   11篇
  2016年   9篇
  2015年   10篇
  2013年   85篇
  2011年   5篇
  2010年   6篇
  2009年   4篇
  2007年   6篇
  2006年   7篇
  2005年   11篇
  2004年   8篇
  2003年   5篇
  2001年   5篇
  2000年   9篇
  1999年   6篇
  1998年   5篇
  1997年   10篇
  1996年   12篇
  1995年   4篇
  1994年   11篇
  1993年   7篇
  1992年   7篇
  1991年   15篇
  1990年   9篇
  1989年   14篇
  1988年   7篇
  1987年   13篇
  1986年   9篇
  1985年   14篇
  1984年   9篇
  1983年   7篇
  1982年   7篇
  1981年   9篇
  1980年   10篇
  1979年   8篇
  1978年   8篇
  1977年   8篇
  1976年   9篇
  1975年   6篇
  1974年   13篇
  1973年   8篇
  1972年   11篇
  1971年   13篇
  1970年   3篇
  1969年   6篇
  1968年   5篇
  1967年   3篇
排序方式: 共有508条查询结果,搜索用时 15 毫秒
1.
The Cavalry Goes Through. By Bernard Newman. Henry Holt, New York (1930)  相似文献   
2.
3.
4.
Sufficient conditions under which the relevation of two probability distributions is (i) NBU, (ii) IFRA, (iii) IFR are derived. The result for case (iii) corrects an error in a previous article by Baxter.  相似文献   
5.
6.
This article shows how simple systems of linear equations with {0,1} variables can be aggregated into a single linear equation whose {0,1} solutions are identical to the solutions of the original system. Structures of the original systems are exploited to keep the aggregator's integer coefficients from becoming unnecessarily large. The results have potential application in integer programming and information theory, especially for problems that contain assignment-type constraints along with other constraints. Several unresolved questions of a number-theoretic nature are mentioned at the conclusion of the article.  相似文献   
7.
In this article, we examine the problem of producing a spanning Eulerian subgraph in an undirected graph. After the ?-completeness of the general problem is established, we present polynomial-time algorithms for both the maximization and minimization versions where instances are defined on a restricted class of graphs referred to as series-parallel. Some novelties in the minimization case are discussed, as are heuristic ideas.  相似文献   
8.
9.
Procedures for solving multiple criteria problems are receiving increasing attention. Two major solution approaches are those involving prior articulation and progressive articulation of preference information. A progressive articulation (interactive) optimization approach, called the Paired Comparison Method (PCM) is compared to the prior articulation approach of a priori utility function measurement in a quality control decision environment from the perspective of the decision maker. The three major issues investigated included: (1) the ease of use of each method, (2) the preferences of solutions obtained, and (3) the insight provided by the methodology into the nature and structure of the problem. The problem setting involved management students who were rquired to determine an acceptance sampling plan using both methods. The PCM provided the most preferred solutions and was considered easier to use and understand. The prior articulation of preference method was found to give more insight into the problem structure. The results suggest that a hybrid approach, combining both prior preference assessment and an interactive procedure exploiting the advantages of each, should be employed to solve multiple criteria problems.  相似文献   
10.
Suppose X is a random variable having an absolutely continuous distribution function F(x). We assume that F(x) has the Wald distribution. A relation between the probability density function of X−1 with that of X is used to characterize the Wald distribution.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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