全文获取类型
收费全文 | 8503篇 |
免费 | 310篇 |
国内免费 | 251篇 |
专业分类
化学 | 209篇 |
晶体学 | 5篇 |
力学 | 285篇 |
综合类 | 82篇 |
数学 | 8144篇 |
物理学 | 339篇 |
出版年
2023年 | 39篇 |
2022年 | 71篇 |
2021年 | 90篇 |
2020年 | 92篇 |
2019年 | 124篇 |
2018年 | 120篇 |
2017年 | 147篇 |
2016年 | 154篇 |
2015年 | 123篇 |
2014年 | 343篇 |
2013年 | 454篇 |
2012年 | 442篇 |
2011年 | 328篇 |
2010年 | 348篇 |
2009年 | 502篇 |
2008年 | 517篇 |
2007年 | 572篇 |
2006年 | 378篇 |
2005年 | 361篇 |
2004年 | 285篇 |
2003年 | 277篇 |
2002年 | 303篇 |
2001年 | 235篇 |
2000年 | 269篇 |
1999年 | 221篇 |
1998年 | 201篇 |
1997年 | 178篇 |
1996年 | 204篇 |
1995年 | 184篇 |
1994年 | 140篇 |
1993年 | 139篇 |
1992年 | 137篇 |
1991年 | 124篇 |
1990年 | 104篇 |
1989年 | 75篇 |
1988年 | 88篇 |
1987年 | 58篇 |
1986年 | 85篇 |
1985年 | 111篇 |
1984年 | 82篇 |
1983年 | 26篇 |
1982年 | 51篇 |
1981年 | 44篇 |
1980年 | 35篇 |
1979年 | 31篇 |
1978年 | 50篇 |
1977年 | 51篇 |
1976年 | 27篇 |
1975年 | 12篇 |
1974年 | 12篇 |
排序方式: 共有9064条查询结果,搜索用时 15 毫秒
101.
Some properties of the bilevel programming problem 总被引:8,自引:0,他引:8
J. F. Bard 《Journal of Optimization Theory and Applications》1991,68(2):371-378
The purpose of this paper is to elaborate on the difficulties accompanying the development of efficient algorithms for solving the bilevel programming problem (BLPP). We begin with a pair of examples showing that, even under the best of circumstances, solutions may not exist. This is followed by a proof that the BLPP is NP-hard.This work was partially supported by a grant from the Advanced Research Program of the Texas Higher Education Coordinating Board. 相似文献
102.
平衡规划问题的熵函数方法及其在混合交通流中的应用 总被引:1,自引:0,他引:1
将参变极值问题的极大熵函数方法应用到求解平衡规划问题中,通过先验分布信息和Kullback熵概念,给出了平衡规划问题基于Kullback熵表示的熵函数求解方法,并将平衡规划的极大熵函数方法应用于求解混合交通平衡分配问题. 相似文献
103.
104.
We examine the problem of building or fortifying a network to defend against enemy attacks in various scenarios. In particular,
we examine the case in which an enemy can destroy any portion of any arc that a designer constructs on the network, subject
to some interdiction budget. This problem takes the form of a three-level, two-player game, in which the designer acts first
to construct a network and transmit an initial set of flows through the network. The enemy acts next to destroy a set of constructed
arcs in the designer’s network, and the designer acts last to transmit a final set of flows in the network. Most studies of
this nature assume that the enemy will act optimally; however, in real-world scenarios one cannot necessarily assume rationality
on the part of the enemy. Hence, we prescribe optimal network design algorithms for three different profiles of enemy action:
an enemy destroying arcs based on capacities, based on initial flows, or acting optimally to minimize our maximum profits
obtained from transmitting flows. 相似文献
105.
Optimality conditions are obtained for a nonlinear fractional multiobjective programming problem involving η-semidifferentiable functions. Also, a general dual is formulated and a duality result is proved using concepts of generalized ρ-semilocally type I-preinvex functions. 相似文献
106.
Madhu V. Nayakkankuppam 《Mathematical Programming》2007,109(2-3):477-504
We describe an approach to the parallel and distributed solution of large-scale, block structured semidefinite programs using
the spectral bundle method. Various elements of this approach (such as data distribution, an implicitly restarted Lanczos
method tailored to handle block diagonal structure, a mixed polyhedral-semidefinite subdifferential model, and other aspects
related to parallelism) are combined in an implementation called LAMBDA, which delivers faster solution times than previously
possible, and acceptable parallel scalability on sufficiently large problems.
This work was supported in part by NSF grants DMS-0215373 and DMS-0238008. 相似文献
107.
108.
We consider a multiperiod mean-variance model where the model parameters change according to a stochastic market. The mean
vector and covariance matrix of the random returns of risky assets all depend on the state of the market during any period
where the market process is assumed to follow a Markov chain. Dynamic programming is used to solve an auxiliary problem which,
in turn, gives the efficient frontier of the mean-variance formulation. An explicit expression is obtained for the efficient
frontier and an illustrative example is given to demonstrate the application of the procedure. 相似文献
109.
Ivan Nunes da Silva Wagner Caradori do AmaralLucia Valeria de Arruda 《Applied Mathematical Modelling》2007
This paper presents an efficient approach based on recurrent neural network for solving nonlinear optimization. More specifically, a modified Hopfield network is developed and its internal parameters are computed using the valid subspace technique. These parameters guarantee the convergence of the network to the equilibrium points that represent an optimal feasible solution. The main advantage of the developed network is that it treats optimization and constraint terms in different stages with no interference with each other. Moreover, the proposed approach does not require specification of penalty and weighting parameters for its initialization. A study of the modified Hopfield model is also developed to analyze its stability and convergence. Simulation results are provided to demonstrate the performance of the proposed neural network. 相似文献
110.