全文获取类型
收费全文 | 11554篇 |
免费 | 1130篇 |
国内免费 | 1110篇 |
学科分类
工业技术 | 13794篇 |
出版年
2025年 | 35篇 |
2024年 | 117篇 |
2023年 | 141篇 |
2022年 | 155篇 |
2021年 | 177篇 |
2020年 | 283篇 |
2019年 | 204篇 |
2018年 | 218篇 |
2017年 | 296篇 |
2016年 | 354篇 |
2015年 | 483篇 |
2014年 | 700篇 |
2013年 | 733篇 |
2012年 | 875篇 |
2011年 | 920篇 |
2010年 | 867篇 |
2009年 | 969篇 |
2008年 | 1003篇 |
2007年 | 1030篇 |
2006年 | 909篇 |
2005年 | 831篇 |
2004年 | 632篇 |
2003年 | 551篇 |
2002年 | 384篇 |
2001年 | 315篇 |
2000年 | 205篇 |
1999年 | 107篇 |
1998年 | 71篇 |
1997年 | 46篇 |
1996年 | 37篇 |
1995年 | 30篇 |
1994年 | 23篇 |
1993年 | 20篇 |
1992年 | 20篇 |
1991年 | 15篇 |
1990年 | 6篇 |
1989年 | 3篇 |
1988年 | 1篇 |
1987年 | 9篇 |
1986年 | 7篇 |
1985年 | 3篇 |
1984年 | 4篇 |
1983年 | 2篇 |
1980年 | 3篇 |
排序方式: 共有10000条查询结果,搜索用时 16 毫秒
1.
陈国龙 《计算机辅助设计与图形学学报》1994,6(2):136-142
本文介绍了一种在微机上实现的印制板自动布线方法──多级线探索法及其编程方法。这种方法是基于完备布线算法的概念,通过分析李氏算法和传统线探索法的不足之处而得到的。虽然它也是一种线探索法,但有较传统线探索法更强的探索能力,不需要结合李氏算法而能单独完成布线任务,是一种较理想的算法,通过实验获得了较为满意的效果。 相似文献
2.
Shibing Zhang Dengyin Zhang 《通讯和计算机》2006,3(3):6-10
As the Quality of Service (QoS) becomes increasingly important in the Internet development, there are more and more researches focusing on the issues of QoS negotiation. Mobile software agents represent a valid alternative to the implementation of strategies for the negotiation. In this paper, a QoS negotiation and renegotiation system architecture based on mobile agents is proposed. These agents perform the task in the whole process and therefore reduce the network load, overcome latency, and avoid frequent exchange information between clients and server. The simulation results show that it can improve the network resource utility about 10%. 相似文献
3.
F. Hooshmand Khaligh 《国际生产研究杂志》2016,54(2):579-590
In this study, a multistage stochastic programming (SP) model is presented for a variant of single-vehicle routing problem with stochastic demands from a dynamic viewpoint. It is assumed that the actual demand of a customer becomes known only when the customer is visited. This problem falls into the category of SP with endogenous uncertainty and hence, the scenario tree is decision-dependent. Therefore, nonanticipativity of decisions is ensured by conditional constraints making up a large portion of total constraints. Thus, a novel approach is proposed that considerably reduces the problem size without any effect on the solution space. Computational results on some test problems are reported. 相似文献
4.
This paper addresses the food distribution decision from a wholesaler's perspective, as the wholesalers are often faced with thorny issues such as when, where, how to deliver products at the lowest costs to best satisfy the retailers’ changing needs. This research relies on a distribution problem encountered at Northern Grocery Company in Beijing as an example to develop a two-stage solution procedure and subsequent computer-enabled programs for identifying efficient vehicle routing alternatives. The solution process, which integrates heuristic search algorithms and an integer programming model, can be applied to a wide range of distribution problems with specified route durations and a circular transportation network structure as exemplified by City of Beijing. 相似文献
5.
6.
Opportunistic routing is a candidate for multihop wireless routing where the network topology and radio channels vary rapidly. However, there are not many opportunistic routing algorithms that can be implemented in a real multihop wireless network while exploiting the node mobility. It motivates us to implement an opportunistic routing, random basketball routing (BR), in a real multi-robot network to see if it can enhance the capacity of the multihop network as mobility increases. For implementation purposes, we added some features, such as destination RSSI measuring, a loop-free procedure and distributed relay probability updating, to the original BR. We carried out the experiments on a real multi-robot network and compared BR with AODV combined with CSMA/CA (routing + MAC protocol). We considered both static and dynamic scenarios. Our experiments are encouraging in that BR outperforms AODV + CSMA/CA, particularly in dynamic cases; the throughput of BR is 6.6 times higher than that of AODV + CSMA/CA. BR with dynamic networks shows 1.4 times higher throughput performance than BR with static networks. We investigate the performance of BR in the large-scale network using NS-2 simulation. We verify the effect of node density, speed, destination beacon signal and loop-free procedure. According to the large-scale simulation, the end-to-end throughput grows with the node speed. 相似文献
7.
The Journal of Supercomputing - Rapid advances in interconnection networks in multiprocessors are closing the gap between computation and communication. Given this trend, how can we utilize fast... 相似文献
8.
多路径路由对无线传感器网络的负载均衡和容错能力等方面都有一定改善作用。在研究一些多路径路由算法的基础上,对分层的无线传感器网络路由进行探索,提出了一种基于树的动态多路径路由的生成方法,快速获得当前节点的主路径与备用路径。仿真结果表明,该方法可有效地均衡网络负载、减少时延、提高网络的可靠性。 相似文献
9.
通过对Internet中流媒体及其QoS控制技术的讨论,构架出了Internet中流媒体及其QoS控制的关键技术。并提出针对发送端和接收端的QoS控制,讨论两端的控制技术;并提出了非均匀QoS控制技术。 相似文献
10.
从静态策略控制和动态策略控制2个方面介绍了移动宽带差异化服务的技术原理,并对HLR设置、RAN设置及PCC实施提出了部署建议. 相似文献