全文获取类型
收费全文 | 4877篇 |
免费 | 161篇 |
国内免费 | 101篇 |
专业分类
化学 | 240篇 |
晶体学 | 3篇 |
力学 | 217篇 |
综合类 | 28篇 |
数学 | 4154篇 |
物理学 | 497篇 |
出版年
2024年 | 4篇 |
2023年 | 57篇 |
2022年 | 73篇 |
2021年 | 74篇 |
2020年 | 99篇 |
2019年 | 78篇 |
2018年 | 69篇 |
2017年 | 62篇 |
2016年 | 93篇 |
2015年 | 87篇 |
2014年 | 161篇 |
2013年 | 316篇 |
2012年 | 219篇 |
2011年 | 221篇 |
2010年 | 225篇 |
2009年 | 328篇 |
2008年 | 366篇 |
2007年 | 363篇 |
2006年 | 262篇 |
2005年 | 206篇 |
2004年 | 172篇 |
2003年 | 161篇 |
2002年 | 139篇 |
2001年 | 116篇 |
2000年 | 112篇 |
1999年 | 111篇 |
1998年 | 114篇 |
1997年 | 98篇 |
1996年 | 87篇 |
1995年 | 71篇 |
1994年 | 69篇 |
1993年 | 63篇 |
1992年 | 46篇 |
1991年 | 43篇 |
1990年 | 37篇 |
1989年 | 28篇 |
1988年 | 32篇 |
1987年 | 20篇 |
1986年 | 34篇 |
1985年 | 38篇 |
1984年 | 29篇 |
1983年 | 11篇 |
1982年 | 23篇 |
1981年 | 20篇 |
1980年 | 28篇 |
1979年 | 19篇 |
1978年 | 18篇 |
1977年 | 21篇 |
1976年 | 11篇 |
1974年 | 2篇 |
排序方式: 共有5139条查询结果,搜索用时 15 毫秒
41.
42.
Various problems associated with optimal path planning for mobile observers such as mobile robots equipped with cameras to obtain maximum visual coverage of a surface in the three-dimensional Euclidean space are considered. The existence of solutions to these problems is discussed first. Then, optimality conditions are derived by considering local path perturbations. Numerical algorithms for solving the corresponding approximate problems are proposed. Detailed solutions to the optimal path planning problems for a few examples are given. 相似文献
43.
Linear mixed 0–1 integer programming problems may be reformulated as equivalent continuous bilevel linear programming (BLP)
problems. We exploit these equivalences to transpose the concept of mixed 0–1 Gomory cuts to BLP. The first phase of our new
algorithm generates Gomory-like cuts. The second phase consists of a branch-and-bound procedure to ensure finite termination
with a global optimal solution. Different features of the algorithm, in particular, the cut selection and branching criteria
are studied in details. We propose also a set of algorithmic tests and procedures to improve the method. Finally, we illustrate
the performance through numerical experiments. Our algorithm outperforms pure branch-and-bound when tested on a series of
randomly generated problems.
Work of the authors was partially supported by FCAR, MITACS and NSERC grants. 相似文献
44.
René Meziat Diego Patiño Pablo Pedregal 《Computational Optimization and Applications》2007,38(1):147-171
We propose an alternative method for computing effectively the solution of non-linear, fixed-terminal-time, optimal control
problems when they are given in Lagrange, Bolza or Mayer forms. This method works well when the nonlinearities in the control
variable can be expressed as polynomials. The essential of this proposal is the transformation of a non-linear, non-convex
optimal control problem into an equivalent optimal control problem with linear and convex structure. The method is based on
global optimization of polynomials by the method of moments. With this method we can determine either the existence or lacking
of minimizers. In addition, we can calculate generalized solutions when the original problem lacks of minimizers. We also
present the numerical schemes to solve several examples arising in science and technology. 相似文献
45.
A review of the optimal stopping problem with more than a single decision maker (DM) is presented in this paper. We classify
the existing literature according to the arrival of the offers, the utility of the DMs, the length of the sequence of offers,
the nature of the game and the number of offers to be selected. We enumerate various definitions for this problem and describe
some dynamic approaches.
Fouad Ben Abdelaziz is on leave from the Institut Superieur de Gestion, University of Tunis, Tunisia e-mail: foued.benabdelaz@isg.run.tn. 相似文献
46.
Some authors claim that reporting the best result obtained by a stochastic algorithm in a number of runs is more meaningful
than reporting some central statistic. In this short note, we analyze and refute the main argument brought in favor of this
statement. 相似文献
47.
In this paper, we provide bounds for the expected value of the log of the condition number C(A) of a linear feasibility problem given by a n × m matrix A (Ref. 1). We show that this expected value is O(min{n, m log n}) if n > m and is O(log n) otherwise. A similar bound applies for the log of the condition number C
R(A) introduced by Renegar (Ref. 2). 相似文献
48.
Marco Marletta 《Advances in Computational Mathematics》1994,2(2):155-184
This paper discusses the numerical solution of eigenvalue problems for Hamiltonian systems of ordinary differential equations.
Two new codes are presented which incorporate the algorithms described here; to the best of the author’s knowledge, these
are the first codes capable of solving numerically such general eigenvalue problems. One of these implements a new new method
of solving a differential equation whose solution is a unitary matrix. Both codes are fully documented and are written inPfort-verifiedFortran 77, and will be available in netlib/aicm/sl11f and netlib/aicm/sl12f. 相似文献
49.
K. Holmåker 《Journal of Optimization Theory and Applications》1991,71(2):205-235
Some optimization problems concerning a substrate in a fluid are considered. The concentration of the substrate is affected by diffusion, convection, and elimination by enzymes, and the problem is to find the optimal distribution of enzymes. In this paper, the rate of elimination and the transmission coefficient are optimized. Mathematically, these problems are optimal control problems, and they are analyzed by means of Pontryagin's maximum principle. 相似文献
50.
Direct Shooting Method for the Numerical Solution of Higher-Index DAE Optimal Control Problems 总被引:3,自引:0,他引:3
A method for the numerical solution of state-constrained optimal control problems subject to higher-index differential-algebraic equation (DAE) systems is introduced. For a broad and important class of DAE systems (semiexplicit systems with algebraic variables of different index), a direct multiple shooting method is developed. The multiple shooting method is based on the discretization of the optimal control problem and its transformation into a finite-dimensional nonlinear programming problem (NLP). Special attention is turned to the mandatory calculation of consistent initial values at the multiple shooting nodes within the iterative solution process of (NLP). Two different methods are proposed. The projection method guarantees consistency within each iteration, whereas the relaxation method achieves consistency only at an optimal solution. An illustrative example completes this article. 相似文献