全文获取类型
收费全文 | 4674篇 |
免费 | 526篇 |
国内免费 | 142篇 |
专业分类
化学 | 174篇 |
力学 | 38篇 |
综合类 | 80篇 |
数学 | 2799篇 |
物理学 | 329篇 |
无线电 | 1922篇 |
出版年
2024年 | 7篇 |
2023年 | 41篇 |
2022年 | 131篇 |
2021年 | 144篇 |
2020年 | 136篇 |
2019年 | 127篇 |
2018年 | 114篇 |
2017年 | 163篇 |
2016年 | 166篇 |
2015年 | 150篇 |
2014年 | 326篇 |
2013年 | 327篇 |
2012年 | 293篇 |
2011年 | 272篇 |
2010年 | 250篇 |
2009年 | 291篇 |
2008年 | 288篇 |
2007年 | 345篇 |
2006年 | 243篇 |
2005年 | 198篇 |
2004年 | 192篇 |
2003年 | 167篇 |
2002年 | 141篇 |
2001年 | 130篇 |
2000年 | 91篇 |
1999年 | 82篇 |
1998年 | 71篇 |
1997年 | 46篇 |
1996年 | 67篇 |
1995年 | 41篇 |
1994年 | 42篇 |
1993年 | 20篇 |
1992年 | 21篇 |
1991年 | 24篇 |
1990年 | 15篇 |
1989年 | 14篇 |
1988年 | 17篇 |
1987年 | 9篇 |
1986年 | 15篇 |
1985年 | 27篇 |
1984年 | 24篇 |
1983年 | 8篇 |
1982年 | 19篇 |
1981年 | 9篇 |
1980年 | 12篇 |
1979年 | 5篇 |
1978年 | 5篇 |
1977年 | 7篇 |
1976年 | 3篇 |
1957年 | 1篇 |
排序方式: 共有5342条查询结果,搜索用时 15 毫秒
21.
22.
23.
24.
One of the most ignored, but urgent and vital challenges confronting society today is the vulnerability of urban areas to extreme events. Current organization of response systems, predominantly based on a command and control model, limits their effectiveness and efficiency. Particularly, in decision‐making processes where a large number of actors may be involved. In this article, a new distributed collaborative decision‐making model is proposed to overcome command and control limitations encountered in stressful, hostile, chaotic, and large‐scale settings. This model was derived by borrowing concepts from the collective decision making of honeybees foraging, a successful process in solving complex tasks within complex settings. The model introduced in this article was evaluated through differential equations, i.e., continuous analysis, and difference equations, i.e., discrete analysis. The most important result found is that the best available option in any large‐scale decision‐making problem can be configured as an attractor, in a distributed and timely manner. We suggest that the proposed model has the potential to facilitate decision‐making processes in large‐scale settings. © 2005 Wiley Periodicals, Inc. Complexity 11:28–38, 2005 相似文献
25.
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. 相似文献
26.
The control of piecewise-deterministic processes is studied where only local boundedness of the data is assumed. Moreover the discount rate may be zero. The value function is shown to be solution to the Bellman equation in a weak sense; however the solution concept is strong enough to generate optimal policies. Continuity and compactness conditions are given for the existence of nonrelaxed optimal feedback controls. 相似文献
27.
We present an O(min(Kn,n2)) algorithm to solve the maximum integral multiflow and minimum multicut problems in rooted trees, where K is the number of commodities and n is the number of vertices. These problems are NP-hard in undirected trees but polynomial in directed trees. In the algorithm we propose, we first use a greedy procedure to build the multiflow then we use duality properties to obtain the multicut and prove the optimality. 相似文献
28.
In this paper, we study the stability conditions of the MMAP[K]/G[K]/1/LCFS preemptive repeat queue. We introduce an embedded Markov chain of matrix M/G/1 type with a tree structure and identify conditions for the Markov chain to be ergodic. First, we present three conventional methods for the stability problem of the queueing system of interest. These methods are either computationally demanding or do not provide accurate information for system stability. Then we introduce a novel approach that develops two linear programs whose solutions provide sufficient conditions for stability or instability of the queueing system. The new approach is numerically efficient. The advantages and disadvantages of the methods introduced in this paper are analyzed both theoretically and numerically. 相似文献
29.
30.