全文获取类型
收费全文 | 14986篇 |
免费 | 1266篇 |
国内免费 | 705篇 |
专业分类
化学 | 3128篇 |
晶体学 | 49篇 |
力学 | 1361篇 |
综合类 | 237篇 |
数学 | 9391篇 |
物理学 | 2791篇 |
出版年
2024年 | 22篇 |
2023年 | 156篇 |
2022年 | 317篇 |
2021年 | 475篇 |
2020年 | 332篇 |
2019年 | 372篇 |
2018年 | 405篇 |
2017年 | 496篇 |
2016年 | 509篇 |
2015年 | 362篇 |
2014年 | 738篇 |
2013年 | 1042篇 |
2012年 | 836篇 |
2011年 | 799篇 |
2010年 | 686篇 |
2009年 | 870篇 |
2008年 | 900篇 |
2007年 | 973篇 |
2006年 | 806篇 |
2005年 | 732篇 |
2004年 | 569篇 |
2003年 | 554篇 |
2002年 | 483篇 |
2001年 | 412篇 |
2000年 | 402篇 |
1999年 | 318篇 |
1998年 | 350篇 |
1997年 | 280篇 |
1996年 | 221篇 |
1995年 | 216篇 |
1994年 | 182篇 |
1993年 | 151篇 |
1992年 | 130篇 |
1991年 | 109篇 |
1990年 | 91篇 |
1989年 | 91篇 |
1988年 | 71篇 |
1987年 | 56篇 |
1986年 | 51篇 |
1985年 | 78篇 |
1984年 | 58篇 |
1983年 | 20篇 |
1982年 | 36篇 |
1981年 | 28篇 |
1980年 | 30篇 |
1979年 | 36篇 |
1978年 | 23篇 |
1977年 | 34篇 |
1976年 | 22篇 |
1957年 | 6篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
141.
求解最小Steiner树的蚁群优化算法及其收敛性 总被引:11,自引:0,他引:11
最小Steiner树问题是NP难问题,它在通信网络等许多实际问题中有着广泛的应用.蚁群优化算法是最近提出的求解复杂组合优化问题的启发式算法.本文以无线传感器网络中的核心问题之一,路由问题为例,给出了求解最小Steiner树的蚁群优化算法的框架.把算法的迭代过程看作是离散时间的马尔科夫过程,证明了在一定的条件下,该算法所产生的解能以任意接近于1的概率收敛到路由问题的最优解. 相似文献
142.
在局部凸空间中考虑集值优化问题(VP)在强有效解意义下的Kuhn-Tucker最优性条件.在近似锥.次类凸假设下利用择一性定理得到了(VP)取得强有效解的必要条件,利用基泛函的性质给出了(VP)取得强有效解的充分条件,最后给出了一种与(VP)等价的无约束规划。 相似文献
143.
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. 相似文献
144.
本文研究了由目标函数扰动的集值优化问题的有效点集所定义的集值映射的半连续性.讨论了目标函数扰动的集值优化问题在上半连续意义下的稳定性.特别地,在广义适定性条件下,证明了集值优化问题在上半连续意义下的稳定性. 相似文献
145.
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. 相似文献
146.
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. 相似文献
147.
The paper addresses bivariate surface fitting problems, where data points lie on the vertices of a rectangular grid. Efficient
and stable algorithms can be found in the literature to solve such problems. If data values are missing at some grid points,
there exists a computational method for finding a least squares spline by fixing appropriate values for the missing data.
We extended this technique to arbitrary least squares problems as well as to linear least squares problems with linear equality
constraints. Numerical examples are given to show the effectiveness of the technique presented.
AMS subject classification (2000) 65D05, 65D07, 65D10, 65F05, 65F20 相似文献
148.
在研究排队网络的文献中,G-网络(即推广的排队网络)最近受到了国际学者广泛的关注,它的研究在一定程度上丰富了排队网络的内容.正因为有很多学者投入到此项研究中,新的结果是层出不穷的.本文简短地介绍G-网络近年来的发展. 相似文献
149.
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. 相似文献
150.