全文获取类型
收费全文 | 13647篇 |
免费 | 1689篇 |
国内免费 | 394篇 |
专业分类
化学 | 1477篇 |
晶体学 | 30篇 |
力学 | 1646篇 |
综合类 | 191篇 |
数学 | 8972篇 |
物理学 | 3414篇 |
出版年
2024年 | 20篇 |
2023年 | 126篇 |
2022年 | 309篇 |
2021年 | 413篇 |
2020年 | 263篇 |
2019年 | 263篇 |
2018年 | 284篇 |
2017年 | 390篇 |
2016年 | 396篇 |
2015年 | 297篇 |
2014年 | 602篇 |
2013年 | 770篇 |
2012年 | 817篇 |
2011年 | 683篇 |
2010年 | 685篇 |
2009年 | 832篇 |
2008年 | 892篇 |
2007年 | 952篇 |
2006年 | 804篇 |
2005年 | 680篇 |
2004年 | 512篇 |
2003年 | 528篇 |
2002年 | 479篇 |
2001年 | 454篇 |
2000年 | 403篇 |
1999年 | 322篇 |
1998年 | 345篇 |
1997年 | 309篇 |
1996年 | 221篇 |
1995年 | 232篇 |
1994年 | 196篇 |
1993年 | 172篇 |
1992年 | 156篇 |
1991年 | 127篇 |
1990年 | 106篇 |
1989年 | 85篇 |
1988年 | 74篇 |
1987年 | 63篇 |
1986年 | 62篇 |
1985年 | 78篇 |
1984年 | 64篇 |
1983年 | 22篇 |
1982年 | 36篇 |
1981年 | 32篇 |
1980年 | 26篇 |
1979年 | 37篇 |
1978年 | 28篇 |
1977年 | 34篇 |
1976年 | 22篇 |
1957年 | 6篇 |
排序方式: 共有10000条查询结果,搜索用时 31 毫秒
151.
求解最小Steiner树的蚁群优化算法及其收敛性 总被引:11,自引:0,他引:11
最小Steiner树问题是NP难问题,它在通信网络等许多实际问题中有着广泛的应用.蚁群优化算法是最近提出的求解复杂组合优化问题的启发式算法.本文以无线传感器网络中的核心问题之一,路由问题为例,给出了求解最小Steiner树的蚁群优化算法的框架.把算法的迭代过程看作是离散时间的马尔科夫过程,证明了在一定的条件下,该算法所产生的解能以任意接近于1的概率收敛到路由问题的最优解. 相似文献
152.
在局部凸空间中考虑集值优化问题(VP)在强有效解意义下的Kuhn-Tucker最优性条件.在近似锥.次类凸假设下利用择一性定理得到了(VP)取得强有效解的必要条件,利用基泛函的性质给出了(VP)取得强有效解的充分条件,最后给出了一种与(VP)等价的无约束规划。 相似文献
153.
We consider a trader who wants to direct his or her portfolio towards a set of acceptable wealths given by a convex risk measure. We propose a Monte Carlo algorithm, whose inputs are the joint law of stock prices and the convex risk measure, and whose outputs are the numerical values of initial capital requirement and the functional form of a trading strategy for achieving acceptability. We also prove optimality of the capital obtained. Explicit theoretical evaluations of hedging strategies are extremely difficult, and we avoid the problem by resorting to such computational methods. The main idea is to utilize the finite Vapnik–C?ervonenkis dimension of a class of possible strategies. 相似文献
154.
本文研究了由目标函数扰动的集值优化问题的有效点集所定义的集值映射的半连续性.讨论了目标函数扰动的集值优化问题在上半连续意义下的稳定性.特别地,在广义适定性条件下,证明了集值优化问题在上半连续意义下的稳定性. 相似文献
155.
We study a variation of the knapsack problem in which each item has a profit, a weight and a penalty; the sum of profits of the selected items minus the largest penalty associated with the selected items must be maximized. We present an ILP formulation and an exact optimization algorithm. 相似文献
156.
We consider a multiperiod mean-variance model where the model parameters change according to a stochastic market. The mean
vector and covariance matrix of the random returns of risky assets all depend on the state of the market during any period
where the market process is assumed to follow a Markov chain. Dynamic programming is used to solve an auxiliary problem which,
in turn, gives the efficient frontier of the mean-variance formulation. An explicit expression is obtained for the efficient
frontier and an illustrative example is given to demonstrate the application of the procedure. 相似文献
157.
Stadia are popular models of chaotic billiards introduced by Bunimovich in 1974. They are analogous to dispersing billiards
due to Sinai, but their fundamental technical characteristics are quite different. Recently many new results were obtained
for various chaotic billiards, including sharp bounds on correlations and probabilistic limit theorems, and these results
require new, more powerful technical apparatus. We present that apparatus here, in the context of stadia, and prove “regularity”
properties.
相似文献
158.
Supply Chain Management (SCM) is an important activity in all producing facilities and in many organizations to enable vendors,
manufacturers and suppliers to interact gainfully and plan optimally their flow of goods and services. To realize this, a
dynamic modelling approach for characterizing supply chain activities is opportune, so as to plan efficiently the set of activities
over a distributed network in a formal and scientific way. The dynamical system will result so complex that it is not generally
possible to specify the functional forms and the parameters of interest, relating outputs to inputs, states and stochastic
terms by experiential specification methods. Thus the algorithm that will presented is Data Driven, determining simultaneously
the functional forms, the parameters and the optimal control policy from the data available for the supply chain. The aim
of this paper is to present this methodology, by considering dynamical aspects of the system, the presence of nonlinear relationships
and unbiased estimation procedures to quantify these relations, leading to a nonlinear and stochastic dynamical system representation
of the SCM problem. Moreover, the convergence of the algorithm will be proved and the satisfaction of the required statistical
conditions demonstrated. Thus SCM problems may be formulated as formal scientific procedures, with well defined algorithms
and a precise calculation sequence to determine the best alternative to enact. A “Certainty equivalent principle” will be
indicated to ensure that the effects of the inevitable uncertainties will not lead to indeterminate results, allowing the
formulation of demonstrably asymptotically optimal management plans. 相似文献
159.
We study the approximability of minimum total weighted tardiness with a modified objective which includes an additive constant. This ensures the existence of a positive lower bound for the minimum value. Moreover the new objective has a natural interpretation in just-in-time production systems. 相似文献
160.
刘国志 《数学的实践与认识》2006,36(12):1-5
提出一个新的具有积压定单的关于模糊订购量的模糊存储模型.在模糊函数原理下,给出了模糊总存储成本.为了寻找最优解,把最优模糊存储模型转化为双目标最优化模型,利用L ingo8.0求解不等式约束问题,我们发现最优解都是确定的实数.此外,当模糊订购量和模糊总需求都是三角形(或权重均为1/2梯形)模糊数时,我们提出模型的最优解与经典的具有积压定单存储模型具有相同的结果. 相似文献