全文获取类型
收费全文 | 1756篇 |
免费 | 696篇 |
国内免费 | 131篇 |
出版年
2024年 | 9篇 |
2023年 | 14篇 |
2022年 | 25篇 |
2021年 | 45篇 |
2020年 | 39篇 |
2019年 | 42篇 |
2018年 | 28篇 |
2017年 | 107篇 |
2016年 | 95篇 |
2015年 | 76篇 |
2014年 | 130篇 |
2013年 | 165篇 |
2012年 | 200篇 |
2011年 | 198篇 |
2010年 | 107篇 |
2009年 | 107篇 |
2008年 | 94篇 |
2007年 | 142篇 |
2006年 | 137篇 |
2005年 | 127篇 |
2004年 | 116篇 |
2003年 | 85篇 |
2002年 | 60篇 |
2001年 | 74篇 |
2000年 | 72篇 |
1999年 | 55篇 |
1998年 | 33篇 |
1997年 | 39篇 |
1996年 | 27篇 |
1995年 | 15篇 |
1994年 | 22篇 |
1993年 | 18篇 |
1992年 | 28篇 |
1991年 | 19篇 |
1990年 | 20篇 |
1989年 | 10篇 |
1988年 | 2篇 |
1987年 | 1篇 |
排序方式: 共有2583条查询结果,搜索用时 250 毫秒
61.
陈东青 《军械工程学院学报》1999,(1)
设Z是一致光滑Banach空间,T:X→X是次连续强增生算子,{an}、{βn}是两个实数列且满足0≤an≤1,及an→0(n→∞),令Mann迭代序列{Xn}定义为证明了迭代序列{xn}强收敛于S的不动点q的充要条件是||Txn||有界。 相似文献
62.
刘丽梅 《军械工程学院学报》1999,(3)
引入“DC”空间的概念,研究了带紧扰动的m-增生算子的满值性问题,改进了Kartsatos、Deimling、周海云以及徐宗本等人的结果。 相似文献
63.
64.
采用图染色方法解决通量累加和局部最大压力计算引起的两种典型资源竞争问题,并通过共享内存的使用、体编号和面编号的重排、面数据的重排三种策略优化图染色方法。针对应用在空气动力学多种规模的三维网格,分别采用双精度和单精度操作数,在Nvidia Tesla V100和K80 GPU上,展开性能测试。结果表明:共享内存的优化效果不明显;体编号和面编号重排降低了图染色方法的计算性能;面数据重排可以有效地优化图染色方法;计算性能在V100上提高20%左右,在K80上提高15%左右。 相似文献
65.
66.
The problem of minimum makespan on an m machine jobshop with unit execution time (UET) jobs (m ≥ 3) is known to be strongly NP‐hard even with no setup times. We focus in this article on the two‐machine case. We assume UET jobs and consider batching with batch availability and machine‐dependent setup times. We introduce an efficient \begin{align*}(O(\sqrt{n}))\end{align*} algorithm, where n is the number of jobs. We then introduce a heuristic for the multimachine case and demonstrate its efficiency for two interesting instances. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011 相似文献
67.
We study a stochastic inventory model of a firm that periodically orders a product from a make‐to‐order manufacturer. Orders can be shipped by a combination of two freight modes that differ in lead‐times and costs, although orders are not allowed to cross. Placing an order as well as each use of each freight mode has a fixed and a quantity proportional cost. The decision of how to allocate units between the two freight modes utilizes information about demand during the completion of manufacturing. We derive the optimal freight mode allocation policy, and show that the optimal policy for placing orders is not an (s,S) policy in general. We provide tight bounds for the optimal policy that can be calculated by solving single period problems. Our analysis enables insights into the structure of the optimal policy specifying the conditions under which it simplifies to an (s,S) policy. We characterize the best (s,S) policy for our model, and through extensive numerical investigation show that its performance is comparable with the optimal policy in most cases. Our numerical study also sheds light on the benefits of the dual freight model over the single freight models. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011 相似文献
68.
69.
In many practical multiserver queueing systems, servers not only serve randomly arriving customers but also work on the secondary jobs with infinite backlog during their idle time. In this paper, we propose a c‐server model with a two‐threshold policy, denoted by (e d), to evaluate the performance of this class of systems. With such a policy, when the number of idle servers has reached d (<c), then e (<d) idle agents will process secondary jobs. These e servers keep working on the secondary jobs until they find waiting customers exist in the system at a secondary job completion instant. Using the matrix analytic method, we obtain the stationary performance measures for evaluating different (e, d) policies. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2007. 相似文献
70.