全文获取类型
收费全文 | 3097篇 |
免费 | 286篇 |
国内免费 | 76篇 |
专业分类
化学 | 292篇 |
晶体学 | 3篇 |
力学 | 49篇 |
综合类 | 38篇 |
数学 | 1426篇 |
物理学 | 235篇 |
无线电 | 1416篇 |
出版年
2024年 | 3篇 |
2023年 | 26篇 |
2022年 | 72篇 |
2021年 | 90篇 |
2020年 | 80篇 |
2019年 | 66篇 |
2018年 | 64篇 |
2017年 | 88篇 |
2016年 | 106篇 |
2015年 | 104篇 |
2014年 | 261篇 |
2013年 | 260篇 |
2012年 | 196篇 |
2011年 | 207篇 |
2010年 | 144篇 |
2009年 | 169篇 |
2008年 | 223篇 |
2007年 | 203篇 |
2006年 | 133篇 |
2005年 | 143篇 |
2004年 | 129篇 |
2003年 | 88篇 |
2002年 | 75篇 |
2001年 | 87篇 |
2000年 | 81篇 |
1999年 | 69篇 |
1998年 | 46篇 |
1997年 | 42篇 |
1996年 | 38篇 |
1995年 | 27篇 |
1994年 | 19篇 |
1993年 | 25篇 |
1992年 | 15篇 |
1991年 | 9篇 |
1990年 | 6篇 |
1989年 | 5篇 |
1988年 | 10篇 |
1987年 | 4篇 |
1986年 | 5篇 |
1985年 | 8篇 |
1984年 | 6篇 |
1983年 | 3篇 |
1982年 | 2篇 |
1981年 | 4篇 |
1979年 | 3篇 |
1977年 | 7篇 |
1976年 | 3篇 |
1975年 | 1篇 |
1973年 | 1篇 |
1959年 | 1篇 |
排序方式: 共有3459条查询结果,搜索用时 0 毫秒
1.
2.
3.
Efficient multicast search under delay and bandwidth constraints 总被引:1,自引:0,他引:1
The issue of a multicast search for a group of users is discussed in this study. Given the condition that the search is over
only after all the users in the group are found, this problem is called the Conference Call Search (CCS) problem. The goal
is to design efficient CCS strategies under delay and bandwidth constraints. While the problem of tracking a single user has
been addressed by many studies, to the best of our knowledge, this study is one of the first attempts to reduce the search
cost for multiple users. Moreover, as oppose to the single user tracking, for which one can always reduce the expected search
delay by increasing the expected search cost, for a multicast search the dependency between the delay and the search cost
is more complicated, as demonstrated in this study. We identify the key factors affecting the search efficiency, and the dependency
between them and the search delay. Our analysis shows that under tight bandwidth constraints, the CCS problem is NP-hard.
We therefore propose a search method that is not optimal, but has a low computational complexity. In addition, the proposed
strategy yields a low search delay as well as a low search cost. The performance of the proposed search strategy is superior
to the implementation of an optimal single user search on a group of users.
Amotz Bar-Noy received the B.Sc. degree in 1981 in Mathematics and Computer Science and the Ph.D. degree in 1987 in Computer Science, both
from the Hebrew University, Israel. From October 1987 to September 1989 he was a post-doc fellow in Stanford University, California.
From October 1989 to August 1996 he was a Research Staff Member with IBM T. J. Watson Research Center, New York. From February
1995 to September 2001 he was an associate Professor with the Electrical Engineering-Systems department of Tel Aviv University,
Israel. From September 1999 to December 2001 he was with AT research labs in New Jersey. Since February 2002 he is a Professor
with the Computer and Information Science Department of Brooklyn College - CUNY, Brooklyn New York.
Zohar Naor received the Ph.D. degree in Computer Science from Tel Aviv University, Tel Aviv, Israel, in 2000. Since 2003 he is with
the University of Haifa, Israel. His areas of interests include wireless networks, resource management of computer networks,
mobility, search strategies, and multiple access protocols. 相似文献
4.
We describe a new algorithm which uses the trajectories of a discrete dynamical system to sample the domain of an unconstrained objective function in search of global minima. The algorithm is unusually adept at avoiding nonoptimal local minima and successfully converging to a global minimum. Trajectories generated by the algorithm for objective functions with many local minima exhibit chaotic behavior, in the sense that they are extremely sensitive to changes in initial conditions and system parameters. In this context, chaos seems to have a beneficial effect: failure to converge to a global minimum from a given initial point can often be rectified by making arbitrarily small changes in the system parameters. 相似文献
5.
近年来,决定椭圆型方程系数反问题在地磁、地球物理、冶金和生物等实际问题上有着广泛的应用.本文讨论了二维的决定椭圆型方程系数反问题的数值求解方法.由误差平方和最小原则,这个反问题可化为一个变分问题,并进一步离散化为一个最优化问题,其目标函数依赖于要决定的方程系数.本文着重考察非线性共轭梯度法在此最优化问题数值计算中的表现,并与拟牛顿法作为对比.为了提高算法的效率我们适当选择加快收敛速度的预处理矩阵.同时还考察了线搜索方法的不同对优化算法的影响.数值实验的结果表明,非线性共轭梯度法在这类大规模优化问题中相对于拟牛顿法更有效. 相似文献
6.
Searching in trees 总被引:1,自引:0,他引:1
Frank Recker 《Discrete Applied Mathematics》2004,140(1-3):169-183
In (Discrete Math. 17 (1977)181) Rivest introduced the search complexity of binary trees and proved that among all binary trees with a fixed search complexity the smallest ones are the so-called Fibonacci trees. This result is extended for q-trees. The structure of the smallest q-trees is again Fibonacci-like but more complicated than in the binary case. In addition an upper bound for the asymptotic growth of these trees is given. 相似文献
7.
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. 相似文献
8.
We consider the generalization of the classical P||Cmax problem (assign n jobs to m identical parallel processors by minimizing the makespan) arising when the number of jobs that can be assigned to each processor cannot exceed a given integer k. The problem is strongly NP-hard for any fixed k > 2. We briefly survey lower and upper bounds from the literature. We introduce greedy heuristics, local search and a scatter search approach. The effectiveness of these approaches is evaluated through extensive computational comparison with a depth-first branch-and-bound algorithm that includes new lower bounds and dominance criteria. 相似文献
9.
In this work, the NP-hard maximum clique problem on graphs is considered. Starting from basic greedy heuristics, modifications and improvements are proposed and combined in a two-phase heuristic procedure. In the first phase an improved greedy procedure is applied starting from each node of the graph; on the basis of the results of this phase a reduced subset of nodes is selected and an adaptive greedy algorithm is repeatedly started to build cliques around such nodes. In each restart the selection of nodes is biased by the maximal clique generated in the previous execution. Computational results are reported on the DIMACS benchmarks suite. Remarkably, the two-phase procedure successfully solves the difficult Brockington-Culberson instances, and is generally competitive with state-of-the-art much more complex heuristics. 相似文献
10.
C. Bogani M. G. Gasparo A. Papini 《Journal of Optimization Theory and Applications》2007,134(1):47-59
We propose a pattern search method to solve a classical nonsmooth optimization problem. In a deep analogy with pattern search
methods for linear constrained optimization, the set of search directions at each iteration is defined in such a way that
it conforms to the local geometry of the set of points of nondifferentiability near the current iterate. This is crucial to
ensure convergence. The approach presented here can be extended to wider classes of nonsmooth optimization problems. Numerical
experiments seem to be encouraging.
This work was supported by M.U.R.S.T., Rome, Italy. 相似文献