首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   8075篇
  免费   900篇
  国内免费   757篇
电工技术   224篇
综合类   737篇
化学工业   35篇
金属工艺   5篇
机械仪表   163篇
建筑科学   24篇
矿业工程   35篇
能源动力   39篇
轻工业   9篇
水利工程   170篇
石油天然气   10篇
武器工业   29篇
无线电   2657篇
一般工业技术   261篇
冶金工业   34篇
原子能技术   2篇
自动化技术   5298篇
  2025年   40篇
  2024年   114篇
  2023年   125篇
  2022年   135篇
  2021年   148篇
  2020年   235篇
  2019年   172篇
  2018年   196篇
  2017年   258篇
  2016年   303篇
  2015年   408篇
  2014年   521篇
  2013年   585篇
  2012年   655篇
  2011年   692篇
  2010年   611篇
  2009年   651篇
  2008年   658篇
  2007年   672篇
  2006年   523篇
  2005年   454篇
  2004年   375篇
  2003年   291篇
  2002年   213篇
  2001年   199篇
  2000年   120篇
  1999年   72篇
  1998年   67篇
  1997年   46篇
  1996年   38篇
  1995年   30篇
  1994年   26篇
  1993年   22篇
  1992年   22篇
  1991年   15篇
  1990年   5篇
  1989年   5篇
  1988年   1篇
  1987年   8篇
  1986年   7篇
  1985年   4篇
  1984年   4篇
  1983年   3篇
  1980年   3篇
排序方式: 共有9732条查询结果,搜索用时 15 毫秒
1.
本文介绍了一种在微机上实现的印制板自动布线方法──多级线探索法及其编程方法。这种方法是基于完备布线算法的概念,通过分析李氏算法和传统线探索法的不足之处而得到的。虽然它也是一种线探索法,但有较传统线探索法更强的探索能力,不需要结合李氏算法而能单独完成布线任务,是一种较理想的算法,通过实验获得了较为满意的效果。  相似文献   
2.
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.  相似文献   
3.
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.  相似文献   
4.
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.  相似文献   
5.
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...  相似文献   
6.
多路径路由对无线传感器网络的负载均衡和容错能力等方面都有一定改善作用。在研究一些多路径路由算法的基础上,对分层的无线传感器网络路由进行探索,提出了一种基于树的动态多路径路由的生成方法,快速获得当前节点的主路径与备用路径。仿真结果表明,该方法可有效地均衡网络负载、减少时延、提高网络的可靠性。  相似文献   
7.
In this paper, we identify two cases in which the proposition for calculating time window penalties presented in Nagata, Y., Bräysy, O. and Dullaert, W. A penalty-based edge assembly memetic algorithm for the vehicle routing problem with time windows, Computers & Operations Research 2010;37(4): 724–37 yields incorrect results. We derive the corrected proposition and use numerical studies to show that a significant proportion of the evaluations performed by a Tabu Search for VRPTW falls under the two incorrect cases. Moreover, we demonstrate that the incorrect time window handling has a significant negative impact on the solution quality of the Tabu Search.  相似文献   
8.
简述了局域网的类型、软件路由器、层次与故障,并介绍了局域网故障的一些检测方法,分析了故障原因,并提出处理故障的方法。  相似文献   
9.
在无线传感器网络中,节点具有有限的电池能量,为了延长网络的生存时间,提出了一种基于生成树的分布式路由协议STRP及其具有能量意识的改进版本STRP-PA.每个传感器节点根据相邻节点与基站的距离、剩余能量等信息寻找父节点,构造一棵以基站为根的近优最小生成树,节点采集的数据沿树传输,并在树杈节点进行聚合.仿真实验结果表明:STRP-PA协议能够节省网络能量,显著延长网络稳定工作的时间,性能明显好于LEACH协议.  相似文献   
10.
Personalised routing for wheelchair navigation   总被引:1,自引:0,他引:1  
Wheelchair users are confronted with many outdoor obstacles in everyday travel that can make the task arduous and unsafe, especially in unfamiliar environments. However, if wheelchair users are provided with routes that can safely, accurately and efficiently guide them to their destinations, then the difficulty and danger associated with traveling might be significantly reduced. In this article, we present a routing method suitable for wheelchair users by taking into account sidewalk obstacles such as slope, steps, sidewalk condition and sidewalk traffic as are preferred by users. Our method calculates impedance scores for each sidewalk segment, which are then used to determine an optimal route between any given pair of origin-destination addresses in a sidewalk network. We first discuss sidewalk network parameters and a spatial database suitable for wheelchair navigation. Then we discuss our personalised routing approach. We also describe three methods to weight the impedance level of each sidewalk segment and compare the effectiveness of each method through experimentation using the sidewalk network for the University of Pittsburgh campus area.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号