全文获取类型
收费全文 | 4549篇 |
免费 | 695篇 |
国内免费 | 105篇 |
专业分类
化学 | 300篇 |
晶体学 | 3篇 |
力学 | 333篇 |
综合类 | 89篇 |
数学 | 754篇 |
物理学 | 1065篇 |
无线电 | 2805篇 |
出版年
2024年 | 16篇 |
2023年 | 67篇 |
2022年 | 106篇 |
2021年 | 126篇 |
2020年 | 140篇 |
2019年 | 95篇 |
2018年 | 105篇 |
2017年 | 190篇 |
2016年 | 177篇 |
2015年 | 213篇 |
2014年 | 335篇 |
2013年 | 285篇 |
2012年 | 340篇 |
2011年 | 326篇 |
2010年 | 214篇 |
2009年 | 219篇 |
2008年 | 263篇 |
2007年 | 269篇 |
2006年 | 245篇 |
2005年 | 241篇 |
2004年 | 211篇 |
2003年 | 208篇 |
2002年 | 139篇 |
2001年 | 124篇 |
2000年 | 91篇 |
1999年 | 96篇 |
1998年 | 93篇 |
1997年 | 86篇 |
1996年 | 57篇 |
1995年 | 58篇 |
1994年 | 41篇 |
1993年 | 46篇 |
1992年 | 42篇 |
1991年 | 17篇 |
1990年 | 7篇 |
1989年 | 11篇 |
1988年 | 16篇 |
1987年 | 5篇 |
1986年 | 4篇 |
1985年 | 7篇 |
1984年 | 11篇 |
1983年 | 1篇 |
1982年 | 2篇 |
1981年 | 1篇 |
1980年 | 2篇 |
1979年 | 1篇 |
排序方式: 共有5349条查询结果,搜索用时 24 毫秒
31.
In this paper, we introduce a new concept of semi-preemptive scheduling and we show how it can be used to derive a maximum-flow-based lower bound for the P|rj|Lmax which dominates the well-known preemptive lower bound. We show that, in some cases, the proposed bound strictly dominates the preemptive one while having the same complexity. 相似文献
32.
Mixed integer programming (MIP) models are extensively usedto aid strategic and tactical decision making in many businesssectors. Solving MIP models is a computationally intensive processand there is a need to develop solution approaches that enablelarger models to be solved within acceptable timeframes. Inthis paper, we describe the implementation of a two-stage parallelbranch and bound (PB & B) algorithm for MIP. In stage 1of the algorithm, a multiple heuristic search is implementedin which a number of alternative search trees are investigatedusing a forest search in the hope of finding a good solutionquickly. In stage 2, the search is reorganized so that the branchesof a chosen tree are investigated in parallel. A new heuristicis introduced, based on a best projection criterion, which evaluatesalternative B & B trees in order to choose one for investigationin stage 2 of the algorithm. The heuristic also serves as away of implementing a quality load balancing scheme for stage2 of the algorithm. The results of experimental investigationsare reported for a range of models taken from the MIPLIB libraryof benchmark problems. 相似文献
33.
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. 相似文献
34.
关于非平行板电容器电容计算的讨论 总被引:4,自引:3,他引:1
用串联方法计算非平行板电容器的电容,简便地得到与其他方法相同的结果。 相似文献
35.
Due to interference, path loss, multipath fading, background noise, and many other factors, wireless communication normally
cannot provide a wireless link with both a high data rate and a long transmission range. To address this problem, striping
network traffic in parallel over multiple lower-data-rate but longer-transmission-range wireless channels may be used. In
this paper, we propose a new striping method and evaluate its performances over multiple IEEE 802.11(b) channels under various
conditions. Our extensive simulation results show that this method is quite effective for such an application.
S.Y. Wang is an Associate Professor of the Department of Computer Science and Information Engineering at National Chiao Tung University,
Taiwan. He received his Master and Ph.D. degree in computer science from Harvard University in 1997 and 1999, respectively.
His research interests include wireless networks, Internet technologies, network simulations, and operating systems. He is
the author of the NCTUns 2.0 network simulator and emulator, which is being widely used by network and communication researchers.
More information about the tool is available at http://NSL.csie.nctu.edu.tw/nctuns.html.
C.H. Hwang received his master degree in computer science from NCTU in 2002 and currently is working for a network company.
C.L. Chou currently is a third-year Ph.D. student at the Department of Computer Science and Information Engineering, National Chiao
TungUniversity (NCTU), Taiwan. He received his master degree in computer science from NCTU in 2002. 相似文献
36.
37.
可编程光学二值双轨逻辑门 总被引:1,自引:0,他引:1
基于双轨逻辑,本文提出一种可级联的并行二值逻辑门。所有十六种二值逻辑运算可以采用偏振半波相延编程来实现。也提出了用电光晶体实现实时编程的方法。本文中给出了实验结果。 相似文献
38.
In this paper, we consider a queueing system in which there are two exponential servers, each having his own queue, and arriving
customers will join the shorter queue. Based on the results given in Flatto and McKean, we rewrite the formula for the probability
that there are exactlyk customers in each queue, wherek = 0, 1,…. This enables us to present an algorithm for computing these probabilities and then to find the joint distribution
of the queue lengths in the system. A program and numerical examples are given. 相似文献
39.
A parallel inexact Newton method with a line search is proposed for two-stage quadratic stochastic programs with recourse. A lattice rule is used for the numerical evaluation of multi-dimensional integrals, and a parallel iterative method is used to solve the quadratic programming subproblems. Although the objective only has a locally Lipschitz gradient, global convergence and local superlinear convergence of the method are established. Furthermore, the method provides an error estimate which does not require much extra computation. The performance of the method is illustrated on a CM5 parallel computer.This work was supported by the Australian Research Council and the numerical experiments were done on the Sydney Regional Centre for Parallel Computing CM5. 相似文献
40.
Simulation at the gate level is computationally very expensive.Parallel processing is one technique to reduce simulation time.Possessing knowledge of the distribution of computational activity insimulation can aid in parallelizing it efficiently. We present a newcharacterization of the distribution of the computational workload infault simulation. An empirical analysis shows that the workloaddistribution is circuit specific, and is largely independent of thevector set being simulated. An inexpensive method to predict theworkload distribution is also discussed. 相似文献