全文获取类型
收费全文 | 7855篇 |
免费 | 257篇 |
国内免费 | 160篇 |
专业分类
化学 | 440篇 |
晶体学 | 1篇 |
力学 | 229篇 |
综合类 | 92篇 |
数学 | 7207篇 |
物理学 | 303篇 |
出版年
2023年 | 38篇 |
2022年 | 81篇 |
2021年 | 90篇 |
2020年 | 95篇 |
2019年 | 103篇 |
2018年 | 108篇 |
2017年 | 138篇 |
2016年 | 132篇 |
2015年 | 109篇 |
2014年 | 318篇 |
2013年 | 380篇 |
2012年 | 422篇 |
2011年 | 314篇 |
2010年 | 327篇 |
2009年 | 469篇 |
2008年 | 486篇 |
2007年 | 524篇 |
2006年 | 345篇 |
2005年 | 321篇 |
2004年 | 241篇 |
2003年 | 239篇 |
2002年 | 246篇 |
2001年 | 218篇 |
2000年 | 230篇 |
1999年 | 183篇 |
1998年 | 167篇 |
1997年 | 149篇 |
1996年 | 183篇 |
1995年 | 169篇 |
1994年 | 124篇 |
1993年 | 131篇 |
1992年 | 134篇 |
1991年 | 119篇 |
1990年 | 97篇 |
1989年 | 72篇 |
1988年 | 91篇 |
1987年 | 59篇 |
1986年 | 88篇 |
1985年 | 113篇 |
1984年 | 77篇 |
1983年 | 25篇 |
1982年 | 50篇 |
1981年 | 39篇 |
1980年 | 38篇 |
1979年 | 29篇 |
1978年 | 49篇 |
1977年 | 46篇 |
1976年 | 27篇 |
1975年 | 12篇 |
1974年 | 12篇 |
排序方式: 共有8272条查询结果,搜索用时 15 毫秒
261.
为提高电商仓库的拣货作业效率,本文提出了基于聚类和动态规划的组合路径策略,实现了生成路径消耗时间和路径长度之间的平衡,并将这一策略成功地应用到多区型仓库。该策略分四步:首先,根据待拣储位分布特征,运用聚类分析法对其进行分类;然后,以各类的首末储位作为节点,运用动态规划法对已得分类进行排序,得到相应的类序;其次,得到各类内部路径;最后,依次拣取待拣商品,并返回出发点完成拣货作业。在提出新的路径策略后,通过仿真方法将新策略与三种传统路径策略(穿越策略、最大间隙策略和混合策略)和一种优质算法(蚁群算法)进行了对比分析,结果表明:该策略具备良好的适用性和实用性。 相似文献
262.
263.
Michael Braun 《组合设计杂志》2019,27(11):682-687
An ‐arc in is a set of points such that each line contains at most of the selected points. It is well known that ‐arcs in correspond to projective linear codes. Let denote the maximal number of points for which an ‐arc in exists. In this paper we obtain improved lower bounds on by explicitly constructing ‐arcs. Some of the constructed ‐arcs correspond to linear codes meeting the Griesmer bound. All results are obtained by integer linear programming. 相似文献
264.
《Operations Research Letters》2020,48(3):376-384
This paper studies risk in a stochastic auction which facilitates the integration of renewable generation in electricity markets. We model market participants who are risk averse and reflect their risk aversion through coherent risk measures. We uncover a closed form characterization of a risk-averse generator’s optimal pre-commitment behaviour for a given real-time policy, both with and without risk trading. 相似文献
265.
运用2015年全国研究生数学建模竞赛F题的数据资料,针对旅游路线合理规划问题的第一问展开研究.以F题的问题一为起点进行了分析研究,是因为第一问的完成是解决后续问题的关键.首先通过地图搜集并补全了缺失数据并对数据进行合理的处理,然后采用将旅游年数最少目标转化为该最小生成树的"最少圈覆盖"方法来进行对问题一的求解,也可以理解为一个广义的多旅行商问题,以旅行商的人数(即年数)最少为目标.采用Dijkstra算法、最少圈覆盖法、智能算法和图论聚类等方法,通过这些方法建立了单目标优化模型,并运用旅行商问题和模型之间的转换来对问题进行分析与求解. 相似文献
266.
Ilario Losito Fabio Mavelli Annamaria Demarinis Loiotile Francesco Palmisano 《Analytica chimica acta》2012
A simple software, to be used as an aid in the identification of non-tryptic peptides based on low resolution (3D-ion trap) tandem (MS/MS) and sequential (MS3) mass spectrometry data, is presented. 相似文献
267.
《Optimization》2012,61(3):413-427
The hypergraph minimum bisection (HMB) problem is the problem of partitioning the vertices of a hypergraph into two sets of equal size so that the total weight of hyperedges crossing the sets is minimized. HMB is an NP-hard problem that arises in numerous applications – for example, in digital circuit design. Although many heuristics have been proposed for HMB, there has been no known mathematical program that is equivalent to HMB. As a means of shedding light on HMB, we study the equivalent, complement problem of HMB (called CHMB), which attempts to maximize the total weight of non-crossing hyperedges. We formulate CHMB as a quadratically constrained quadratic program, considering its semidefinite programming relaxation and providing computational results on digital circuit partitioning benchmark problems. We also provide results towards an approximation guarantee for CHMB. 相似文献
268.
《Optimization》2012,61(3):405-412
In the paper exponential bounds for the instationary and stationary waiting time d.f.'s in GI/GI/1/∞, derived by several authors partly using martingale theory arguments, are improved with the help of monotonicity properties. Further it is shown that Ne?eptjrenko's bound for the rate of convergence of the mean waiting time in single server queues Is also valid for many server queues with ρ < 1. 相似文献
269.
Kaylea Haynes Idris A. Eckley Paul Fearnhead 《Journal of computational and graphical statistics》2017,26(1):134-143
In the multiple changepoint setting, various search methods have been proposed, which involve optimizing either a constrained or penalized cost function over possible numbers and locations of changepoints using dynamic programming. Recent work in the penalized optimization setting has focused on developing an exact pruning-based approach that, under certain conditions, is linear in the number of data points. Such an approach naturally requires the specification of a penalty to avoid under/over-fitting. Work has been undertaken to identify the appropriate penalty choice for data-generating processes with known distributional form, but in many applications the model assumed for the data is not correct and these penalty choices are not always appropriate. To this end, we present a method that enables us to find the solution path for all choices of penalty values across a continuous range. This permits an evaluation of the various segmentations to identify a suitable penalty choice. The computational complexity of this approach can be linear in the number of data points and linear in the difference between the number of changepoints in the optimal segmentations for the smallest and largest penalty values. Supplementary materials for this article are available online. 相似文献
270.
《Optimization》2012,61(2):323-338
Abstract New insights are presented from a convex duality classification theory of over 25 years ago for recent computational complexity results developed for recognizing some of the asymptotic duality states that prevail for an arbitrary convex programming pair. 相似文献