全文获取类型
收费全文 | 2731篇 |
免费 | 160篇 |
国内免费 | 227篇 |
专业分类
化学 | 218篇 |
力学 | 43篇 |
综合类 | 36篇 |
数学 | 2402篇 |
物理学 | 147篇 |
无线电 | 272篇 |
出版年
2024年 | 3篇 |
2023年 | 28篇 |
2022年 | 40篇 |
2021年 | 32篇 |
2020年 | 43篇 |
2019年 | 57篇 |
2018年 | 58篇 |
2017年 | 57篇 |
2016年 | 77篇 |
2015年 | 60篇 |
2014年 | 126篇 |
2013年 | 182篇 |
2012年 | 101篇 |
2011年 | 123篇 |
2010年 | 117篇 |
2009年 | 171篇 |
2008年 | 225篇 |
2007年 | 175篇 |
2006年 | 160篇 |
2005年 | 157篇 |
2004年 | 103篇 |
2003年 | 118篇 |
2002年 | 98篇 |
2001年 | 93篇 |
2000年 | 91篇 |
1999年 | 91篇 |
1998年 | 83篇 |
1997年 | 72篇 |
1996年 | 58篇 |
1995年 | 36篇 |
1994年 | 29篇 |
1993年 | 28篇 |
1992年 | 23篇 |
1991年 | 15篇 |
1990年 | 15篇 |
1989年 | 17篇 |
1988年 | 15篇 |
1987年 | 6篇 |
1986年 | 4篇 |
1985年 | 25篇 |
1984年 | 17篇 |
1983年 | 4篇 |
1982年 | 13篇 |
1981年 | 15篇 |
1980年 | 20篇 |
1979年 | 15篇 |
1978年 | 8篇 |
1977年 | 5篇 |
1976年 | 4篇 |
1936年 | 1篇 |
排序方式: 共有3118条查询结果,搜索用时 0 毫秒
1.
In this paper we introduce a generalization of stable sets: stable multi-sets. A stable multi-set is an assignment of integers
to the vertices of a graph, such that specified bounds on vertices and edges are not exceeded. In case all vertex and edge
bounds equal one, stable multi-sets are equivalent to stable sets.
For the stable multi-set problem, we derive reduction rules and study the associated polytope. We state necessary and sufficient
conditions for the extreme points of the linear relaxation to be integer. These conditions generalize the conditions for the
stable set polytope. Moreover, the classes of odd cycle and clique inequalities for stable sets are generalized to stable
multi-sets and conditions for them to be facet defining are determined.
The study of stable multi-sets is initiated by optimization problems in the field of telecommunication networks. Stable multi-sets
emerge as an important substructure in the design of optical networks.
Received: February 14, 2001/Revised version: September 7, 2001 相似文献
2.
When an organization solves a portfolio problem with public projects evaluated by multiple criteria, in which the economic dimension is not essential or not well characterized, the classical methods are not useful. We propose a non-linear preference model developed from normative Value Theory and using fuzzy sets to model some sources of imprecision. This model can be considered as a generalization of the classical approaches. However, the optimization problem is very complex in order to be solved with non-linear programming techniques. Therefore, the model is exploited by an evolutionary algorithm, able to achieve a strong improvement of the quality of solution. 相似文献
3.
This paper presents a unified analysis of decomposition algorithms for continuously differentiable optimization problems defined on Cartesian products of convex feasible sets. The decomposition algorithms are analyzed using the framework of cost approx imation algorithms. A convergence analysis is made for three decomposition algorithms: a sequential algorithm which extends the classical Gauss-Seidel scheme, a synchronized parallel algorithm which extends the Jacobi method, and a partially asynchronous parallel algorithm. The analysis validates inexact computations in both the subproblem and line search phases, and includes convergence rate results. The range of feasible step lengths within each algorithm is shown to have a direct correspondence to the increasing degree of parallelism and asynchronism, and the resulting usage of more outdated information in the algorithms. 相似文献
4.
We construct a correspondence between the set of partitions of a finite set M and the set of pairs of walks to the same vertex on a graph giving the Bratteli diagram of the partition algebra on M. This is the precise analogue of the correspondence between the set of permutations of a finite set and the set of pairs of Young tableaux of the same shape, called the Robinson–Schensted correspondence. 相似文献
5.
External difference families (EDFs) are a type of new combinatorial designs originated from cryptography. In this paper, some
earlier ideas of recursive and cyclotomic constructions of combinatorial designs are extended, and a number of classes of
EDFs and disjoint difference families are presented. A link between a subclass of EDFs and a special type of (almost) difference
sets is set up. 相似文献
6.
Silvia Vogel 《Annals of Operations Research》2006,142(1):269-282
The paper considers upper semicontinuous behavior in distribution of sequences of random closed sets. Semiconvergence in distribution
will be described via convergence in distribution of random variables with values in a suitable topological space. Convergence
statements for suitable functions of random sets are proved and the results are employed to derive stability statements for
random optimization problems where the objective function and the constraint set are approximated simultaneously.
The author is grateful to two anonymous referees for helpful suggestions. 相似文献
7.
Jonathan M. Borwein 《Optimization Letters》2007,1(1):21-32
This paper is a companion to a lecture given at the Prague Spring School in Analysis in April 2006. It highlights four distinct variational methods of proving that a finite dimensional Chebyshev set is convex and hopes to inspire renewed work on the open question of whether every Chebyshev set in Hilbert space is convex. 相似文献
8.
An extremum problem is embedded in a parametric scheme which contains, as a particular case, the classic perturbation function. The introduction of the image of the embedded problem allows one to derive a generalized duality and, in particular, Lagrangian and Fenchel duality. 相似文献
9.
We study game formulas the truth of which is determined by a semantical game of uncountable length. The main theme is the study of principles stating reflection of these formulas in various admissible sets. This investigation leads to two weak forms of strict-II11 reflection (or ∑1-compactness). We show that admissible sets such as H(ω2) and Lω2 which fail to have strict-II11 reflection, may or may not, depending on set-theoretic hypotheses satisfy one or both of these weaker forms. Mathematics Subject Classification : 03C70, 03C75. 相似文献
10.
Optimization theory provides a framework for determining the best decisions or actions with respect to some mathematical model of a process. This paper focuses on learning to act in a near-optimal manner through reinforcement learning for problems that either have no model or the model is too complex. One approach to solving this class of problems is via approximate dynamic programming. The application of these methods are established primarily for the case of discrete state and action spaces. In this paper we develop efficient methods of learning which act in complex systems with continuous state and action spaces. Monte-Carlo approaches are employed to estimate function values in an iterative, incremental procedure. Derivative-free line search methods are used to obtain a near-optimal action in the continuous action space for a discrete subset of the state space. This near-optimal control policy is then extended to the entire continuous state space via a fuzzy additive model. To compensate for approximation errors, a modified procedure for perturbing the generated control policy is developed. Convergence results under moderate assumptions and stopping criteria are established. 相似文献