首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   3481篇
  国内免费   358篇
  完全免费   63篇
  数学   3902篇
  2019年   7篇
  2018年   58篇
  2017年   43篇
  2016年   48篇
  2015年   72篇
  2014年   108篇
  2013年   108篇
  2012年   116篇
  2011年   137篇
  2010年   122篇
  2009年   124篇
  2008年   166篇
  2007年   151篇
  2006年   138篇
  2005年   124篇
  2004年   120篇
  2003年   133篇
  2002年   125篇
  2001年   96篇
  2000年   80篇
  1999年   75篇
  1998年   99篇
  1997年   79篇
  1996年   98篇
  1995年   53篇
  1994年   51篇
  1993年   54篇
  1992年   56篇
  1991年   48篇
  1990年   64篇
  1989年   64篇
  1988年   44篇
  1987年   48篇
  1986年   57篇
  1985年   29篇
  1984年   49篇
  1983年   9篇
  1982年   42篇
  1981年   39篇
  1980年   68篇
  1979年   57篇
  1978年   55篇
  1977年   41篇
  1976年   52篇
  1975年   13篇
  1974年   14篇
  1973年   50篇
  1972年   52篇
  1971年   53篇
  1970年   66篇
  1969年   40篇
  1968年   44篇
  1967年   35篇
  1966年   19篇
  1965年   18篇
  1964年   15篇
  1963年   10篇
  1962年   14篇
  1961年   5篇
  1960年   5篇
  1959年   2篇
  1958年   5篇
  1957年   3篇
  1956年   2篇
  1955年   4篇
  1954年   2篇
  1953年   4篇
  1952年   3篇
  1951年   1篇
  1950年   2篇
  1949年   1篇
  1948年   1篇
  1941年   1篇
  1939年   1篇
  1938年   1篇
  1937年   2篇
  1936年   1篇
  1934年   2篇
  1933年   1篇
  1932年   1篇
  1931年   1篇
  1930年   1篇
排序方式: 共有3902条查询结果,搜索用时 46 毫秒
1.
Re-entrant lines   总被引:27,自引:0,他引:27  
P. R. Kumar 《Queueing Systems》1993,13(1-3):87-110
Traditionally, manufacturing systems have mainly been treated as either job shops or flow shops. In job shops, parts may arrive with random routes, with each route having a low volume. In flow shops, the routes are fixed and acyclic, as in assembly lines. With the advent of semiconductor manufacturing plants, and more recently, thin film lines, this dichotomy needs to be expanded to consider another class of systems, which we call re-entrant lines. The distinguishing feature of these manufacturing systems is that parts visit some machines more than once at different stages of processing.Scheduling problems arise because several parts at different stages of processing may be in contention with each other for service at the same machine. There may be uncertainties in the form of random service or set-up times, as well as random machine failures and repairs. The goal of scheduling is to improve performance measures such as mean sojourn time in the system, which is also known as the mean cycle-time, or the variance of the cycle-time.In this paper we provide a tutorial account of some recent results in this field. We describe several scheduling policies of interest, and provide some results concerning their stability and performance. Several open problems are suggested.The research reported here has been partially supported by the National Science Foundation under Grant No. ECS-90-25007, and the Joint Services Electronics Program under Contract No. N00014-84-C-0149.  相似文献
2.
Profit, Directional Distance Functions, and Nerlovian Efficiency   总被引:25,自引:0,他引:25  
The directional technology distance function is introduced, given an interpretation as a min-max, and compared with other functional representations of the technology including the Shephard input and output distance functions and the McFadden gauge function. A dual correspondence is developed between the directional technology distance function and the profit function, and it is shown that all previous dual correspondences are special cases of this correspondence. We then show how Nerlovian (profit-based) efficiency measures can be computed using the directional technology distance function.  相似文献
3.
Koszul Duality Patterns in Representation Theory   总被引:20,自引:0,他引:20  
The aim of this paper is to work out a concrete example as well as to provide the general pattern of applications of Koszul duality to representation theory. The paper consists of three parts relatively independent of each other. The first part gives a reasonably selfcontained introduction to Koszul rings and Koszul duality. Koszul rings are certain -graded rings with particularly nice homological properties which involve a kind of duality. Thus, to a Koszul ring one associates naturally the dual Koszul ring. The second part is devoted to an application to representation theory of semisimple Lie algebras. We show that the block of the Bernstein-Gelfand-Gelfand category that corresponds to any fixed central character is governed by the Koszul ring. Moreover, the dual of that ring governs a certain subcategory of the category again. This generalizes the selfduality theorem conjectured by Beilinson and Ginsburg in 1986 and proved by Soergel in 1990. In the third part we study certain categories of mixed perverse sheaves on a variety stratified by affine linear spaces. We provide a general criterion for such a category to be governed by a Koszul ring. In the flag variety case this reduces to the setup of part two. In the more general case of affine flag manifolds and affine Grassmannians the criterion should yield interesting results about representations of quantum groups and affine Lie algebras.

  相似文献

4.
Sensitivity analysis for variational inequalities   总被引:13,自引:0,他引:13  
Sensitivity analysis results for variational inequalities are presented which give conditions for existence and equations for calculating the derivatives of solution variables with respect to perturbation parameters. The perturbations are of both the variational inequality function and the feasible region. Results for the special case of nonlinear complementarity are also presented. A numerical example demonstrates the results for variational inequalities.The author is indebted to A. V. Fiacco for many valuable suggestions and comments. This work was supported in part by funding from the Economic Regulatory Administration, US Department of Energy, under Contract No. W31109ENG38.  相似文献
5.
Group-graded rings and modules   总被引:12,自引:0,他引:12  
6.
A note on spherical summation multipliers   总被引:12,自引:0,他引:12  
We give a new proof of a theorem of L. Carleson and P. Sj?lin onL p -boundedness of spherical summation operators in two variables.  相似文献
7.
A Survey of Optimization by Building and Using Probabilistic Models   总被引:12,自引:0,他引:12  
This paper summarizes the research on population-based probabilistic search algorithms based on modeling promising solutions by estimating their probability distribution and using the constructed model to guide the exploration of the search space. It settles the algorithms in the field of genetic and evolutionary computation where they have been originated, and classifies them into a few classes according to the complexity of models they use. Algorithms within each class are briefly described and their strengths and weaknesses are discussed.  相似文献
8.
9.
Solving large quadratic assignment problems on computational grids   总被引:10,自引:0,他引:10  
The quadratic assignment problem (QAP) is among the hardest combinatorial optimization problems. Some instances of size n = 30 have remained unsolved for decades. The solution of these problems requires both improvements in mathematical programming algorithms and the utilization of powerful computational platforms. In this article we describe a novel approach to solve QAPs using a state-of-the-art branch-and-bound algorithm running on a federation of geographically distributed resources known as a computational grid. Solution of QAPs of unprecedented complexity, including the nug30, kra30b, and tho30 instances, is reported. Received: September 29, 2000 / Accepted: June 5, 2001?Published online October 2, 2001  相似文献
10.
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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