首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   1943篇
  免费   82篇
  国内免费   42篇
化学   264篇
晶体学   15篇
力学   57篇
综合类   45篇
数学   1417篇
物理学   269篇
  2025年   7篇
  2024年   17篇
  2023年   18篇
  2022年   48篇
  2021年   48篇
  2020年   34篇
  2019年   26篇
  2018年   38篇
  2017年   43篇
  2016年   53篇
  2015年   40篇
  2014年   78篇
  2013年   107篇
  2012年   93篇
  2011年   97篇
  2010年   93篇
  2009年   116篇
  2008年   151篇
  2007年   140篇
  2006年   87篇
  2005年   92篇
  2004年   88篇
  2003年   59篇
  2002年   59篇
  2001年   58篇
  2000年   63篇
  1999年   57篇
  1998年   39篇
  1997年   36篇
  1996年   34篇
  1995年   25篇
  1994年   16篇
  1993年   18篇
  1992年   13篇
  1991年   7篇
  1990年   5篇
  1989年   6篇
  1988年   9篇
  1987年   4篇
  1986年   5篇
  1985年   7篇
  1984年   6篇
  1983年   3篇
  1982年   2篇
  1981年   4篇
  1979年   3篇
  1977年   7篇
  1976年   3篇
  1973年   1篇
  1959年   1篇
排序方式: 共有2067条查询结果,搜索用时 15 毫秒
151.
This paper presents a hybrid trust region algorithm for unconstrained optimization problems. It can be regarded as a combination of ODE-based methods, line search and trust region techniques. A feature of the proposed method is that at each iteration, a system of linear equations is solved only once to obtain a trial step. Further, when the trial step is not accepted, the method performs an inexact line search along it instead of resolving a new linear system. Under reasonable assumptions, the algorithm is proven to be globally and superlinearly convergent. Numerical results are also reported that show the efficiency of this proposed method.  相似文献   
152.
This paper addresses a special kind of container loading problem with shipment priority. We present a tree search method, which is based on a greedy heuristic. In the greedy heuristic, blocks made up of identical items with the same orientation are selected for packing into a container. Five evaluation functions are proposed for block selection, and the different blocks selected by each evaluation function constitute the branches of the search tree. A method of space splitting and merging is also embedded in the algorithm to facilitate efficient use of the container space. In addition, the proposed algorithm covers an important constraint called shipment priority to solve practical problems. The validity of the proposed algorithm is examined by comparing the present results with those of published algorithms using the same data.  相似文献   
153.
The Barzilai–Borwein (BB) gradient method has received many studies due to its simplicity and numerical efficiency. By incorporating a nonmonotone line search, Raydan (SIAM J Optim. 1997;7:26–33) has successfully extended the BB gradient method for solving general unconstrained optimization problems so that it is competitive with conjugate gradient methods. However, the numerical results reported by Raydan are poor for very ill-conditioned problems because the effect of the degree of nonmonotonicity may be noticeable. In this paper, we focus more on the nonmonotone line search technique used in the global Barzilai–Borwein (GBB) gradient method. We improve the performance of the GBB gradient method by proposing an adaptive nonmonotone line search based on the morphology of the objective function. We also prove the global convergence and the R-linear convergence rate of the proposed method under reasonable assumptions. Finally, we give some numerical experiments made on a set of unconstrained optimization test problems of the CUTEr collection. The results show the efficiency of the proposed method in the sense of the performance profile introduced (Math Program. 2002;91:201–213) by Dolan and Moré.  相似文献   
154.
A new method of moving asymptotes for large-scale minimization subject to linear equality constraints is discussed.In this method,linear equality constraints are deleted with null space technique and the descending direction is obtained by solving a convex separable subproblem of moving asymptotes in each iteration. New rules for controlling the asymptotes parameters are designed and the global convergence of the method under some reasonable conditions is established and proved.The numerical results show that the new method may be capable of processing some large scale problems.  相似文献   
155.
对直线式逃跑的潜艇被捕获的必然性进行了证明,并为驱逐舰给出了一个最佳的搜索模型.  相似文献   
156.
对于无约束优化问题,提出了一类新的三项记忆梯度算法.这类算法是在参数满足某些假设的条件下,确定它的取值范围,从而保证三项记忆梯度方向是使目标函数充分下降的方向.在非单调步长搜索下讨论了算法的全局收敛性.为了得到具有更好收敛性质的算法,结合Solodov and Svaiter(2000)中的部分技巧,提出了一种新的记忆梯度投影算法,并证明了该算法在函数伪凸的情况下具有整体收敛性.  相似文献   
157.
In this article, local optimality in multiobjective combinatorial optimization is used as a baseline for the design and analysis of two iterative improvement algorithms. Both algorithms search in a neighborhood that is defined on a collection of sets of feasible solutions and their acceptance criterion is based on outperformance relations. Proofs of the soundness and completeness of these algorithms are given.  相似文献   
158.
159.
Let Xi,iN, be independent and identically distributed random variables with values in N0. We transform (‘prune’) the sequence {X1,,Xn},nN, of discrete random samples into a sequence {0,1,2,,Yn},nN, of contiguous random sets by replacing Xn+1 with Yn+1 if Xn+1>Yn. We consider the asymptotic behaviour of Yn as n. Applications include path growth in digital search trees and the number of tables in Pitmanʼs Chinese restaurant process if the latter is conditioned on its limit value.  相似文献   
160.
An inverse problem is solved for estimating fuel cell operating parameters such as current density, pressure and fuel flow rate (FFR) separately and then simultaneously two parameters in an internal reforming solid oxide fuel cell (IRSOFC). Initially, a mathematical model for the forward problem is developed to simulate the IRSOFC steady state operation and its performance in terms of power output and then an inverse problem is solved for recovering the above parameters using a simplex search minimization algorithm. The objective function (IRSOFC power) and the estimation accuracy are studied for the effects of initial guess values of the operating parameters and the number of iterations required for retrieval of these parameters. The objective function is represented by the sum of square of the error between a given IRSOFC power and the power evaluated based on some arbitrary guessed values of the unknowns which is then regularized in an iterative manner for solution of the inverse fuel cell problem. The study reveals that a multiple combinations of parameters (current density, operating pressure and FFR) exist which provides guidelines for selecting feasible combinations of these parameters required for meeting a given power requirement. The results show relatively good agreement between the inverse and exact solutions.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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