全文获取类型
收费全文 | 2539篇 |
免费 | 698篇 |
国内免费 | 103篇 |
出版年
2024年 | 7篇 |
2023年 | 8篇 |
2022年 | 40篇 |
2021年 | 112篇 |
2020年 | 56篇 |
2019年 | 20篇 |
2018年 | 21篇 |
2017年 | 54篇 |
2016年 | 23篇 |
2015年 | 97篇 |
2014年 | 135篇 |
2013年 | 136篇 |
2012年 | 115篇 |
2011年 | 137篇 |
2010年 | 175篇 |
2009年 | 215篇 |
2008年 | 167篇 |
2007年 | 178篇 |
2006年 | 97篇 |
2005年 | 99篇 |
2004年 | 47篇 |
2003年 | 28篇 |
2002年 | 31篇 |
2001年 | 55篇 |
2000年 | 82篇 |
1999年 | 206篇 |
1998年 | 163篇 |
1997年 | 143篇 |
1996年 | 115篇 |
1995年 | 102篇 |
1994年 | 94篇 |
1993年 | 66篇 |
1992年 | 69篇 |
1991年 | 66篇 |
1990年 | 66篇 |
1989年 | 31篇 |
1988年 | 13篇 |
1987年 | 17篇 |
1986年 | 16篇 |
1985年 | 11篇 |
1983年 | 16篇 |
1982年 | 9篇 |
1978年 | 1篇 |
1977年 | 1篇 |
排序方式: 共有3340条查询结果,搜索用时 15 毫秒
881.
针对无线移动通信网络的客观制约,给出了一种音频同步的基于视频连环画模式摘要自动生成的实用视频服务方案,使得系统在向用户提交连续音频流的同时,能够随着网络带宽条件的变化,按照动态采样频率,基于视频内容选择重要帧递送,并按照与音轨同步的模式播放,从而在降低数据量的同时,满足用户对视频内容综合理解的需求。 相似文献
882.
Rachel Q. Zhang 《海军后勤学研究》1999,46(6):671-688
This paper considers multi‐item inventory systems where a customer order may require several different items (i.e., demands are correlated across items) and customer satisfaction is measured by the time delays seen by the customers. Most inventory models on time delay in the literature assume each demand only requires one item (i.e., demands are not correlated across items or are independent). In this paper, we derive an exact expression for the expected total time delay. We show that when items are actually correlated, assuming items are independent leads to an overestimate of the total time delay. However, (1) it is extremely difficult in practice to obtain the demand information for all demand types (especially in a system with tens of thousands of part numbers), and (2) the problem becomes too complicated to be of practical interest when the correlation is considered. We then explore the possibility of including the demand information partially and develop bounds for the time delays. © 1999 John Wiley & Sons, Inc. Naval Research Logistics 46: 671–688, 1999 相似文献
883.
884.
In this paper, we consider approximations to discrete time Markov chains with countably infinite state spaces. We provide a simple, direct proof for the convergence of certain probabilistic quantities when one uses a northwest corner or a banded matrix approximation to the original probability transition matrix. © 1999 John Wiley & Sons, Inc. Naval Research Logistics 46: 187–197, 1999 相似文献
885.
In this paper we study the impact of cancellations of customer orders on an inventory system. We develop a periodic review (s, S) inventory model with Poisson demands, deterministic demand leadtimes and supply leadtimes. When no set up cost is present for replenishment, the behavior of the system cost can be studied analytically. For the case with a fixed set up cost, we derive the operating characteristics of the model via an embedded Markov chain analysis. Based on this, we formulate the total cost function and suggest a two‐phase approach to optimization. Our model can be used to compute cancellation fees and to evaluate the impacts of various conditions of cancellation. We find that cancellations, as major sources of inventory information distortion, increase total system costs, and the magnitude of the cost impact depends on the probability of cancellation and the expected cancellation time. Other relevant lessons and insights are also discussed. © 1999 John Wiley & Sons, Inc. Naval Research Logistics 46: 213–231, 1999 相似文献
886.
Scheduling a set of n jobs on a single machine so as to minimize the completion time variance is a well‐known NP‐hard problem. In this paper, we propose a sequence, which can be constructed in O(n log n) time, as a solution for the problem. Our primary concern is to establish the asymptotical optimality of the sequence within the framework of probabilistic analysis. Our main result is that, when the processing times are randomly and independently drawn from the same uniform distribution, the sequence is asymptotically optimal in the sense that its relative error converges to zero in probability as n increases. Other theoretical results are also derived, including: (i) When the processing times follow a symmetric structure, the problem has 2⌊(n−1)/2⌋ optimal sequences, which include our proposed sequence and other heuristic sequences suggested in the literature; and (ii) when these 2⌊(n−1)/2⌋ sequences are used as approximate solutions for a general problem, our proposed sequence yields the best approximation (in an average sense) while another sequence, which is commonly believed to be a good approximation in the literature, is interestingly the worst. © 1999 John Wiley & Sons, Inc. Naval Research Logistics 46: 373–398, 1999 相似文献
887.
We consider the problem of scheduling multiprocessor tasks with prespecified processor allocations to minimize the total completion time. The complexity of both preemptive and nonpreemptive cases of the two-processor problem are studied. We show that the preemptive case is solvable in O(n log n) time. In the nonpreemptive case, we prove that the problem is NP-hard in the strong sense, which answers an open question mentioned in Hoogeveen, van de Velde, and Veltman (1994). An efficient heuristic is also developed for this case. The relative error of this heuristic is at most 100%. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 231–242, 1998 相似文献
888.
Mehrez, Stern, and Ronen have defined a vehicle refueling problem in which a fleet of vehicles travels on a round-trip, self-contained mission from a common origin, with the objective of maximizing the operational range of the fleet. They have defined a “pure refueling chain” strategy for transferring fuel between vehicles in the fleet, and have solved the problem in the special cases when all vehicles have the same fuel capacity or consumption rate. In this article we present algorithms for the general case, where vehicles have different capacities and consumption rates. Our approach is based on a new primal dual formulation of the problem. The exact algorithm was effective to find the optimal solution for a fleet size n ⩽13. For larger fleets, we present an approximation version of it, which very quickly found a solution within 1% of the maximum possible range for arbitrarily large (up to n = 200) fleets. We also show that a small number of the best vehicles can always reach almost the same range as a large fleet. © 1992 John Wiley & Sons, Inc. 相似文献
889.
890.
王建伟 《军队政工理论研究》2006,7(5):8-10
党委书记提高贯彻落实科学发观展的能力,要做到加强学习、放眼开怀,进一步增强大局意识;坚持制度、程序办事,进一步提高决策水平;集体领导、分工负责,进一步提高抓落实的能力;讲究艺术、当好班长,进一步提高统领班子的能力。 相似文献