全文获取类型
收费全文 | 3683篇 |
免费 | 227篇 |
国内免费 | 89篇 |
专业分类
化学 | 264篇 |
晶体学 | 3篇 |
力学 | 149篇 |
综合类 | 27篇 |
数学 | 2189篇 |
物理学 | 376篇 |
无线电 | 991篇 |
出版年
2024年 | 4篇 |
2023年 | 44篇 |
2022年 | 52篇 |
2021年 | 59篇 |
2020年 | 63篇 |
2019年 | 47篇 |
2018年 | 37篇 |
2017年 | 49篇 |
2016年 | 73篇 |
2015年 | 70篇 |
2014年 | 136篇 |
2013年 | 173篇 |
2012年 | 149篇 |
2011年 | 164篇 |
2010年 | 164篇 |
2009年 | 233篇 |
2008年 | 277篇 |
2007年 | 330篇 |
2006年 | 244篇 |
2005年 | 195篇 |
2004年 | 173篇 |
2003年 | 166篇 |
2002年 | 146篇 |
2001年 | 113篇 |
2000年 | 96篇 |
1999年 | 90篇 |
1998年 | 99篇 |
1997年 | 68篇 |
1996年 | 70篇 |
1995年 | 47篇 |
1994年 | 51篇 |
1993年 | 45篇 |
1992年 | 33篇 |
1991年 | 27篇 |
1990年 | 20篇 |
1989年 | 18篇 |
1988年 | 26篇 |
1987年 | 13篇 |
1986年 | 18篇 |
1985年 | 19篇 |
1984年 | 23篇 |
1983年 | 7篇 |
1982年 | 12篇 |
1981年 | 8篇 |
1980年 | 9篇 |
1979年 | 10篇 |
1978年 | 11篇 |
1977年 | 8篇 |
1976年 | 6篇 |
1975年 | 2篇 |
排序方式: 共有3999条查询结果,搜索用时 859 毫秒
11.
12.
The problem of finding the Euclidean distance between two convex polyhedra can be reduced to the combinatorial optimization problem of finding the minimum distance between their faces. This paper presents a global optimality criterion for this problem. An algorithm (QLDPA) for the fast computation of the distance between convex and bounded polyhedra is proposed as an application of it. Computer experiments show its fast performance, especially when the total number of vertices is large. 相似文献
13.
A new approach to the robust handling of non‐linear constraints for GAs (genetic algorithms) optimization is proposed. A specific feature of the approach consists of the change in the conventional search strategy by employing search paths which pass through both feasible and infeasible points (contrary to the traditional approach where only feasible points may be included in a path). The method (driven by full Navier–Stokes computations) was applied to the problem of multiobjective optimization of aerodynamic shapes subject to various geometrical and aerodynamic constraints. The results demonstrated that the method retains high robustness of conventional GAs while keeping CFD computational volume to an acceptable level, which allowed the algorithm to be used in a demanding engineering environment. Copyright © 2004 John Wiley & Sons, Ltd. 相似文献
14.
We give a Gray code and constant average time generating algorithm for derangements, i.e., permutations with no fixed points. In our Gray code, each derangement is transformed into its successor either via one or two transpositions or a rotation of three elements. We generalize these results to permutations with number of fixed points bounded between two constants. 相似文献
15.
We deal with MAXH0-FREE PARTIAL SUBGRAPH. We mainly prove that 3-locally optimum solutions achieve approximation ratio (δ0+1)/(B+2+ν0), where B=maxv∈VdG(v), δ0=minv∈V(H0)dH0(v) and ν0=(|V(H0)|+1)/δ0. Next, we show that this ratio rises up to 3/(B+1) when H0=K3. Finally, we provide hardness results for MAXK3-FREE PARTIAL SUBGRAPH. 相似文献
16.
A server needs to compute a broadcast schedule for n pages whose request times are known in advance. Outputting a page satisfies all outstanding requests for the page. The goal is to minimize the average waiting time of a client. In this paper, we show the equivalence of two apparently different relaxations that have been considered for this problem. 相似文献
17.
Asaf Levin 《Operations Research Letters》2004,32(6):530-534
Consider the following problem: given a ground set and two minimization objectives of the same type find a subset from a given subset-class that minimizes the first objective subject to a budget constraint on the second objective. Using Megiddo's parametric method we improve an earlier weakly polynomial time algorithm. 相似文献
18.
This paper presents a unified analysis of decomposition algorithms for continuously differentiable optimization problems defined on Cartesian products of convex feasible sets. The decomposition algorithms are analyzed using the framework of cost approx imation algorithms. A convergence analysis is made for three decomposition algorithms: a sequential algorithm which extends the classical Gauss-Seidel scheme, a synchronized parallel algorithm which extends the Jacobi method, and a partially asynchronous parallel algorithm. The analysis validates inexact computations in both the subproblem and line search phases, and includes convergence rate results. The range of feasible step lengths within each algorithm is shown to have a direct correspondence to the increasing degree of parallelism and asynchronism, and the resulting usage of more outdated information in the algorithms. 相似文献
19.
We present a numerical implementation of the parallel gradient distribution (PGD) method for the solution of large-scale unconstrained optimization problems. The proposed parallel algorithm is characterized by a parallel phase which exploits the portions of the gradient of the objective function assigned to each processor; then, a coordination phase follows which, by a synchronous interaction scheme, optimizes over the partial results obtained by the parallel phase. The parallel and coordination phases are implemented using a quasi-Newton limited-memory BFGS approach. The computational experiments, carried out on a network of UNIX workstations by using the parallel software tool PVM, show that parallelization efficiency was problem dependent and ranged between 0.15 and 8.75. For the 150 problems solved by PGD on more than one processor, 85 cases had parallelization efficiency below 1, while 65 cases had a parallelization efficiency above 1. 相似文献
20.
A novel dynamic survivable routing in WDM optical networks with/without sparse wavelength conversion
Vinh Trong Le Xiaohong Jiang Son Hong Ngo Susumu Horiguchi Yasushi Inoguchi 《Optical Switching and Networking》2006,3(3-4):173-190
In this paper, we study the dynamic survivable routing problem, both in optical networks without wavelength conversion and in optical networks with sparse wavelength conversion, and propose a novel hybrid algorithm for it based on the combination of mobile agents technique and genetic algorithms (GA). By keeping a suitable number of mobile agents in the network to cooperatively explore the network states and continuously report cycles (that are formed by two disjoint-link routes) into the routing tables, our new hybrid algorithm can promptly determine the first population of cycles for a new request based on the routing table of its source node, without the time consuming process associated with current GA-based lightpath protection schemes. We further improve the performance of our algorithm by introducing a more advanced fitness function that is suitable for both the above networks. Extensive simulation studies on the ns-2 network simulator show that our hybrid algorithm achieves a significantly lower blocking probability than the conventional survivable routing algorithms for all the cases we studied. 相似文献