全文获取类型
收费全文 | 5421篇 |
免费 | 478篇 |
国内免费 | 121篇 |
专业分类
化学 | 370篇 |
晶体学 | 2篇 |
力学 | 164篇 |
综合类 | 46篇 |
数学 | 2540篇 |
物理学 | 603篇 |
无线电 | 2295篇 |
出版年
2024年 | 21篇 |
2023年 | 87篇 |
2022年 | 132篇 |
2021年 | 151篇 |
2020年 | 150篇 |
2019年 | 110篇 |
2018年 | 112篇 |
2017年 | 141篇 |
2016年 | 203篇 |
2015年 | 154篇 |
2014年 | 267篇 |
2013年 | 308篇 |
2012年 | 290篇 |
2011年 | 300篇 |
2010年 | 257篇 |
2009年 | 324篇 |
2008年 | 380篇 |
2007年 | 410篇 |
2006年 | 318篇 |
2005年 | 244篇 |
2004年 | 210篇 |
2003年 | 189篇 |
2002年 | 170篇 |
2001年 | 138篇 |
2000年 | 125篇 |
1999年 | 107篇 |
1998年 | 104篇 |
1997年 | 78篇 |
1996年 | 79篇 |
1995年 | 50篇 |
1994年 | 59篇 |
1993年 | 49篇 |
1992年 | 39篇 |
1991年 | 31篇 |
1990年 | 22篇 |
1989年 | 18篇 |
1988年 | 28篇 |
1987年 | 17篇 |
1986年 | 23篇 |
1985年 | 23篇 |
1984年 | 26篇 |
1983年 | 8篇 |
1982年 | 16篇 |
1981年 | 10篇 |
1980年 | 9篇 |
1979年 | 8篇 |
1978年 | 8篇 |
1977年 | 7篇 |
1976年 | 6篇 |
1975年 | 2篇 |
排序方式: 共有6020条查询结果,搜索用时 15 毫秒
121.
S. Talatahari B. Farahmand AzarR. Sheikholeslami A.H. Gandomi 《Communications in Nonlinear Science & Numerical Simulation》2012,17(3):1312-1319
A novel chaotic improved imperialist competitive algorithm (CICA) is presented for global optimization. The ICA is a new meta-heuristic optimization developed based on a socio-politically motivated strategy and contains two main steps: the movement of the colonies and the imperialistic competition. Here different chaotic maps are utilized to improve the movement step of the algorithm. Seven different chaotic maps are investigated and the Logistic and Sinusoidal maps are found as the best choices. Comparing the new algorithm with the other ICA-based methods demonstrates the superiority of the CICA for the benchmark functions. 相似文献
122.
123.
In the literature of the combinatorial optimization problems, it is a commonplace to find more than one mathematical model for the same problem. The significance of a model may be measured in terms of the efficiency of the solution algorithms that can be built upon it. The purpose of this article is to present a new network model for the well known combinatorial optimization problem – the job shop scheduling problem. The new network model has similar structure as the disjunctive graph model except that it uses permutations of jobs as decision variables instead of the binary decision variables associated with the disjunctive arcs. To assess the significance of the new model, the performances of exact branch-and-bound algorithmic implementations that are based on both the new model and the disjunctive graph model are compared. 相似文献
124.
Resource availability optimization is studied on a server–client system where different users are partitioned into priority classes. The aim is to provide higher resource availability according to the priority of each class. For this purpose, resource reservation is modeled by a homogeneous continuous time Markov chain (CTMC), but also by a cyclic non-homogeneous Markov chain (CNHMC) as there is a cyclic behavior of the users’ requests for resources. The contribution of the work presented consists in the formulation of a multiobjective optimization problem for both the above cases that aims to determine the optimal resource reservation policy providing higher levels of resource availability for all classes. The optimization problem is solved either with known methods or with a proposed kind of heuristic algorithm. Finally, explicit generalized approximate inverse preconditioning methods are adopted for solving efficiently sparse linear systems that are derived, in order to compute resource availability. 相似文献
125.
The first passage time (FPT) problem is an important problem with a wide range of applications in science, engineering, economics, and industry. Mathematically, such a problem can be reduced to estimating the probability of a stochastic process first to reach a boundary level. In most important applications in the financial industry, the FPT problem does not have an analytical solution and the development of efficient numerical methods becomes the only practical avenue for its solution. Most of our examples in this contribution are centered around the evaluation of default correlations in credit risk analysis, where we are concerned with the joint defaults of several correlated firms, the task that is reducible to a FPT problem. This task represents a great challenge for jump‐diffusion processes (JDP). In this contribution, we develop further our previous fast Monte Carlo method in the case of multivariate (and correlated) JDP. This generalization allows us, among other things, to evaluate the default events of several correlated assets based on a set of empirical data. The developed technique is an efficient tool for a number of financial, economic, and business applications, such as credit analysis, barrier option pricing, macroeconomic dynamics, and the evaluation of risk, as well as for a number of other areas of applications in science and engineering, where the FPT problem arises. Copyright © 2008 John Wiley & Sons, Ltd. 相似文献
126.
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. 相似文献
127.
This study discusses the evolutionary nature of knowledge acquisition at micro and macro levels, and in particular when the process involves an artificial agent's interpretative devices. In order to accomplish this, we propose using an individual learning model (or inner‐world reconstruction model) that in our view overcomes neoclassic epistemological holdups and may increase the predictive power of computational economics, by letting an artificial agent's knowledge evolve by itself, irrespective of globally specified goals or individual motives of behavior; using simultaneous (or parallel) genetic algorithms (GA) to evolve a single agent's learning strategy, each GA with different general specifications, in a multiagent setting. © 2006 Wiley Periodicals, Inc. Complexity 11: 12–19, 2006 相似文献
128.
A.F. Gabor 《Operations Research Letters》2006,34(3):257-263
We propose a 2-approximation algorithm for a facility location problem with stochastic demands. At open facilities, inventory is kept such that arriving requests find a zero inventory with (at most) some pre-specified probability. Costs incurred are expected transportation costs, facility operating costs and inventory costs. 相似文献
129.
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. 相似文献
130.
Abdellah Bnouhachem Muhammad Aslam Noor 《Journal of Mathematical Analysis and Applications》2006,324(2):1195-1212
In this paper, we suggest and analyze a new inexact proximal point method for solving general variational inequalities, which can be considered as an implicit predictor-corrector method. An easily measurable error term is proposed with further relaxed error bound and an optimal step length is obtained by maximizing the profit-function and is dependent on the previous points. Our results include several known and new techniques for solving variational inequalities and related optimization problems. Results obtained in this paper can be viewed as an important improvement and refinement of the previously known results. Preliminary numerical experiments are included to illustrate the advantage and efficiency of the proposed method. 相似文献