全文获取类型
收费全文 | 7261篇 |
免费 | 694篇 |
国内免费 | 221篇 |
专业分类
化学 | 331篇 |
晶体学 | 2篇 |
力学 | 600篇 |
综合类 | 78篇 |
数学 | 5689篇 |
物理学 | 1476篇 |
出版年
2023年 | 62篇 |
2022年 | 107篇 |
2021年 | 151篇 |
2020年 | 177篇 |
2019年 | 151篇 |
2018年 | 164篇 |
2017年 | 171篇 |
2016年 | 208篇 |
2015年 | 134篇 |
2014年 | 270篇 |
2013年 | 651篇 |
2012年 | 317篇 |
2011年 | 308篇 |
2010年 | 322篇 |
2009年 | 387篇 |
2008年 | 409篇 |
2007年 | 452篇 |
2006年 | 382篇 |
2005年 | 351篇 |
2004年 | 278篇 |
2003年 | 275篇 |
2002年 | 259篇 |
2001年 | 244篇 |
2000年 | 246篇 |
1999年 | 183篇 |
1998年 | 201篇 |
1997年 | 160篇 |
1996年 | 127篇 |
1995年 | 108篇 |
1994年 | 106篇 |
1993年 | 89篇 |
1992年 | 82篇 |
1991年 | 70篇 |
1990年 | 57篇 |
1989年 | 51篇 |
1988年 | 54篇 |
1987年 | 37篇 |
1986年 | 42篇 |
1985年 | 60篇 |
1984年 | 57篇 |
1983年 | 18篇 |
1982年 | 34篇 |
1981年 | 23篇 |
1980年 | 22篇 |
1979年 | 21篇 |
1978年 | 19篇 |
1977年 | 26篇 |
1976年 | 17篇 |
1974年 | 6篇 |
1973年 | 6篇 |
排序方式: 共有8176条查询结果,搜索用时 78 毫秒
11.
Vivek F. Farias 《Operations Research Letters》2006,34(2):180-190
We consider a problem of allocating limited quantities of M types of resources among N independent activities that evolve over T epochs. In each epoch, we assign to each activity a task which consumes resources, generates utility, and determines the subsequent state of the activity. We study the complexity of, and approximation algorithms for, maximizing average utility. 相似文献
12.
Dual fractional cutting plane algorithms, in which cutting planes are used to iteratively tighten a linear relaxation of an integer program,
are well-known and form the basis of the highly successful branch-and-cut method. It is rather less well-known that various primal cutting plane algorithms were developed in the 1960s, for example by Young. In a primal algorithm, the main role of the cutting
planes is to enable a feasible solution to the original problem to be improved. Research on these algorithms has been almost
non-existent.
In this paper we argue for a re-examination of these primal methods. We describe a new primal algorithm for pure 0-1 problems based on strong valid inequalities and give some encouraging computational results. Possible extensions to the case of general
mixed-integer programs are also discussed. 相似文献
13.
14.
Evolutionary algorithms are applied as problem-independent optimization algorithms. They are quite efficient in many situations. However, it is difficult to analyze even the behavior of simple variants of evolutionary algorithms like the (1+1) EA on rather simple functions. Nevertheless, only the analysis of the expected run time and the success probability within a given number of steps can guide the choice of the free parameters of the algorithms. Here static (1+1) EAs with a fixed mutation probability are compared with dynamic (1+1) EAs with a simple schedule for the variation of the mutation probability. The dynamic variant is first analyzed for functions typically chosen as example-functions for evolutionary algorithms. Afterwards, it is shown that it can be essential to choose the suitable variant of the (1+1) EA. More precisely, functions are presented where each static (1+1) EA has exponential expected run time while the dynamic variant has polynomial expected run time. For other functions it is shown that the dynamic (1+1) EA has exponential expected run time while a static (1+1) EA with a good choice of the mutation probability has polynomial run time with overwhelming probability. 相似文献
15.
R. S. Martynov Yu. M. Nechepurenko 《Computational Mathematics and Mathematical Physics》2006,46(7):1155-1167
For a discrete linear stochastic dynamical system, computation of the response matrix to the external action from a subspace using given observational data is examined. An algorithm is proposed and substantiated that makes it possible to improve the numerical accuracy and to reduce the amount of observational data compared to the general case where an arbitrary external action is allowed. As an illustration, a discrete system arising in the analysis of a linear stochastic dynamical continuous-time system is considered more thoroughly. Some numerical results are presented. 相似文献
16.
The Boltzmann distribution used in the steady-state analysis of the simulated annealing algorithm gives rise to several scale invariant properties. Scale invariance is first presented in the context of parallel independent processors and then extended to an abstract form based on lumping states together to form new aggregate states. These lumped or aggregate states possess all of the mathematical characteristics, forms and relationships of states (solutions) in the original problem in both first and second moments. These scale invariance properties therefore permit new ways of relating objective function values, conditional expectation values, stationary probabilities, rates of change of stationary probabilities and conditional variances. Such properties therefore provide potential applications in analysis, statistical inference and optimization. Directions for future research that take advantage of scale invariance are also discussed. 相似文献
17.
总结两个保守映象不可逆地分段连续链接(称为类耗散系统)以及一个保守映象与一个耗散映象不可逆地分段连续链接(称为半耗散系统)情况下得到的五项共同动力学特征:不连续边界象集构成的随机网成为唯一的混沌轨道;由于某些相点具有两个逆象而导致的相空间塌缩(类耗散);由于系统的不连续不可逆性质而出现的胖分形禁区网;在具有吸引子共存时占据不连续边界象集随机网和胖分形禁区网区域的点滴状吸引域以及由此导致的吸引子不可预言性;即使在传统强耗散存在的情况下点滴状吸引域仍由类耗散机制主宰.以一个累积-触发电路为例,说明这五项系统动
关键词:
随机网
禁区网
点滴状吸引域 相似文献
18.
Jeannette H. C. Woerner 《商业与工业应用随机模型》2005,21(1):27-44
In the framework of stochastic volatility models we examine estimators for the integrated volatility based on the pth power variation (i.e. the sum of pth absolute powers of the log‐returns). We derive consistency and distributional results for the estimators given high‐frequency data, especially taking into account what kind of process we may add to our model without affecting the estimate of the integrated volatility. This may on the one hand be interpreted as a possible flexibility in modelling, for example adding jumps or even leaving the framework of semimartingales by adding a fractional Brownian motion, or on the other hand as robustness against model misspecification. We will discuss possible choices of p under different model assumptions and irregularly spaced data. Copyright © 2005 John Wiley & Sons, Ltd. 相似文献
19.
Tor Schoenmeyr David Yu Zhang 《Journal of Algorithms in Cognition, Informatics and Logic》2005,57(2):130-139
The string matching with mismatches problem requires finding the Hamming distance between a pattern P of length m and every length m substring of text T with length n. Fischer and Paterson's FFT-based algorithm solves the problem without error in O(σnlogm), where σ is the size of the alphabet Σ [SIAM–AMS Proc. 7 (1973) 113–125]. However, this in the worst case reduces to O(nmlogm). Atallah, Chyzak and Dumas used the idea of randomly mapping the letters of the alphabet to complex roots of unity to estimate the score vector in time O(nlogm) [Algorithmica 29 (2001) 468–486]. We show that the algorithm's score variance can be substantially lowered by using a bijective mapping, and specifically to zero in the case of binary and ternary alphabets. This result is extended via alphabet remappings to deterministically solve the string matching with mismatches problem with a constant factor of 2 improvement over Fischer–Paterson's method. 相似文献
20.
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. 相似文献