全文获取类型
收费全文 | 6176篇 |
免费 | 170篇 |
国内免费 | 288篇 |
专业分类
化学 | 1428篇 |
晶体学 | 10篇 |
力学 | 742篇 |
综合类 | 29篇 |
数学 | 3213篇 |
物理学 | 1212篇 |
出版年
2024年 | 4篇 |
2023年 | 115篇 |
2022年 | 72篇 |
2021年 | 87篇 |
2020年 | 124篇 |
2019年 | 90篇 |
2018年 | 80篇 |
2017年 | 134篇 |
2016年 | 158篇 |
2015年 | 126篇 |
2014年 | 281篇 |
2013年 | 377篇 |
2012年 | 262篇 |
2011年 | 321篇 |
2010年 | 281篇 |
2009年 | 452篇 |
2008年 | 480篇 |
2007年 | 487篇 |
2006年 | 344篇 |
2005年 | 292篇 |
2004年 | 255篇 |
2003年 | 222篇 |
2002年 | 217篇 |
2001年 | 159篇 |
2000年 | 156篇 |
1999年 | 129篇 |
1998年 | 133篇 |
1997年 | 101篇 |
1996年 | 90篇 |
1995年 | 70篇 |
1994年 | 75篇 |
1993年 | 60篇 |
1992年 | 54篇 |
1991年 | 42篇 |
1990年 | 25篇 |
1989年 | 32篇 |
1988年 | 44篇 |
1987年 | 20篇 |
1986年 | 27篇 |
1985年 | 28篇 |
1984年 | 31篇 |
1983年 | 9篇 |
1982年 | 20篇 |
1981年 | 12篇 |
1980年 | 14篇 |
1979年 | 13篇 |
1978年 | 10篇 |
1977年 | 8篇 |
1976年 | 7篇 |
1975年 | 2篇 |
排序方式: 共有6634条查询结果,搜索用时 15 毫秒
1.
Dean A. Carlson 《Journal of Mathematical Analysis and Applications》2002,276(2):561-588
The method of equivalent variational methods, originally due to Carathéodory for free problems in the calculus of variations is extended to investigate feedback Nash equilibria for a class of n-person differential games. Both the finite-horizon and infinite-horizon cases are considered. Examples are given to illustrate the presented results. 相似文献
2.
Fabio Schoen 《Journal of Global Optimization》1991,1(3):207-228
In this paper stochastic algorithms for global optimization are reviewed. After a brief introduction on random-search techniques, a more detailed analysis is carried out on the application of simulated annealing to continuous global optimization. The aim of such an analysis is mainly that of presenting recent papers on the subject, which have received only scarce attention in the most recent published surveys. Finally a very brief presentation of clustering techniques is given. 相似文献
3.
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. 相似文献
4.
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. 相似文献
5.
An optical measurement of vortex shape at a free surface 总被引:1,自引:0,他引:1
We have proposed an optical method of vortex shape measurement based on Fourier transform profilometry (FTP) and verified it by experiment. The results of our experiment proposed in this paper show that FTP can efficiently reconstruct the vortex shape at a free surface and this method is suitable for wide use in studying such problems as liquid shear flow, wake of an object, flow behind a bluff body, and wetting angle. 相似文献
6.
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. 相似文献
7.
Optimization technologies and environmental applications 总被引:1,自引:0,他引:1
8.
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. 相似文献
9.
10.
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. 相似文献