全文获取类型
收费全文 | 5421篇 |
免费 | 478篇 |
国内免费 | 121篇 |
专业分类
化学 | 370篇 |
晶体学 | 2篇 |
力学 | 164篇 |
综合类 | 46篇 |
数学 | 2540篇 |
物理学 | 603篇 |
无线电 | 2295篇 |
出版年
2024年 | 21篇 |
2023年 | 87篇 |
2022年 | 132篇 |
2021年 | 151篇 |
2020年 | 150篇 |
2019年 | 110篇 |
2018年 | 112篇 |
2017年 | 141篇 |
2016年 | 203篇 |
2015年 | 154篇 |
2014年 | 267篇 |
2013年 | 308篇 |
2012年 | 290篇 |
2011年 | 300篇 |
2010年 | 257篇 |
2009年 | 324篇 |
2008年 | 380篇 |
2007年 | 410篇 |
2006年 | 318篇 |
2005年 | 244篇 |
2004年 | 210篇 |
2003年 | 189篇 |
2002年 | 170篇 |
2001年 | 138篇 |
2000年 | 125篇 |
1999年 | 107篇 |
1998年 | 104篇 |
1997年 | 78篇 |
1996年 | 79篇 |
1995年 | 50篇 |
1994年 | 59篇 |
1993年 | 49篇 |
1992年 | 39篇 |
1991年 | 31篇 |
1990年 | 22篇 |
1989年 | 18篇 |
1988年 | 28篇 |
1987年 | 17篇 |
1986年 | 23篇 |
1985年 | 23篇 |
1984年 | 26篇 |
1983年 | 8篇 |
1982年 | 16篇 |
1981年 | 10篇 |
1980年 | 9篇 |
1979年 | 8篇 |
1978年 | 8篇 |
1977年 | 7篇 |
1976年 | 6篇 |
1975年 | 2篇 |
排序方式: 共有6020条查询结果,搜索用时 0 毫秒
221.
222.
基于遗传算法的项目经理评价 总被引:1,自引:0,他引:1
本文根据自然进化规则,把项目经理视为评价系统,项目经理所要满足的要求视为系统环境,用遗传算法的方法评价项目经理,力求提出一种比较客观科学的、且可以定量分析的项目经理的评价方法。 相似文献
223.
本针对系统为受控AR模型,其参数估计采用随机梯度算法时,用鞅收敛定理的推广形式分析了它的收敛性,得到了参数估计误差一致有界的结果. 相似文献
224.
Gabriela Jeronimo Guillermo Matera Pablo Solernó Ariel Waissbein 《Foundations of Computational Mathematics》2009,9(1):1-50
We exhibit a probabilistic symbolic algorithm for solving zero-dimensional sparse systems. Our algorithm combines a symbolic
homotopy procedure, based on a flat deformation of a certain morphism of affine varieties, with the polyhedral deformation
of Huber and Sturmfels. The complexity of our algorithm is cubic in the size of the combinatorial structure of the input system.
This size is mainly represented by the cardinality and mixed volume of Newton polytopes of the input polynomials and an arithmetic
analogue of the mixed volume associated to the deformations under consideration.
Research was partially supported by the following grants: UBACyT X112 (2004–2007), UBACyT X847 (2006–2009), PIP CONICET 2461,
PIP CONICET 5852/05, ANPCyT PICT 2005 17-33018, UNGS 30/3005, MTM2004-01167 (2004–2007), MTM2007-62799 and CIC 2007–2008. 相似文献
225.
Ricardo J. G. B. Campello Eduardo R. Hruschka Vinícius S. Alves 《Journal of Heuristics》2009,15(1):43-75
This paper tackles the problem of showing that evolutionary algorithms for fuzzy clustering can be more efficient than systematic
(i.e. repetitive) approaches when the number of clusters in a data set is unknown. To do so, a fuzzy version of an Evolutionary
Algorithm for Clustering (EAC) is introduced. A fuzzy cluster validity criterion and a fuzzy local search algorithm are used
instead of their hard counterparts employed by EAC. Theoretical complexity analyses for both the systematic and evolutionary
algorithms under interest are provided. Examples with computational experiments and statistical analyses are also presented. 相似文献
226.
This paper introduces an Ishikawa type iterative algorithm for finding approximating solutions of a class of multi-valued
variational inclusion problems. Characterization of strong convergence of this iterative method is established.
L. C. Ceng’s research partially supported by the Teaching and Research Award Fund for Outstanding Young Teachers in Higher
Education Institutions of MOE, China and the Dawn Program Foundation in Shanghai.
S. Schaible’s research partially supported by the National Science Council of Taiwan.
This research was partially supported by the grant NSC 96-2628-E-110-014-MY3. 相似文献
227.
Enterprises often implement a measurement system to monitor their march towards their strategic goals. Although this way it
is possible to assess the progress of each goal, there is no structured way to reconsider resource allocation to those goals
and to plan an optimal (or near optimal) allocation scheme. In this study we propose a genetic approach to match each goal
with an autonomous entity (agent) with a specific resource sharing behavior. The overall performance is evaluated through
a set of functions and genetic algorithms are used to eventuate in approximate optimal behavior’s schemes. To outline the
strategic goals of the enterprise we used the balanced scorecard method. Letting agents deploy their sharing behavior over
simulation time, we measure the scorecard’s performance and detect distinguished behaviors, namely recommendations for resource
allocation. 相似文献
228.
Three fast and stable divide and conquer algorithms to compute the eigendecomposition of symmetric diagonal-plus-semiseparable matrices are considered.
AMS subject classification 15A18, 15A23, 65F15The research of the second and the third author was supported by the Research Council K.U. Leuven, to13.25cmproject OT/00/16 (SLAP: Structured Linear Algebra Package), by the Fund for Scientific Research – 相似文献
229.
K.B. Nichols M.A. Venkataramanan K.W. Ernstberger 《Mathematical and Computer Modelling》2005,42(13):1397-1410
A model for the product line selection and pricing problem (PLSP) is presented andthree solution procedures based on a genetic algorithm are developed to analyze the results based on consumer preference patterns. Since the PLSP model is nonlinear and integer, two of the solution procedures use genetic encoding to “relax” the NP hard model. The relaxations result in linear integer and shortest path models for the fitness evaluation which are solved using branch and bound and labeling algorithms, respectively. Performance of the quality of solutions generated by the procedures is evaluated for various problem sizes and customer preference structures. The results show that the genetic relaxations provide efficient and effective solution methodologies for the problem, when compared to the pure artificial intelligence technique of genetic search. The impact of the preference structure on the product line and the managerial implications of the solution characteristics generated by the genetic relaxations are also discussed. The models can be used to explicitly consider tradeoffs between marketing and operations concerns in designing a product line. 相似文献
230.
Let S be a non-empty subset of positive integers. A partition of a positive integer n into S is a finite nondecreasing sequence of positive integers a
1, a
2,...,a
r
in S with repetitions allowed such that
. Here we apply Polya's enumeration theorem to find the number P(n; S) of partitions of n into S, and the number DP(n; S) of distinct partitions of n into S. We also present recursive formulas for computing P(n; S) and DP(n; S). 相似文献