全文获取类型
收费全文 | 16246篇 |
免费 | 2285篇 |
国内免费 | 623篇 |
专业分类
化学 | 1120篇 |
晶体学 | 88篇 |
力学 | 3722篇 |
综合类 | 419篇 |
数学 | 7436篇 |
物理学 | 6369篇 |
出版年
2024年 | 22篇 |
2023年 | 139篇 |
2022年 | 340篇 |
2021年 | 436篇 |
2020年 | 396篇 |
2019年 | 353篇 |
2018年 | 385篇 |
2017年 | 578篇 |
2016年 | 678篇 |
2015年 | 494篇 |
2014年 | 858篇 |
2013年 | 1053篇 |
2012年 | 868篇 |
2011年 | 998篇 |
2010年 | 788篇 |
2009年 | 1018篇 |
2008年 | 1035篇 |
2007年 | 1114篇 |
2006年 | 1020篇 |
2005年 | 865篇 |
2004年 | 714篇 |
2003年 | 665篇 |
2002年 | 613篇 |
2001年 | 542篇 |
2000年 | 479篇 |
1999年 | 420篇 |
1998年 | 368篇 |
1997年 | 321篇 |
1996年 | 273篇 |
1995年 | 225篇 |
1994年 | 162篇 |
1993年 | 148篇 |
1992年 | 134篇 |
1991年 | 91篇 |
1990年 | 97篇 |
1989年 | 49篇 |
1988年 | 49篇 |
1987年 | 50篇 |
1986年 | 51篇 |
1985年 | 54篇 |
1984年 | 48篇 |
1983年 | 18篇 |
1982年 | 34篇 |
1981年 | 12篇 |
1980年 | 13篇 |
1979年 | 13篇 |
1978年 | 16篇 |
1977年 | 14篇 |
1976年 | 15篇 |
1957年 | 7篇 |
排序方式: 共有10000条查询结果,搜索用时 62 毫秒
991.
《Applied Mathematical Modelling》2014,38(7-8):2000-2014
Real engineering design problems are generally characterized by the presence of many often conflicting and incommensurable objectives. Naturally, these objectives involve many parameters whose possible values may be assigned by the experts. The aim of this paper is to introduce a hybrid approach combining three optimization techniques, dynamic programming (DP), genetic algorithms and particle swarm optimization (PSO). Our approach integrates the merits of both DP and artificial optimization techniques and it has two characteristic features. Firstly, the proposed algorithm converts fuzzy multiobjective optimization problem to a sequence of a crisp nonlinear programming problems. Secondly, the proposed algorithm uses H-SOA for solving nonlinear programming problem. In which, any complex problem under certain structure can be solved and there is no need for the existence of some properties rather than traditional methods that need some features of the problem such as differentiability and continuity. Finally, with different degree of α we get different α-Pareto optimal solution of the problem. A numerical example is given to illustrate the results developed in this paper. 相似文献
992.
《Applied Mathematical Modelling》2014,38(15-16):3975-3986
This paper addresses a certain type of scheduling problem that arises when a parallel computation is to be executed on a set of identical parallel processors. It is assumed that if two precedence-related tasks are processed on two different processors, due to the information transferring, there will be a task-dependent communication delay between them. For each task, a processing time, a due date and a weight is given while the goal is to minimize the total weighted late work. An integer linear mathematical programming model and a branch-and-bound algorithm have been developed for the proposed problem. Comparing the results obtained by the proposed branch-and-bound algorithm with those obtained by CPLEX, indicates the effectiveness of the method. 相似文献
993.
In this paper, we consider the discrete optimization via simulation problem with a single stochastic constraint. We present two genetic-algorithm-based algorithms that adopt different sampling rules and searching mechanisms, and thus deliver different statistical guarantees. The first algorithm offers global convergence as the simulation effort goes to infinity. However, the algorithm’s finite-time efficiency may be sacrificed to maintain this theoretically appealing property. We therefore propose the second heuristic algorithm that can take advantage of the desirable mechanics of genetic algorithm, and might be better able to find near-optimal solutions in a reasonable amount of time. Empirical studies are performed to compare the efficiency of the proposed algorithms with other existing ones. 相似文献
994.
We consider project scheduling where the project manager’s objective is to minimize the time from when an adversary discovers the project until the completion of the project. We analyze the complexity of the problem identifying both polynomially solvable and NP-hard versions of the problem. The complexity of the problem is seen to be dependent on the nature of renewable resource constraints, precedence constraints, and the ability to crash activities in the project. 相似文献
995.
This paper proposes a novel extended traffic network model to solve the logit-based stochastic user equilibrium (SUE) problem with elastic demand. In this model, an extended traffic network is established by properly adding dummy nodes and links to the original traffic network. Based on the extended traffic network, the logit-based SUE problem with elastic demand is transformed to the SUE problem with fixed demand. Such problem is then further converted to a linearly constrained convex programming and addressed by a predictor–corrector interior point algorithm with polynomial complexity. A numerical example is provided to compare the proposed model with the method of successive averages (MSA). The numerical results indicate that the proposed model is more efficient and has a better convergence than the MSA. 相似文献
996.
We study the numerical radius of Lipschitz operators on Banach spaces via the Lipschitz numerical index, which is an analogue of the numerical index in Banach space theory. We give a characterization of the numerical radius and obtain a necessary and sufficient condition for Banach spaces to have Lipschitz numerical index 1. As an application, we show that real lush spaces and C -rich subspaces have Lipschitz numerical index 1. Moreover, using the Gâteaux differentiability of Lipschitz operators, we characterize the Lipschitz numerical index of separable Banach spaces with the RNP. Finally, we prove that the Lipschitz numerical index has the stability properties for the c0-, l1-, and l∞-sums of spaces and vector-valued function spaces. From this, we show that the C(K) spaces, L1(μ)-spaces and L∞(ν)-spaces have Lipschitz numerical index 1. 相似文献
997.
998.
《Operations Research Letters》2014,42(3):222-225
We discuss approximability and inapproximability in FPT-time for a large class of subset problems where a feasible solution is a subset of the input data. We introduce the notion of intersective approximability that generalizes the one of safe approximability introduced in Guo et al. (2011) and show strong parameterized inapproximability results for many of the subset problems handled. 相似文献
999.
《Operations Research Letters》2014,42(5):319-324
We consider the assortment optimization problem under the classical two-level nested logit model. We establish a necessary and sufficient condition for the optimal assortment and develop a simple and fast greedy algorithm that iteratively removes at most one product from each nest to compute an optimal solution. 相似文献
1000.
We combine two important recent advancements of MCMC algorithms: first, methods utilizing the intrinsic manifold structure of the parameter space; then, algorithms effective for targets in infinite-dimensions with the critical property that their mixing time is robust to mesh refinement. 相似文献