全文获取类型
收费全文 | 1328篇 |
免费 | 416篇 |
国内免费 | 205篇 |
出版年
2024年 | 4篇 |
2023年 | 16篇 |
2022年 | 18篇 |
2021年 | 31篇 |
2020年 | 33篇 |
2019年 | 29篇 |
2018年 | 22篇 |
2017年 | 65篇 |
2016年 | 102篇 |
2015年 | 56篇 |
2014年 | 112篇 |
2013年 | 110篇 |
2012年 | 123篇 |
2011年 | 90篇 |
2010年 | 83篇 |
2009年 | 123篇 |
2008年 | 82篇 |
2007年 | 104篇 |
2006年 | 134篇 |
2005年 | 112篇 |
2004年 | 88篇 |
2003年 | 73篇 |
2002年 | 53篇 |
2001年 | 50篇 |
2000年 | 28篇 |
1999年 | 40篇 |
1998年 | 34篇 |
1997年 | 29篇 |
1996年 | 18篇 |
1995年 | 16篇 |
1994年 | 11篇 |
1993年 | 12篇 |
1992年 | 14篇 |
1991年 | 13篇 |
1990年 | 15篇 |
1989年 | 5篇 |
1987年 | 1篇 |
排序方式: 共有1949条查询结果,搜索用时 15 毫秒
991.
针对传感器网络中跟踪目标需要大量的节点协同工作,还需要实时处理和传输大量数据,提出一种基于扩展卡尔曼滤波的有向传感器网络目标跟踪算法(EK-MTDC),重点研究了传感器网络中的扇区数量对节点间数据传输与目标跟踪精度的影响,根据对目标状态的分析,通过压缩参与监测的节点个数,选择激活网络中节点相交区域内的节点对跟踪目标进行监测。仿真结果表明,该算法能在不降低跟踪效果的前提下,降低网络能耗,延长其使用寿命。 相似文献
992.
993.
994.
995.
996.
侯遵泽 《中国人民武装警察部队学院学报》2000,16(1):27-30
本文提出了冷却燃烧罐和邻近罐时水枪应放置的位置的一系列数学描述原则,从而建立了油罐灭火冷却力量部署的模拟模型,该模型可方便地用于计算机模拟系统。 相似文献
997.
在超级计算机体系结构设计阶段 ,有必要进行时序规划 ,以尽早判断设计方案和性能指标的物理可实现性。提出一种性能驱动的时序规划方法 ,采用适于组件性能描述的时序性能模型 ,并按照线网权重分配路径延时余量 ,算法具有效率高、延时分配合理的优点 相似文献
998.
火控雷达的仿真目标建模及实现 总被引:5,自引:1,他引:4
中外军队的实践证明 :模拟训练是一种最简便、成本低、效果好的训练方式。对于需要空情保障和训练成本高的雷达训练来说更是如此。探讨了火控雷达回波信号的模型建立及实施方案。 相似文献
999.
This article addresses the inventory placement problem in a serial supply chain facing a stochastic demand for a single planning period. All customer demand is served from stage 1, where the product is stored in its final form. If the demand exceeds the supply at stage 1, then stage 1 is resupplied from stocks held at the upstream stages 2 through N, where the product may be stored in finished form or as raw materials or subassemblies. All stocking decisions are made before the demand occurs. The demand is nonnegative and continuous with a known probability distribution, and the purchasing, holding, shipping, processing, and shortage costs are proportional. There are no fixed costs. All unsatisfied demand is lost. The objective is to select the stock quantities that should be placed different stages so as to maximize the expected profit. Under reasonable cost assumptions, this leads to a convex constrained optimization problem. We characterize the properties of the optimal solution and propose an effective algorithm for its computation. For the case of normal demands, the calculations can be done on a spreadsheet. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48:506–517, 2001 相似文献
1000.
We study a workforce planning and scheduling problem in which weekly tours of agents must be designed. Our motivation for this study comes from a call center application where agents serve customers in response to incoming phone calls. Similar to many other applications in the services industry, the demand for service in call centers varies significantly within a day and among days of the week. In our model, a weekly tour of an agent consists of five daily shifts and two days off, where daily shifts within a tour may be different from each other. The starting times of any two consecutive shifts, however, may not differ by more than a specified bound. Furthermore, a tour must also satisfy constraints regarding the days off, for example, it may be required that one of the days off is on a weekend day. The objective is to determine a collection of weekly tours that satisfy the demand for agents' services, while minimizing the total labor cost of the workforce. We describe an integer programming model where a weekly tour is obtained by combining seven daily shift scheduling models and days‐off constraints in a network flow framework. The model is flexible and can accommodate different daily models with varying levels of detail. It readily handles different days‐off rules and constraints regarding start time differentials in consecutive days. Computational results are also presented. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 607–624, 2001. 相似文献