首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   1466篇
  免费   118篇
  国内免费   167篇
电工技术   41篇
综合类   51篇
化学工业   13篇
金属工艺   10篇
机械仪表   53篇
建筑科学   16篇
矿业工程   7篇
能源动力   16篇
轻工业   3篇
水利工程   4篇
石油天然气   5篇
武器工业   4篇
无线电   137篇
一般工业技术   63篇
冶金工业   7篇
原子能技术   7篇
自动化技术   1314篇
  2024年   5篇
  2023年   12篇
  2022年   27篇
  2021年   33篇
  2020年   39篇
  2019年   34篇
  2018年   34篇
  2017年   43篇
  2016年   48篇
  2015年   63篇
  2014年   98篇
  2013年   116篇
  2012年   123篇
  2011年   128篇
  2010年   66篇
  2009年   79篇
  2008年   116篇
  2007年   116篇
  2006年   90篇
  2005年   83篇
  2004年   68篇
  2003年   77篇
  2002年   53篇
  2001年   47篇
  2000年   26篇
  1999年   21篇
  1998年   21篇
  1997年   19篇
  1996年   12篇
  1995年   5篇
  1994年   8篇
  1993年   7篇
  1992年   3篇
  1991年   4篇
  1990年   9篇
  1989年   6篇
  1988年   2篇
  1987年   3篇
  1984年   1篇
  1982年   2篇
  1977年   1篇
  1976年   2篇
  1954年   1篇
