全文获取类型
收费全文 | 6540篇 |
免费 | 545篇 |
国内免费 | 496篇 |
专业分类
化学 | 285篇 |
晶体学 | 1篇 |
力学 | 267篇 |
综合类 | 180篇 |
数学 | 6327篇 |
物理学 | 521篇 |
出版年
2024年 | 6篇 |
2023年 | 40篇 |
2022年 | 90篇 |
2021年 | 136篇 |
2020年 | 104篇 |
2019年 | 122篇 |
2018年 | 114篇 |
2017年 | 198篇 |
2016年 | 245篇 |
2015年 | 160篇 |
2014年 | 339篇 |
2013年 | 379篇 |
2012年 | 318篇 |
2011年 | 292篇 |
2010年 | 271篇 |
2009年 | 396篇 |
2008年 | 411篇 |
2007年 | 405篇 |
2006年 | 384篇 |
2005年 | 362篇 |
2004年 | 291篇 |
2003年 | 296篇 |
2002年 | 266篇 |
2001年 | 227篇 |
2000年 | 246篇 |
1999年 | 189篇 |
1998年 | 212篇 |
1997年 | 178篇 |
1996年 | 126篇 |
1995年 | 91篇 |
1994年 | 79篇 |
1993年 | 71篇 |
1992年 | 68篇 |
1991年 | 48篇 |
1990年 | 43篇 |
1989年 | 35篇 |
1988年 | 37篇 |
1987年 | 16篇 |
1986年 | 15篇 |
1985年 | 54篇 |
1984年 | 37篇 |
1983年 | 16篇 |
1982年 | 29篇 |
1981年 | 31篇 |
1980年 | 30篇 |
1979年 | 23篇 |
1978年 | 19篇 |
1977年 | 13篇 |
1976年 | 7篇 |
1974年 | 6篇 |
排序方式: 共有7581条查询结果,搜索用时 31 毫秒
61.
本文针对单件小批量生产系统 ,建立了模糊优化的动态随机投入产出模型 ,同时给出了该模型的递推解法 ,并用此模型对某单件小批企业在生产计划期的商品量进行了规划 相似文献
62.
New constructions of regular disjoint distinct difference sets (DDDS) are presented. In particular, multiplicative and additive DDDS are considered. 相似文献
63.
THENBELCANDNWELCCLASSESOFLIFEDISTRIBUTIONS¥CAOJINHUA;WANGYUEDONG(InstituteofAppliedMathematics,ChineseAcademyofScience,Beijin... 相似文献
64.
Gisella Facchinetti 《Fuzzy Optimization and Decision Making》2002,1(3):313-327
In this paper we present two definitions of possibilistic weighted average of fuzzy numbers, and by them we introduce two different rankings on the set of real fuzzy numbers. The two methods are dependent on several parameters. In the first case, the parameter is constant and the results generalize what Carlsson and Fuller have obtained in (2001). In the second case, the parameter is a function, not fixed a priori by the decision maker, but it depends on the position of the interval on the real axe. In all the two cases we call the parameter degree of risk, which takes into account of a risk-tendency or aversion of the decision maker. 相似文献
65.
We study game formulas the truth of which is determined by a semantical game of uncountable length. The main theme is the study of principles stating reflection of these formulas in various admissible sets. This investigation leads to two weak forms of strict-II11 reflection (or ∑1-compactness). We show that admissible sets such as H(ω2) and Lω2 which fail to have strict-II11 reflection, may or may not, depending on set-theoretic hypotheses satisfy one or both of these weaker forms. Mathematics Subject Classification : 03C70, 03C75. 相似文献
66.
A BRANCH BOUND METHOD FOR SUBSET SUM PROBLEM 总被引:1,自引:0,他引:1
吴士泉 《应用数学学报(英文版)》1994,10(3):302-314
ABRANCHBOUNDMETHODFORSUBSETSUMPROBLEMWUSHIQUAN(吴士泉)(InstituteofAppliedMathematics,theChineseAcademyofSciences,Beijing100080,C... 相似文献
67.
Optimization theory provides a framework for determining the best decisions or actions with respect to some mathematical model of a process. This paper focuses on learning to act in a near-optimal manner through reinforcement learning for problems that either have no model or the model is too complex. One approach to solving this class of problems is via approximate dynamic programming. The application of these methods are established primarily for the case of discrete state and action spaces. In this paper we develop efficient methods of learning which act in complex systems with continuous state and action spaces. Monte-Carlo approaches are employed to estimate function values in an iterative, incremental procedure. Derivative-free line search methods are used to obtain a near-optimal action in the continuous action space for a discrete subset of the state space. This near-optimal control policy is then extended to the entire continuous state space via a fuzzy additive model. To compensate for approximation errors, a modified procedure for perturbing the generated control policy is developed. Convergence results under moderate assumptions and stopping criteria are established. 相似文献
68.
Satoru Ibaraki Masao Fukushima Toshihide Ibaraki 《Computational Optimization and Applications》1992,1(2):207-226
A primal-dual version of the proximal point algorithm is developed for linearly constrained convex programming problems. The algorithm is an iterative method to find a saddle point of the Lagrangian of the problem. At each iteration of the algorithm, we compute an approximate saddle point of the Lagrangian function augmented by quadratic proximal terms of both primal and dual variables. Specifically, we first minimize the function with respect to the primal variables and then approximately maximize the resulting function of the dual variables. The merit of this approach exists in the fact that the latter function is differentiable and the maximization of this function is subject to no constraints. We discuss convergence properties of the algorithm and report some numerical results for network flow problems with separable quadratic costs. 相似文献
69.
本文证明了:(1)Exchange环R的K0群的正向凸子群格同构于R的稳定余有限半本原理想格;(2)稳定有限、半本原的exchange环R是单的当且仅当它是K0-单的并且满足逼近弱s^*—可比性,推广了Goodearl,Ara等人的结果。 相似文献
70.