全文获取类型
收费全文 | 9259篇 |
免费 | 1160篇 |
国内免费 | 355篇 |
专业分类
化学 | 959篇 |
晶体学 | 14篇 |
力学 | 1034篇 |
综合类 | 325篇 |
数学 | 5570篇 |
物理学 | 2872篇 |
出版年
2024年 | 21篇 |
2023年 | 94篇 |
2022年 | 313篇 |
2021年 | 274篇 |
2020年 | 235篇 |
2019年 | 213篇 |
2018年 | 242篇 |
2017年 | 358篇 |
2016年 | 463篇 |
2015年 | 308篇 |
2014年 | 564篇 |
2013年 | 624篇 |
2012年 | 513篇 |
2011年 | 576篇 |
2010年 | 455篇 |
2009年 | 586篇 |
2008年 | 599篇 |
2007年 | 605篇 |
2006年 | 498篇 |
2005年 | 445篇 |
2004年 | 378篇 |
2003年 | 316篇 |
2002年 | 298篇 |
2001年 | 252篇 |
2000年 | 228篇 |
1999年 | 195篇 |
1998年 | 182篇 |
1997年 | 158篇 |
1996年 | 135篇 |
1995年 | 104篇 |
1994年 | 71篇 |
1993年 | 82篇 |
1992年 | 71篇 |
1991年 | 38篇 |
1990年 | 44篇 |
1989年 | 28篇 |
1988年 | 30篇 |
1987年 | 23篇 |
1986年 | 34篇 |
1985年 | 29篇 |
1984年 | 28篇 |
1983年 | 9篇 |
1982年 | 18篇 |
1981年 | 5篇 |
1980年 | 5篇 |
1979年 | 5篇 |
1978年 | 3篇 |
1977年 | 5篇 |
1959年 | 5篇 |
1957年 | 2篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
121.
122.
Huang H. X. Liang Z. A. Pardalos P. M. 《Journal of Optimization Theory and Applications》2004,120(1):53-71
A flow search approach is presented in this paper. In the approach, each iterative process involves a subproblem, whose variables are the stepsize parameters. Every feasible solution of the subproblem corresponds to some serial search stages, the stepsize parameters in different search stages may interact mutually, and their optimal values are determined by evaluating the total effect of the interaction. The main idea of the flow search approach is illustrated via the minimization of a convex quadratic function. Based on the flow search approach, some properties of the m-step linear conjugate gradient algorithm are analyzed and new bounds on its convergence rate are also presented. Theoretical and numerical results indicate that the new bounds are better than the well-known ones. 相似文献
123.
Hiroshi Sakamoto 《Journal of Discrete Algorithms》2005,3(2-4):416-430
A linear-time approximation algorithm for the grammar-based compression is presented. This is an optimization problem to minimize the size of a context-free grammar deriving a given string. For each string of length n, the algorithm guarantees approximation ratio without suffix tree construction. 相似文献
124.
本在Glover—Klingman算法及最小费用支撑树对策的基础上,讨论了最小费用k度限制树对策问题.利用威胁、旁支付理论制订了两种规则,并利用优超、策略等价理论分别给出了在这两种规则下最小费用k度限制树对策核心中的解,从而证明了在这两种规则下其核心非空. 相似文献
125.
126.
SINGLE MACHINE SCHEDULING WITH CONTROLLABLE PROCESSING TIMES AND COMPRESSION COSTS (PART I:EQUAL TIMES AND COSTS) 总被引:1,自引:0,他引:1
Most papers in scheduling research have treated individual job processing times as fixed parameters. However, in many practical situations, a manager may control processing time by realloeating resources. In this paper, authors consider a machine scheduling problemwith controllable processing times. In the first part of this paper, a special case where the pro-cessing times and compression costs are uniform among jobs is discussed. Theoretical results are derived that aid in developing an O(n^2) algorithm to slove the problem optimally. In the second part of this paper, authors generalize the discussion to general case, An effective heuristic to the genera/ problem will be presented. 相似文献
127.
Masakazu Muramatsu 《Mathematical Programming》1998,83(1-3):393-406
In this paper, we introduce an affine scaling algorithm for semidefinite programming (SDP), and give an example of a semidefinite
program such that the affine scaling algorithm converges to a non-optimal point. Both our program and its dual have interior
feasible solutions and unique optimal solutions which satisfy strict complementarity, and they are non-degenerate everywhere. 相似文献
128.
朱扬勇 《新疆大学学报(理工版)》1991,8(3):44-45
本文给出了关系数据库模式中求解关键字的一个算法。算法很简洁并且对于[1]定义的一大类问题,执行时间是多项式级的。 相似文献
129.
In this paper we face the problem of stowing a containership, referred to as the Master Bay Plan Problem (MBPP); this problem
is difficult to solve due to its combinatorial nature and the constraints related to both the ship and the containers. We
present a decomposition approach that allows us to assign a priori the bays of a containership to the set of containers to
be loaded according to their final destination, such that different portions of the ship are independently considered for
the stowage. Then, we find the optimal solution of each subset of bays by using a 0/1 Linear Programming model. Finally, we
check the global ship stability of the overall stowage plan and look for its feasibility by using an exchange algorithm which
is based on local search techniques. The validation of the proposed approach is performed with some real life test cases.
This work has been developed within the research area: “The harbour as a logistic node” of the Italian Centre of Excellence
on Integrated Logistics (CIELI) of the University of Genoa, Italy 相似文献
130.
朱方生 《武汉大学学报(理学版)》1995,(3)
构造了线性二次型最优控制的并行算法,介绍了这个并行算法在武汉大学“WUDP91”并行分布式处理系统上试算的数值应用软件的框图.本软件适用于既定动态系统的平衡问题.对于经济系统,可通过政策控制变量来调节和改善其状态和响应.对于自治系统可找出最优控制使得消耗函数达到最小值.通过对一系列例子进行试算,结果证实,所构造的并行算法和相应的数值软件是有效的,其加速比约为7. 相似文献