全文获取类型
收费全文 | 2818篇 |
免费 | 138篇 |
国内免费 | 65篇 |
专业分类
化学 | 365篇 |
力学 | 75篇 |
综合类 | 29篇 |
数学 | 862篇 |
物理学 | 404篇 |
无线电 | 1286篇 |
出版年
2024年 | 4篇 |
2023年 | 31篇 |
2022年 | 36篇 |
2021年 | 52篇 |
2020年 | 39篇 |
2019年 | 42篇 |
2018年 | 27篇 |
2017年 | 66篇 |
2016年 | 71篇 |
2015年 | 86篇 |
2014年 | 179篇 |
2013年 | 167篇 |
2012年 | 133篇 |
2011年 | 146篇 |
2010年 | 141篇 |
2009年 | 185篇 |
2008年 | 194篇 |
2007年 | 227篇 |
2006年 | 179篇 |
2005年 | 142篇 |
2004年 | 135篇 |
2003年 | 106篇 |
2002年 | 99篇 |
2001年 | 57篇 |
2000年 | 84篇 |
1999年 | 69篇 |
1998年 | 65篇 |
1997年 | 46篇 |
1996年 | 41篇 |
1995年 | 34篇 |
1994年 | 22篇 |
1993年 | 20篇 |
1992年 | 17篇 |
1991年 | 3篇 |
1990年 | 2篇 |
1989年 | 6篇 |
1988年 | 4篇 |
1987年 | 3篇 |
1986年 | 5篇 |
1985年 | 9篇 |
1984年 | 9篇 |
1983年 | 8篇 |
1982年 | 6篇 |
1981年 | 5篇 |
1980年 | 5篇 |
1979年 | 5篇 |
1978年 | 5篇 |
1977年 | 2篇 |
1973年 | 1篇 |
1966年 | 1篇 |
排序方式: 共有3021条查询结果,搜索用时 0 毫秒
91.
A hybrid shuffled complex evolution approach based on differential evolution for unconstrained optimization 总被引:1,自引:0,他引:1
Viviana Cocco Mariani Luiz Guilherme Justi Luvizotto Leandro dos Santos Coelho 《Applied mathematics and computation》2011,217(12):5822-5829
Numerous optimization methods have been proposed for the solution of the unconstrained optimization problems, such as mathematical programming methods, stochastic global optimization approaches, and metaheuristics. In this paper, a metaheuristic algorithm called Modified Shuffled Complex Evolution (MSCE) is proposed, where an adaptation of the Downhill Simplex search strategy combined with the differential evolution method is proposed. The efficiency of the new method is analyzed in terms of the mean performance and computational time, in comparison with the genetic algorithm using floating-point representation (GAF) and the classical shuffled complex evolution (SCE-UA) algorithm using six benchmark optimization functions. Simulation results and the comparisons with SCE-UA and GAF indicate that the MSCE improves the search performance on the five benchmark functions of six tested functions. 相似文献
92.
The Markov-Bernstein inequalities for generalized Gegenbauer weight are studied. A special basis of the vector space Pn of real polynomials in one variable of degree at most equal to n is proposed. It is produced by quasi-orthogonal polynomials with respect to this generalized Gegenbauer measure. Thanks to this basis the problem to find the Markov-Bernstein constant is separated in two eigenvalue problems. The first has a classical form and we are able to give lower and upper bounds of the Markov-Bernstein constant by using the Newton method and the classical qd algorithm applied to a sequence of orthogonal polynomials. The second is a generalized eigenvalue problem with a five diagonal matrix and a tridiagonal matrix. A lower bound is obtained by using the Newton method applied to the six term recurrence relation produced by the expansion of the characteristic determinant. The asymptotic behavior of an upper bound is studied. Finally, the asymptotic behavior of the Markov-Bernstein constant is O(n2) in both cases. 相似文献
93.
Cost-sensitive classification is based on a set of weights defining the expected cost of misclassifying an object. In this paper, a Genetic Fuzzy Classifier, which is able to extract fuzzy rules from interval or fuzzy valued data, is extended to this type of classification. This extension consists in enclosing the estimation of the expected misclassification risk of a classifier, when assessed on low quality data, in an interval or a fuzzy number. A cooperative-competitive genetic algorithm searches for the knowledge base whose fitness is primal with respect to a precedence relation between the values of this interval or fuzzy valued risk. In addition to this, the numerical estimation of this risk depends on the entrywise product of cost and confusion matrices. These have been, in turn, generalized to vague data. The flexible assignment of values to the cost function is also tackled, owing to the fact that the use of linguistic terms in the definition of the misclassification cost is allowed. 相似文献
94.
In this paper, a permutation-based genetic algorithm (GA) is applied to the NP-hard problem of arranging a number of facilities on a line with minimum cost, known as the single row facility layout problem (SRFLP). The GA individuals are obtained by using some rule-based as well as random permutations of the facilities, which are then improved towards the optimum by means of specially designed crossover and mutation operators. Such schemes led the GA to handle the SRFLP as an unconstrained optimization problem. In the computational experiments carried out with large-size instances of sizes from 60 to 80, available in the literature, the proposed GA improved several previously known best solutions. 相似文献
95.
96.
This paper addresses a novel approach to deal with Flexible task Time Assembly Line Balancing Problem (FTALBP). In this regard, machines are considered in which operation time of each task can be between lower and upper bounds. These machines can compress the processing time of tasks, but this action may lead to higher cost due to cumulative wear, erosion, fatigue and so on. This cost is described in terms of task time via a linear function. Hence, a bi-criteria nonlinear integer programming model is developed which comprises two inconsistent objective functions: minimizing the cycle time and minimizing the machine total costs. In order to sustain these objectives concurrently, this paper applies the LP-metric method to make a combined dimensionless objective. Moreover, a genetic algorithm (GA) is presented to solve this NP-hard problem and design of experiments (DOE) method is hired to tune various parameters of our proposed algorithm. The computational results demonstrate the effectiveness of implemented procedures. 相似文献
97.
Marielle Christiansen Kjetil Fagerholt Truls Flatberg Øyvind Haugen Oddvar Kloster Erik H. Lund 《European Journal of Operational Research》2011
This paper considers a maritime inventory routing problem faced by a major cement producer. A heterogeneous fleet of bulk ships transport multiple non-mixable cement products from producing factories to regional silo stations along the coast of Norway. Inventory constraints are present both at the factories and the silos, and there are upper and lower limits for all inventories. The ship fleet capacity is limited, and in peak periods the demand for cement products at the silos exceeds the fleet capacity. In addition, constraints regarding the capacity of the ships’ cargo holds, the depth of the ports and the fact that different cement products cannot be mixed must be taken into consideration. A construction heuristic embedded in a genetic algorithmic framework is developed. The approach adopted is used to solve real instances of the problem within reasonable solution time and with good quality solutions. 相似文献
98.
Yoshitsugu Yamamoto 《Mathematical Programming》1984,30(3):301-312
A variable dimension algorithm with integer labelling is proposed for solving systems ofn equations inn variables. The algorithm is an integer labelling version of the 2-ray algorithm proposed by the author. The orientation of
lower dimensional simplices is studied and is shown to be preserved along a sequence of adjacent simplices. 相似文献
99.
The pivot and probe algorithm for solving a linear program 总被引:1,自引:0,他引:1
In [7] we defined acandidate constraint as one which, for at least one pivot step, contains a potential pivot, discovered that most constraints are never candidate,
and devised a modification of the simplex method in which only constraints which are currently candidates are updated. In
this paper we present another way to take advantage of this fact. We begin by solving a relaxed linear program consisting
of the constraints of the original problem which are initially candidates. Its solution gives an upper bound to the value
of the original problem. We also introduce the idea of a probe, that is, a line segment joining two vectors for the primal
problem, one of which is primal feasible, and use it to identify a most violated constraint; at the same time this gives a
lower bound to the objective value of the original problem. This violated constraint is added to the relaxed problem which
is solved again, which gives a new upper bound etc. We present computational experience indicating that time savings of 50–80%
over the simplex method can be obtained by this method, which we call PAPA, the Pivot and Probe Algorithm.
This report was prepared as part of the activities of the Management Science Research Group, Carnegie-Mellon University, under
Contract No. N00014-75-C-0621 NR 047-048 with the U.S. Office of Naval Research. Reproduction in whole or part is permitted
for any purpose of the U.S. Government. 相似文献
100.
Rüdiger Schultz Leen Stougie Maarten H. van der Vlerk 《Mathematical Programming》1998,83(1-3):229-252
In this paper we present a framework for solving stochastic programs with complete integer recourse and discretely distributed right-hand side vector, using Gröbner basis methods from computational algebra to solve the numerous second-stage integer programs. Using structural properties of the expected integer recourse function, we prove that under mild conditions an optimal solution is contained in a finite set. Furthermore, we present a basic scheme to enumerate this set and suggest improvements to reduce the number of function evaluations needed. 相似文献