全文获取类型
收费全文 | 11849篇 |
免费 | 842篇 |
国内免费 | 341篇 |
专业分类
化学 | 1338篇 |
晶体学 | 30篇 |
力学 | 1142篇 |
综合类 | 163篇 |
数学 | 8806篇 |
物理学 | 1553篇 |
出版年
2024年 | 23篇 |
2023年 | 143篇 |
2022年 | 245篇 |
2021年 | 397篇 |
2020年 | 248篇 |
2019年 | 272篇 |
2018年 | 294篇 |
2017年 | 368篇 |
2016年 | 347篇 |
2015年 | 271篇 |
2014年 | 579篇 |
2013年 | 766篇 |
2012年 | 709篇 |
2011年 | 607篇 |
2010年 | 586篇 |
2009年 | 743篇 |
2008年 | 725篇 |
2007年 | 740篇 |
2006年 | 590篇 |
2005年 | 507篇 |
2004年 | 416篇 |
2003年 | 385篇 |
2002年 | 354篇 |
2001年 | 298篇 |
2000年 | 296篇 |
1999年 | 231篇 |
1998年 | 260篇 |
1997年 | 217篇 |
1996年 | 165篇 |
1995年 | 177篇 |
1994年 | 153篇 |
1993年 | 122篇 |
1992年 | 106篇 |
1991年 | 94篇 |
1990年 | 84篇 |
1989年 | 62篇 |
1988年 | 48篇 |
1987年 | 45篇 |
1986年 | 43篇 |
1985年 | 59篇 |
1984年 | 50篇 |
1983年 | 14篇 |
1982年 | 27篇 |
1981年 | 22篇 |
1980年 | 20篇 |
1979年 | 33篇 |
1978年 | 23篇 |
1977年 | 30篇 |
1976年 | 19篇 |
1974年 | 5篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
61.
Ant colony optimization: Introduction and recent trends 总被引:21,自引:0,他引:21
Ant colony optimization is a technique for optimization that was introduced in the early 1990's. The inspiring source of ant colony optimization is the foraging behavior of real ant colonies. This behavior is exploited in artificial ant colonies for the search of approximate solutions to discrete optimization problems, to continuous optimization problems, and to important problems in telecommunications, such as routing and load balancing. First, we deal with the biological inspiration of ant colony optimization algorithms. We show how this biological inspiration can be transfered into an algorithm for discrete optimization. Then, we outline ant colony optimization in more general terms in the context of discrete optimization, and present some of the nowadays best-performing ant colony optimization variants. After summarizing some important theoretical results, we demonstrate how ant colony optimization can be applied to continuous optimization problems. Finally, we provide examples of an interesting recent research direction: The hybridization with more classical techniques from artificial intelligence and operations research. 相似文献
62.
Jose Manuel Corcuera Joao Guerra David Nualart Wim Schoutens 《Applied Mathematics and Optimization》2006,53(3):279-309
In this paper we consider the optimal investment problem in a market where the stock price process is modeled by a geometric
Levy process (taking into account jumps).
Except for the geometric Brownian model and the geometric Poissonian model, the
resulting models are incomplete and there are many equivalent martingale measures.
However, the model can be completed by the so-called power-jump assets. By doing this we allow investment in these new assets
and we can try to maximize the expected utility of these portfolios. As particular cases we obtain the optimal portfolios
based in stocks
and bonds, showing that the new assets are superfluous for certain martingale measures
that depend on the utility function we use. 相似文献
63.
Let G=(V,E) be a undirected k-edge connected graph with weights ce on edges and wv on nodes. The minimum 2-edge connected subgraph problem, 2ECSP for short, is to find a 2-edge connected subgraph of G, of minimum total weight. The 2ECSP generalizes the well-known Steiner 2-edge connected subgraph problem. In this paper we study the convex hull of the incidence vectors corresponding to feasible solutions of 2ECSP. First, a natural integer programming formulation is given and it is shown that its linear relaxation is not sufficient to describe the polytope associated with 2ECSP even when G is series-parallel. Then, we introduce two families of new valid inequalities and we give sufficient conditions for them to be facet-defining. Later, we concentrate on the separation problem. We find polynomial time algorithms to solve the separation of important subclasses of the introduced inequalities, concluding that the separation of the new inequalities, when G is series-parallel, is polynomially solvable. 相似文献
64.
利用Liapunov函数方法,结合积分不等式技巧,分析了时滞细胞神经网络的平衡点存在的唯一性和全局指数稳定性,保证时滞细胞神经网络全局指数稳定的一个新的充分判据被得到.所得判据比已有文献具有更少的限制,为实际应用提供了方便. 相似文献
65.
In this paper we propose a general integration scheme for a Multi-Criteria Decision Making model of the Multi-Attribute Utility
Theory in Constraint Programming. We introduce the Choquet integral as a general aggregation function for multi-criteria optimization
problems and define the Choquet global constraint that propagates this function during the Branch-and-Bound search. Finally the benefits of the propagation
of the Choquet constraint are evaluated on the examination timetabling problem. 相似文献
66.
We present a new verified optimization method to find regions for Hénon systems where the conditions of chaotic behaviour
hold. The present paper provides a methodology to verify chaos for certain mappings and regions. We discuss first how to check
the set theoretical conditions of a respective theorem in a reliable way by computer programs. Then we introduce optimization
problems that provide a model to locate chaotic regions. We prove the correctness of the underlying checking algorithms and
the optimization model. We have verified an earlier published chaotic region, and we also give new chaotic places located
by the new technique. 相似文献
67.
Dmitry I. Belov Ronald D. Armstrong 《Computational Optimization and Applications》2006,33(2-3):319-332
This paper introduces a novel approach for extracting the maximum number of non-overlapping test forms from a large collection
of overlapping test sections assembled from a given item bank. The approach involves solving maximum set packing problems
(MSPs). A branch-and-bound MSP algorithm is developed along with techniques adapted from constraint programming to estimate
lower and upper bounds on the optimal MSP solution. The algorithm is general and can be applied in other applications including
combinatorial auctions. The results of computer simulations and experiments with an operational item bank are presented.
An erratum to this article is available at . 相似文献
68.
Many recent algorithmic approaches involve the construction of a differential equation model for computational purposes, typically
by introducing an artificial time variable. The actual computational model involves a discretization of the now time-dependent differential system, usually
employing forward Euler. The resulting dynamics of such an algorithm is then a discrete dynamics, and it is expected to be
“close enough” to the dynamics of the continuous system (which is typically easier to analyze) provided that small – hence
many – time steps, or iterations, are taken. Indeed, recent papers in inverse problems and image processing routinely report
results requiring thousands of iterations to converge. This makes one wonder if and how the computational modeling process
can be improved to better reflect the actual properties sought.
In this article we elaborate on several problem instances that illustrate the above observations. Algorithms may often lend
themselves to a dual interpretation, in terms of a simply discretized differential equation with artificial time and in terms
of a simple optimization algorithm; such a dual interpretation can be advantageous. We show how a broader computational modeling
approach may possibly lead to algorithms with improved efficiency.
AMS subject classification (2000) 65L05, 65M32, 65N21, 65N22, 65D18 相似文献
69.
Lotka-Volterra型N-种群竞争系统的持久性和稳定性 总被引:6,自引:0,他引:6
本文研究一类具有无穷时滞的概周期Lotka-Volterra型N-种群竞争系统的持久性和全局渐近稳定性.一些新的充分条件被得到. 相似文献
70.
Regina S. Burachik Rafail N. Gasimov Nergiz A. Ismayilova C. Yalçin. Kaya 《Journal of Global Optimization》2006,34(1):55-78
We study convergence properties of a modified subgradient algorithm, applied to the dual problem defined by the sharp augmented
Lagrangian. The primal problem we consider is nonconvex and nondifferentiable, with equality constraints. We obtain primal
and dual convergence results, as well as a condition for existence of a dual solution. Using a practical selection of the
step-size parameters, we demonstrate the algorithm and its advantages on test problems, including an integer programming and
an optimal control problem.
*Partially Supported by 2003 UniSA ITEE Small Research Grant Ero2.
Supported by CAPES, Brazil, Grant No. 0664-02/2, during her visit to the School of Mathematics and Statistics, UniSA. 相似文献