全文获取类型
收费全文 | 8552篇 |
免费 | 310篇 |
国内免费 | 252篇 |
专业分类
化学 | 209篇 |
晶体学 | 5篇 |
力学 | 288篇 |
综合类 | 82篇 |
数学 | 8144篇 |
物理学 | 386篇 |
出版年
2023年 | 39篇 |
2022年 | 78篇 |
2021年 | 91篇 |
2020年 | 93篇 |
2019年 | 125篇 |
2018年 | 120篇 |
2017年 | 148篇 |
2016年 | 154篇 |
2015年 | 124篇 |
2014年 | 344篇 |
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年 | 240篇 |
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篇 |
排序方式: 共有9114条查询结果,搜索用时 15 毫秒
11.
12.
We consider the optimal service control of a multiclass M/G/1 queueing system in which customers are served nonpreemptively and the system cost rate is additive across classes and increasing convex in the numbers present in each class. Following Whittle's approach to a class of restless bandit problems, we develop a Langrangian relaxation of the service control problem which serves to motivate the development of a class of index heuristics. The index for a particular customer class is characterised as a fair charge for service of that class. The paper develops these indices and reports an extensive numerical investigation which exhibits strong performance of the index heuristics for both discounted and average costs. 相似文献
13.
在组合系统运用Kalman滤波器技术时,准确的系统模型和可靠的观测数据是保证其性能的重要因素,否则将大大降低Kalman滤波器的估计精度,甚至导致滤波器发散.为解决上述Kalman应用中的实际问题,提出了一种新颖的基于进化人工神经网络技术的自适应Kalman滤波器.仿真试验表明该算法可以在系统模型不准确时、甚至外部观测数据短暂中断时,仍能保证Kalman滤波器的性能. 相似文献
14.
The Sample Average Approximation Method Applied to Stochastic Routing Problems: A Computational Study 总被引:1,自引:0,他引:1
Bram Verweij Shabbir Ahmed Anton J. Kleywegt George Nemhauser Alexander Shapiro 《Computational Optimization and Applications》2003,24(2-3):289-333
The sample average approximation (SAA) method is an approach for solving stochastic optimization problems by using Monte Carlo simulation. In this technique the expected objective function of the stochastic problem is approximated by a sample average estimate derived from a random sample. The resulting sample average approximating problem is then solved by deterministic optimization techniques. The process is repeated with different samples to obtain candidate solutions along with statistical estimates of their optimality gaps.We present a detailed computational study of the application of the SAA method to solve three classes of stochastic routing problems. These stochastic problems involve an extremely large number of scenarios and first-stage integer variables. For each of the three problem classes, we use decomposition and branch-and-cut to solve the approximating problem within the SAA scheme. Our computational results indicate that the proposed method is successful in solving problems with up to 21694 scenarios to within an estimated 1.0% of optimality. Furthermore, a surprising observation is that the number of optimality cuts required to solve the approximating problem to optimality does not significantly increase with the size of the sample. Therefore, the observed computation times needed to find optimal solutions to the approximating problems grow only linearly with the sample size. As a result, we are able to find provably near-optimal solutions to these difficult stochastic programs using only a moderate amount of computation time. 相似文献
15.
G. Z. Ruan S. Y. Wang Y. Yamamoto S. S. Zhu 《Journal of Optimization Theory and Applications》2004,123(2):409-429
In this paper, a model of a linear multilevel programming problem with dominated objective functions (LMPPD(l)) is proposed, where multiple reactions of the lower levels do not lead to any uncertainty in the upper-level decision making. Under the assumption that the constrained set is nonempty and bounded, a necessary optimality condition is obtained. Two types of geometric properties of the solution sets are studied. It is demonstrated that the feasible set of LMPPD(l) is neither necessarily composed of faces of the constrained set nor necessarily connected. These properties are different from the existing theoretical results for linear multilevel programming problems. 相似文献
16.
A server needs to compute a broadcast schedule for n pages whose request times are known in advance. Outputting a page satisfies all outstanding requests for the page. The goal is to minimize the average waiting time of a client. In this paper, we show the equivalence of two apparently different relaxations that have been considered for this problem. 相似文献
17.
Robust linear optimization under general norms 总被引:1,自引:0,他引:1
We explicitly characterize the robust counterpart of a linear programming problem with uncertainty set described by an arbitrary norm. Our approach encompasses several approaches from the literature and provides guarantees for constraint violation under probabilistic models that allow arbitrary dependencies in the distribution of the uncertain coefficients. 相似文献
18.
The control of piecewise-deterministic processes is studied where only local boundedness of the data is assumed. Moreover the discount rate may be zero. The value function is shown to be solution to the Bellman equation in a weak sense; however the solution concept is strong enough to generate optimal policies. Continuity and compactness conditions are given for the existence of nonrelaxed optimal feedback controls. 相似文献
19.
In this paper, we study the stability conditions of the MMAP[K]/G[K]/1/LCFS preemptive repeat queue. We introduce an embedded Markov chain of matrix M/G/1 type with a tree structure and identify conditions for the Markov chain to be ergodic. First, we present three conventional methods for the stability problem of the queueing system of interest. These methods are either computationally demanding or do not provide accurate information for system stability. Then we introduce a novel approach that develops two linear programs whose solutions provide sufficient conditions for stability or instability of the queueing system. The new approach is numerically efficient. The advantages and disadvantages of the methods introduced in this paper are analyzed both theoretically and numerically. 相似文献
20.
The projective method for solving linear matrix inequalities 总被引:2,自引:0,他引:2
Numerous problems in control and systems theory can be formulated in terms of linear matrix inequalities (LMI). Since solving
an LMI amounts to a convex optimization problem, such formulations are known to be numerically tractable. However, the interest
in LMI-based design techniques has really surged with the introduction of efficient interior-point methods for solving LMIs
with a polynomial-time complexity. This paper describes one particular method called the Projective Method. Simple geometrical
arguments are used to clarify the strategy and convergence mechanism of the Projective algorithm. A complexity analysis is
provided, and applications to two generic LMI problems (feasibility and linear objective minimization) are discussed. 相似文献