全文获取类型
收费全文 | 722篇 |
免费 | 215篇 |
国内免费 | 41篇 |
出版年
2024年 | 2篇 |
2023年 | 3篇 |
2022年 | 8篇 |
2021年 | 20篇 |
2020年 | 16篇 |
2019年 | 13篇 |
2018年 | 16篇 |
2017年 | 32篇 |
2016年 | 38篇 |
2015年 | 29篇 |
2014年 | 54篇 |
2013年 | 65篇 |
2012年 | 42篇 |
2011年 | 58篇 |
2010年 | 36篇 |
2009年 | 47篇 |
2008年 | 56篇 |
2007年 | 47篇 |
2006年 | 51篇 |
2005年 | 53篇 |
2004年 | 39篇 |
2003年 | 38篇 |
2002年 | 36篇 |
2001年 | 21篇 |
2000年 | 21篇 |
1999年 | 24篇 |
1998年 | 22篇 |
1997年 | 15篇 |
1996年 | 14篇 |
1995年 | 11篇 |
1994年 | 9篇 |
1993年 | 8篇 |
1992年 | 6篇 |
1991年 | 6篇 |
1990年 | 19篇 |
1989年 | 3篇 |
排序方式: 共有978条查询结果,搜索用时 218 毫秒
101.
102.
103.
根据IP组播的原理,分析了组播通信的优点,并在此基础上提出了在校园网上实现组播通信的具体方法与过程,列举了一些实际的应用. 相似文献
104.
装备器材库温湿度监控系统的设计与实现 总被引:3,自引:0,他引:3
军用装备器材仓库温湿度监控是目前亟待解决的问题.文中详细地阐述了种切实可行的设计方法--主从式两级数字化监控系统的设计原理与实现方法,并用Borland C++Builder语言对其组态软件进行程序设计. 相似文献
105.
Tsuyoshi Katayama 《海军后勤学研究》2001,48(7):638-651
We consider a single‐queue with exhaustive or gated time‐limited services and server vacations, in which the length of each service period at the queue is controlled by a timer, i.e., the server serves customers until the timer expires or the queue becomes empty, whichever occurs first, and then takes vacations. The customer whose service is interrupted due to the timer expiration may be attended according to nonpreemptive or preemptive service disciplines. For the M/G/1 exhaustive/gated time‐limited service queueing system with an exponential timer and four typical preemptive/nonpreemptive service disciplines, we derive the Laplace—Stieltjes transforms and the moment formulas for waiting times and sojourn times through a unified approach, and provide some new results for these time‐limited service disciplines. © John Wiley & Sons, Inc. Naval Research Logistics 48: 638–651, 2001. 相似文献
106.
We introduce a formulation and an exact solution method for a nonpreemptive resource constrained project scheduling problem in which the duration/cost of an activity is determined by the mode selection and the duration reduction (crashing) within the mode. This problem is a natural combination of the time/cost tradeoff problem and the resource constrained project scheduling problem. It involves the determination, for each activity, of its resource requirements, the extent of crashing, and its start time so that the total project cost is minimized. We present a branch and bound procedure and report computational results with a set of 160 problems. Computational results demonstrate the effectiveness of our procedure. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 107–127, 2001 相似文献
107.
侯新华 《兵团教育学院学报》2001,11(1):60-61
教学中指导学生正确使用数学符号、正确运用基本概念、正确运用函数图象以及探索解题思路等 ,可以提高成人《高等数学》的教学质量 ,也可以提高统考的及格率 相似文献
108.
109.
110.
In this paper we consider the discrete time/resource trade-off problem in project networks. Given a project network consisting of nodes (activities) and arcs (technological precedence relations), in which the duration of the activities is a discrete, nonincreasing function of the amount of a single renewable resource committed to it, the discrete time/resource trade-off problem minimizes the project makespan subject to precedence constraints and a single renewable resource constraint. For each activity, a work content is specified such that all execution modes (duration/resource requirement pairs) for performing the activity are allowed as long as the product of the duration and the resource requirement is at least as large as the specified work content. We present a tabu search procedure which is based on a decomposition of the problem into a mode assignment phase and a resource-constrained project scheduling phase with fixed mode assignments. Extensive computational experience, including a comparison with other local search methods, is reported. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 553–578, 1998 相似文献