全文获取类型
收费全文 | 3003篇 |
免费 | 302篇 |
国内免费 | 115篇 |
专业分类
化学 | 174篇 |
力学 | 38篇 |
综合类 | 80篇 |
数学 | 2799篇 |
物理学 | 329篇 |
出版年
2024年 | 3篇 |
2023年 | 20篇 |
2022年 | 108篇 |
2021年 | 107篇 |
2020年 | 83篇 |
2019年 | 90篇 |
2018年 | 78篇 |
2017年 | 90篇 |
2016年 | 100篇 |
2015年 | 78篇 |
2014年 | 179篇 |
2013年 | 208篇 |
2012年 | 142篇 |
2011年 | 144篇 |
2010年 | 158篇 |
2009年 | 195篇 |
2008年 | 180篇 |
2007年 | 217篇 |
2006年 | 160篇 |
2005年 | 104篇 |
2004年 | 110篇 |
2003年 | 104篇 |
2002年 | 90篇 |
2001年 | 91篇 |
2000年 | 65篇 |
1999年 | 57篇 |
1998年 | 56篇 |
1997年 | 34篇 |
1996年 | 54篇 |
1995年 | 36篇 |
1994年 | 38篇 |
1993年 | 13篇 |
1992年 | 17篇 |
1991年 | 23篇 |
1990年 | 12篇 |
1989年 | 13篇 |
1988年 | 17篇 |
1987年 | 9篇 |
1986年 | 15篇 |
1985年 | 27篇 |
1984年 | 23篇 |
1983年 | 6篇 |
1982年 | 19篇 |
1981年 | 9篇 |
1980年 | 12篇 |
1979年 | 5篇 |
1978年 | 5篇 |
1977年 | 7篇 |
1976年 | 3篇 |
1957年 | 1篇 |
排序方式: 共有3420条查询结果,搜索用时 46 毫秒
41.
求解最小Steiner树的蚁群优化算法及其收敛性 总被引:11,自引:0,他引:11
最小Steiner树问题是NP难问题,它在通信网络等许多实际问题中有着广泛的应用.蚁群优化算法是最近提出的求解复杂组合优化问题的启发式算法.本文以无线传感器网络中的核心问题之一,路由问题为例,给出了求解最小Steiner树的蚁群优化算法的框架.把算法的迭代过程看作是离散时间的马尔科夫过程,证明了在一定的条件下,该算法所产生的解能以任意接近于1的概率收敛到路由问题的最优解. 相似文献
42.
Andreas Rößler 《BIT Numerical Mathematics》2006,46(1):97-110
A general class of stochastic Runge–Kutta methods for Itô stochastic differential equation systems w.r.t. a one-dimensional Wiener process is introduced. The colored rooted tree analysis is applied to derive conditions for the coefficients of the stochastic Runge–Kutta method assuring convergence in the weak sense with a prescribed order. Some coefficients for new stochastic Runge–Kutta schemes of order two are calculated explicitly and a simulation study reveals their good performance. 相似文献
43.
Andreas Rößler 《BIT Numerical Mathematics》2007,47(3):657-680
The weak approximation of the solution of a system of Stratonovich stochastic differential equations with a m–dimensional Wiener process is studied. Therefore, a new class of stochastic Runge–Kutta methods is introduced. As the main
novelty, the number of stages does not depend on the dimension m of the driving Wiener process which reduces the computational effort significantly. The colored rooted tree analysis due
to the author is applied to determine order conditions for the new stochastic Runge–Kutta methods assuring convergence with
order two in the weak sense. Further, some coefficients for second order stochastic Runge–Kutta schemes are calculated explicitly.
AMS subject classification (2000) 65C30, 65L06, 60H35, 60H10 相似文献
44.
Optimal production and rationing decisions in supply chains with information sharing 总被引:1,自引:0,他引:1
Boray Huang 《Operations Research Letters》2007,35(5):669-676
This paper considers a two-echelon capacitated supply chain with two non-identical retailers and information sharing. We characterize the optimal inventory policies. We also study the benefits of the optimal stock rationing policy over the first come first served (FCFS) and the modified echelon-stock rationing (MESR) policies. 相似文献
45.
We construct random locally compact real trees called Lévy trees that are the genealogical trees associated with continuous-state
branching processes. More precisely, we define a growing family of discrete Galton–Watson trees with i.i.d. exponential branch
lengths that is consistent under Bernoulli percolation on leaves; we define the Lévy tree as the limit of this growing family
with respect to the Gromov–Hausdorff topology on metric spaces. This elementary approach notably includes supercritical trees
and does not make use of the height process introduced by Le Gall and Le Jan to code the genealogy of (sub)critical continuous-state
branching processes. We construct the mass measure of Lévy trees and we give a decomposition along the ancestral subtree of
a Poisson sampling directed by the mass measure.
T. Duquesne is supported by NSF Grants DMS-0203066 and DMS-0405779. M. Winkel is supported by Aon and the Institute of Actuaries,
EPSRC Grant GR/T26368/01, le département de mathématique de l’Université d’Orsay and NSF Grant DMS-0405779. 相似文献
46.
47.
对股份制公司的综合投资方案的决策问题进行了研究.首先依据多个投资方案的风险与收益并存的实际情况,建立了最佳投资组合方案的多目标决策模型.然后,由董事会综合各股东所持股份和相互评价权值,利用群决策的方法得到一个最终投资方案,此方案在理论上能使公司获得最大收益. 相似文献
48.
On the Evaluation of Uncertain Courses of Action 总被引:3,自引:0,他引:3
Ronald R. Yager 《Fuzzy Optimization and Decision Making》2002,1(1):13-41
We consider the problem of decision making under uncertainty. The fuzzy measure is introduced as a general way of representing available information about the uncertainty. It is noted that generally in uncertain environments the problem of comparing alternative courses of action is difficult because of the multiplicity of possible outcomes for any action. One approach is to convert this multiplicity of possible of outcomes associated with an alternative into a single value using a valuation function. We describe various ways of providing a valuation function when the uncertainty is represented using a fuzzy measure. We then specialize these valuation functions to the cases of probabilistic and possibilistic uncertainty. 相似文献
49.
The Randi? index R(G) of a (chemical) graph G is also called connectivity index. Hansen and Mélot [Variable neighborhood search for extremal graphs 6: analyzing bounds for the connectivity index, J. Chem. Inf. Comput. Sci. 43 (2003) 1-14] in their paper, characterized the chemical trees of given order and number of pendent vertices which have the minimum and maximum Randi? index, respectively. In this note, we point out the mistakes in the proofs of their results Theorems 8 and 10, while we still believe that the two theorems are true, and then we give their corrected proofs. 相似文献
50.