排序方式: 共有1751条查询结果,搜索用时 15 毫秒
1.
Internet中文信息搜索引擎评析   总被引:3,自引:0,他引:3  
介绍搜索引擎的分类、对比和查询技巧。  相似文献   
2.
Pre-pruning and Post-pruning are two standard techniques for handling noise in decision tree learning. Pre-pruning deals with noise during learning, while post-pruning addresses this problem after an overfitting theory has been learned. We first review several adaptations of pre- and post-pruning techniques for separate-and-conquer rule learning algorithms and discuss some fundamental problems. The primary goal of this paper is to show how to solve these problems with two new algorithms that combine and integrate pre- and post-pruning.  相似文献   
3.
运动估计块匹配两级搜索算法   总被引:2,自引:0,他引:2  
根据视频图像相邻块在空间上具有很大的相关性,吸收了矢量预测块匹配的核心思想,提出一种两级块匹配运动估计算法,在第一级中,首先根据矢量预测确定一个小区域,然后在此区域内进行快速搜索,如果在第一级中没有搜索到匹配块则进行第二级搜索,该算法可大大提高搜索速度.  相似文献   
4.
Unstructured peer-to-peer (P2P) networks have become a very popular architecture for content distribution in large-scale and dynamic environments. The search efficiency problem in unstructured P2P networks has not been adequately addressed so far, especially concerning search for rare objects. In this paper, we propose a proactive replication strategy to improve search efficiency for rare objects. It uses an object-probing technique for peers to decide whether or not to establish replications for their objects when they join the network. This strategy can effectively increase the popularity of rare objects in order to enhance search efficiency. We also present a rare object search algorithm to reduce the overhead caused by the replication strategy. When a peer forwards a search request, the forward probability is calculated according to its neighbors' degrees and the number of neighbors' objects. Therefore, the search request is forwarded to the peers more likely containing target objects. Simulations show that our proactive replication strategy greatly improves search efficiency for rare objects with moderate communication overhead. The rare object search algorithm not only improves search efficiency for rare objects, but also achieves load balance in search.  相似文献   
5.
针对新时代环境下Newsvendor型产品销售期短、期末未出售产品价值递减的产品特点,生产链要求位于上游的供应商必须快速加工出所需的工件,否则将面临着线性递增的拖期惩罚。在面对基于Newsvendor型产品的柔性作业车间调度问题时,设计了一种加入禁忌搜索的混合遗传算法,扩大了解的搜索范围,避免了传统遗传算法容易陷于局部最优的缺陷。最后利用混合遗传算法对一个仿真案例进行求解。  相似文献   
6.
Optimization techniques known as metaheuristics have been applied successfully to solve different problems, in which their development is characterized by the appropriate selection of parameters (values) for its execution. Where the adjustment of a parameter is required, this parameter will be tested until viable results are obtained. Normally, such adjustments are made by the developer deploying the metaheuristic. The quality of the results of a test instance [The term instance is used to refer to the assignment of values to the input variables of a problem.] will not be transferred to the instances that were not tested yet and its feedback may require a slow process of “trial and error” where the algorithm has to be adjusted for a specific application. Within this context of metaheuristics the Reactive Search emerged defending the integration of machine learning within heuristic searches for solving complex optimization problems. Based in the integration that the Reactive Search proposes between machine learning and metaheuristics, emerged the idea of putting Reinforcement Learning, more specifically the Q-learning algorithm with a reactive behavior, to select which local search is the most appropriate in a given time of a search, to succeed another local search that can not improve the current solution in the VNS metaheuristic. In this work we propose a reactive implementation using Reinforcement Learning for the self-tuning of the implemented algorithm, applied to the Symmetric Travelling Salesman Problem.  相似文献   
7.
Metaheuristic optimization algorithms have become a popular choice for solving complex problems which are otherwise difficult to solve by traditional methods. However, these methods have the problem of the parameter adaptation and many researchers have proposed modifications using fuzzy logic to solve this problem and obtain better results than the original methods. In this study a comprehensive review is made of the optimization techniques in which fuzzy logic is used to dynamically adapt some important parameters in these methods. In this paper, the survey mainly covers the optimization methods of Particle Swarm Optimization (PSO), Gravitational Search Algorithm (GSA), and Ant Colony Optimization (ACO), which in the last years have been used with fuzzy logic to improve the performance of the optimization methods.  相似文献   
8.
建立了两级定位-路径问题的数学模型,提出了一种求解该问题的人工蜂群算法。针对该算法容易出现早熟现象,将近年来国外出现的一种新颖的轨迹式启发式算法--变邻域搜索融入其中,由此提出三种变邻域搜索策略。基于不同变邻域搜索策略的人工蜂群算法和人工鱼群算法的求解效果进行对比仿真。实验结果表明,变邻域人工蜂群算法能有效求解两级定位-路径问题。  相似文献   
9.
针对最大化多用户MIMO系统的和速率的问题,提出了将迭代式干扰对齐技术(Iterative Interference Alignment:ⅡA)和系统自由度(DoF)分配策略相结合的一种算法.系统的DoF分配是通过树搜索算法(Tree search)来实现的.理论分析及实验仿真结果表明,该算法获得的系统容量,接近遍历法(exhausting search:EX)的结果,但是在算法复杂性及收敛时间上明显优于遍历法.  相似文献   
10.
电子商务蓬勃发展的大环境下,广告主具有强烈的电商广告投放意愿,显然他们并未达到电商广告的核心业务SEM (搜索引擎营销优化)的专业要求。所以广告主希望借助第三方工具来进行搜索引擎广告投放的一站式服务来满足其业务需求。基于此,本文将提供一整套的竞价词托管式服务的解决方案。以淘宝直通车这一全新的搜索竞价模式作为研究对象,从语义抽取、关键词扩展、竞价词生成、模型化出价、广告效果正向反馈监控模型几方面进行分析和统计,为直通车广告主提供最优投放策略整体解决方案。第一阶段针对商品信息进行数据挖掘,实现关键词推荐引擎。第二阶段实现投放优化模块,实施定价策略,建立的点击量与PPC(“平均点击花费”)模型,实现在预算资金的约束下对不同竞价组合进行ROI(投入产出比)最大化的投资决策。以实际效果改善直通车竞价搜索用户体验。  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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