首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   9606篇
  免费   1179篇
  国内免费   383篇
化学   755篇
晶体学   13篇
力学   1148篇
综合类   336篇
数学   6165篇
物理学   2751篇
  2024年   21篇
  2023年   90篇
  2022年   235篇
  2021年   276篇
  2020年   203篇
  2019年   211篇
  2018年   234篇
  2017年   355篇
  2016年   462篇
  2015年   303篇
  2014年   570篇
  2013年   632篇
  2012年   533篇
  2011年   577篇
  2010年   465篇
  2009年   619篇
  2008年   646篇
  2007年   654篇
  2006年   519篇
  2005年   477篇
  2004年   410篇
  2003年   343篇
  2002年   317篇
  2001年   270篇
  2000年   248篇
  1999年   215篇
  1998年   196篇
  1997年   179篇
  1996年   149篇
  1995年   110篇
  1994年   87篇
  1993年   93篇
  1992年   77篇
  1991年   46篇
  1990年   51篇
  1989年   31篇
  1988年   33篇
  1987年   27篇
  1986年   30篇
  1985年   41篇
  1984年   29篇
  1983年   11篇
  1982年   21篇
  1981年   11篇
  1980年   9篇
  1979年   11篇
  1978年   11篇
  1977年   10篇
  1976年   5篇
  1959年   5篇
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
151.
A decomposition heuristics for the container ship stowage problem   总被引:3,自引:0,他引:3  
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  相似文献   
152.
构造了线性二次型最优控制的并行算法,介绍了这个并行算法在武汉大学“WUDP91”并行分布式处理系统上试算的数值应用软件的框图.本软件适用于既定动态系统的平衡问题.对于经济系统,可通过政策控制变量来调节和改善其状态和响应.对于自治系统可找出最优控制使得消耗函数达到最小值.通过对一系列例子进行试算,结果证实,所构造的并行算法和相应的数值软件是有效的,其加速比约为7.  相似文献   
153.
基于遗传禁忌算法的双资源约束下并行生产线调度研究   总被引:2,自引:0,他引:2  
并行生产线调度问题兼有并行机器和流程车间调度问题的特点,是一类新型的调度问题。在考虑遗传算法早熟收敛特性和禁忌搜索法自适应优点的基础上,将遗传算法和禁忌搜索法结合起来,提出了基于遗传算法和禁忌搜索算法的双资源并行作业车间的调度优化问题算法,即考虑到了产品的调度受到机器、工人等资源制约的影响,对算法中种群的构造,适应度计算,遗传操作等方面进行了研究,最后给出了实例仿真和结论。  相似文献   
154.
涂俐兰 《数学杂志》2006,26(1):67-70
本文研究DNA的两两序列比时,提出了基于快速沃尔什变换的新方法。经过计算模拟分析可知,比对的时间复杂度和空间复杂度明显降低.  相似文献   
155.
本文对某些非线性方程组F(x)=0,导出了一个算法,用它可以迭代建立F(x)=0的解的紧致上、下界。算法基于某些矩阵的多分裂,因此具有自然的并行性。我们证明了趋向于解的界之收敛原则,给出了参数的收敛性区域并考察了方法的收敛速度。  相似文献   
156.
This paper describes a method for an objective selection of the optimal prior distribution, or for adjusting its hyper-parameter, among the competing priors for a variety of Bayesian models. In order to implement this method, the integration of very high dimensional functions is required to get the normalizing constants of the posterior and even of the prior distribution. The logarithm of the high dimensional integral is reduced to the one-dimensional integration of a cerain function with respect to the scalar parameter over the range of the unit interval. Having decided the prior, the Bayes estimate or the posterior mean is used mainly here in addition to the posterior mode. All of these are based on the simulation of Gibbs distributions such as Metropolis' Monte Carlo algorithm. The improvement of the integration's accuracy is substantial in comparison with the conventional crude Monte Carlo integration. In the present method, we have essentially no practical restrictions in modeling the prior and the likelihood. Illustrative artificial data of the lattice system are given to show the practicability of the present procedure.  相似文献   
157.
In this paper, we adapt the octahedral simplicial algorithm for solving systems of nonlinear equations to solve the linear complementarity problem with upper and lower bounds. The proposed algorithm generates a piecewise linear path from an arbitrarily chosen pointz 0 to a solution point. This path is followed by linear programming pivot steps in a system ofn linear equations, wheren is the size of the problem. The starting pointz 0 is left in the direction of one of the 2 n vertices of the feasible region. The ray along whichz 0 is left depends on the sign pattern of the function value atz 0. The sign pattern of the linear function and the location of the points in comparison withz 0 completely govern the path of the algorithm.This research is part of the VF-Program Equilibrium and Disequilibrium in Demand and Supply, approved by the Netherlands Ministry of Education, Den Haag, The Netherlands.  相似文献   
158.
A recursive method is developed for the solution of coupled algebraic Riccati equations and corresponding linear Nash strategies of weakly interconnected systems. It is shown that the given algorithm converges to the exact solution with the rate of convergence ofO(2), where is a small coupling parameter. In addition, only low-order systems are involved in algebrdic computations; the amount of computations required does not grow per iteration and no analyticity assumption is imposed on the system coefficients.This work was supported by Rutgers University Research Council under Grant No. 2-02188.  相似文献   
159.
We will consider a concave minimization problem associated with a series production system in which raw material is processed inm consecutive facilities. The products at some facility are either sent to the next facility or stocked in the warehouse. The amount of demand for the final products during periodi, i = 1,,n, are known in advance. Our problem is to minimize the sum of processing, holding and backlogging cost, all of which are assumed to be concave.The origin of this model is the classical economic lot size problem of Wagner and Whitin and was extensively studied by Zangwill. This model is very important from the theoretical as well as practical point of view and this is one of the very rare instances in which polynomial time algorithm has been constructed for concave minimization problems.The purpose of this paper is to extend the model further to the situation in which time lag is associated with processing at each facility. We will propose an efficient O(n 4 m) algorithm for this class of problems.  相似文献   
160.
Bounded terminal conditions of nonlinear optimization problems are converted to equality terminal conditions via the Valentine's device. In so doing, additional unknown parameters are introduced into the problem. The transformed problems can still be easily solved using the sequential gradient-restoration algorithm (SGRA) via a simple augmentation of the unknown parameter vector . Three example problems with bounded terminal conditions are solved to verify this technique.This research was supported in part by the National Aeronautics and Space Administration under NASA Grant No. NCC 2-106.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号