咨询与建议

限定检索结果

文献类型

  • 43,698 篇 会议
  • 9,884 篇 期刊文献
  • 7 册 图书
  • 4 篇 学位论文

馆藏范围

  • 53,592 篇 电子文献
  • 1 种 纸本馆藏

日期分布

学科分类号

  • 20,179 篇 工学
    • 12,038 篇 计算机科学与技术...
    • 10,518 篇 电气工程
    • 5,273 篇 信息与通信工程
    • 4,785 篇 软件工程
    • 4,257 篇 控制科学与工程
    • 1,087 篇 机械工程
    • 1,080 篇 交通运输工程
    • 1,012 篇 仪器科学与技术
    • 635 篇 电子科学与技术(可...
    • 452 篇 土木工程
    • 284 篇 航空宇航科学与技...
    • 210 篇 生物工程
    • 202 篇 生物医学工程(可授...
    • 201 篇 动力工程及工程热...
    • 147 篇 测绘科学与技术
    • 131 篇 石油与天然气工程
    • 125 篇 材料科学与工程(可...
    • 108 篇 冶金工程
  • 4,281 篇 理学
    • 2,712 篇 数学
    • 916 篇 系统科学
    • 639 篇 物理学
    • 328 篇 生物学
    • 289 篇 统计学(可授理学、...
  • 2,247 篇 管理学
    • 2,035 篇 管理科学与工程(可...
    • 621 篇 工商管理
    • 256 篇 图书情报与档案管...
  • 313 篇 医学
    • 238 篇 临床医学
  • 270 篇 经济学
    • 249 篇 应用经济学
  • 155 篇 文学
    • 147 篇 新闻传播学
  • 147 篇 法学
    • 138 篇 社会学
  • 110 篇 农学
  • 50 篇 教育学
  • 21 篇 艺术学
  • 20 篇 军事学
  • 2 篇 哲学

主题

  • 53,593 篇 heuristic algori...
  • 6,441 篇 optimization
  • 5,302 篇 algorithm design...
  • 3,296 篇 computational mo...
  • 3,248 篇 resource managem...
  • 2,749 篇 routing
  • 2,633 篇 prediction algor...
  • 2,573 篇 clustering algor...
  • 2,466 篇 vehicle dynamics
  • 2,418 篇 real-time system...
  • 2,392 篇 mathematical mod...
  • 2,280 篇 convergence
  • 2,244 篇 costs
  • 2,100 篇 approximation al...
  • 1,978 篇 accuracy
  • 1,948 篇 trajectory
  • 1,929 篇 training
  • 1,918 篇 dynamic scheduli...
  • 1,805 篇 simulation
  • 1,710 篇 dynamic programm...

机构

  • 76 篇 state key labora...
  • 59 篇 tsinghua univers...
  • 49 篇 college of infor...
  • 46 篇 hong kong polyte...
  • 45 篇 school of comput...
  • 42 篇 shanghai jiao to...
  • 41 篇 univ chinese aca...
  • 41 篇 northeastern uni...
  • 39 篇 national mobile ...
  • 39 篇 college of compu...
  • 37 篇 beijing inst tec...
  • 36 篇 school of automa...
  • 36 篇 department of co...
  • 35 篇 faculty of infor...
  • 34 篇 university of sc...
  • 32 篇 southeast univ s...
  • 30 篇 nanjing univ sci...
  • 29 篇 purple mt labs p...
  • 29 篇 school of electr...
  • 28 篇 univ sci & techn...

作者

  • 55 篇 li li
  • 46 篇 jun zhang
  • 42 篇 lei wang
  • 42 篇 yu wang
  • 39 篇 liu yang
  • 30 篇 jun wang
  • 29 篇 wei liu
  • 28 篇 wang lei
  • 27 篇 jian wang
  • 27 篇 li yang
  • 27 篇 hui wang
  • 27 篇 ming li
  • 26 篇 xin liu
  • 25 篇 bin wang
  • 25 篇 lewis frank l.
  • 24 篇 niyato dusit
  • 23 篇 li xin
  • 23 篇 jing zhang
  • 22 篇 xi chen
  • 22 篇 wang jing

语言

  • 53,079 篇 英文
  • 318 篇 其他
  • 173 篇 中文
  • 9 篇 土耳其文
  • 5 篇 日文
  • 4 篇 法文
  • 4 篇 朝鲜文
  • 2 篇 德文
  • 1 篇 西班牙文
  • 1 篇 俄文
  • 1 篇 斯洛伐克文
  • 1 篇 乌克兰文
检索条件"主题词=heuristic algorithms"
53593 条 记 录,以下是21-30 订阅
排序:
heuristic algorithms for Aggregated HVAC Control via Smart Thermostats for Regulation Service
收藏 引用
IEEE TRANSACTIONS ON SMART GRID 2020年 第3期11卷 2023-2032页
作者: Adhikari, Rajendra Pipattanasomporn, Manisa Rahman, Saifur Virginia Tech Adv Res Inst Bradley Dept Elect & Comp Engn Arlington VA 22203 USA Chulalongkorn Univ Dept Elect Engn Smart Grid Res Unit Bangkok 10330 Thailand
Residential HVAC control is a large untapped resource for providing regulation services to the grid. This paper presents a set of algorithms for controlling HVACs of a group of residential houses that a demand respons... 详细信息
来源: 评论
heuristic algorithms for the three-dimensional bin packing problem
收藏 引用
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH 2002年 第2期141卷 410-420页
作者: Lodi, A Martello, S Vigo, D Univ Bologna Dipartimento Elettron Informat & Sistemist I-40136 Bologna Italy
The Three-Dimensional Bin Packing Problem (3BP) consists of allocating, without overlapping, a given set of three-dimensional rectangular items to the minimum number of three-dimensional identical finite bins. The pro... 详细信息
来源: 评论
heuristic algorithms for the 2-period balanced Travelling Salesman Problem in Euclidean graphs
收藏 引用
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH 2011年 第3期208卷 253-262页
作者: Bassetto, Tatiana Mason, Francesco Univ Venice Dept Appl Math I-30123 Venice Italy
In the 2-period Travelling Salesman Problem some nodes called double nodes are visited in both of two periods while the remaining ones called single nodes are visited in either one of the periods In this paper we stud... 详细信息
来源: 评论
heuristic algorithms for Hadamard matrices with two circulant cores
收藏 引用
THEORETICAL COMPUTER SCIENCE 2008年 第1-3期407卷 274-277页
作者: Chiarandini, M. Kotsireas, I. S. Koukouvinos, C. Paquete, L. Wilfrid Laurier Univ Dept Phys & Comp Sci Waterloo ON N2L 3C5 Canada Univ So Denmark Dept Math & Comp Sci DK-5230 Odense Denmark Natl Tech Univ Athens Dept Math GR-15773 Athens Greece Univ Coimbra Dept Informat Engn CISUS P-3030290 Coimbra Portugal
We design heuristic algorithms to construct Hadamard matrices with two circulant cores. This hard combinatorial problem can be formulated in terms of objective functions of several binary variables, so that heuristic ... 详细信息
来源: 评论
heuristic algorithms vs. linear programs for designing efficient conservation reserve networks: Evaluation of solution optimality and processing time
收藏 引用
BIOLOGICAL CONSERVATION 2007年 第3期137卷 349-358页
作者: Vanderkam, Robert P. D. Wiersma, Yolanda F. King, Douglas J. Environm Canada Canadian Wildlife Serv Gatineau ON K1A 0H3 Canada Mem Univ Newfoundland Dept Biol St John NF A1B 3X9 Canada Carleton Univ Dept Geog & Environm Studies Ottawa ON K1S 5B6 Canada
Systematic approaches to efficient reserve network design often make use of one of two types of site selection algorithm;linear programs or heuristic algorithms. Unlike with linear programs, heuristic algorithms have ... 详细信息
来源: 评论
heuristic algorithms for finding light-forest of multicast routing on WDM network
收藏 引用
Journal of Information Science and Engineering 2009年 第1期25卷 83-103页
作者: Din, Der-Rong Department of Computer Science and Information Engineering National Changhua University of Education Changhua City 500 Taiwan
Wavelength Division Multiplexing (WDM) is an important technique to make use of the large amount of bandwidths in optical fibers to meet the bandwidth requirements of applications. In this paper, two new models (MWDCR... 详细信息
来源: 评论
heuristic algorithms FOR BROADCASTING IN POINT-TO-POINT COMPUTER-NETWORKS
收藏 引用
IEEE TRANSACTIONS ON COMPUTERS 1984年 第9期33卷 804-811页
作者: SCHEUERMANN, P WU, G Departrmient of Electrical Engineering and Computer Science Northwestern University
We examine the problem of broadcasting in a point-to-point computer network where a message, originated by one node, is transmitted to all nodes, subject to the restriction that an informed node can call only one of i... 详细信息
来源: 评论
heuristic algorithms FOR THE MULTIPLE DEPOT VEHICLE SCHEDULING PROBLEM
收藏 引用
MANAGEMENT SCIENCE 1993年 第1期39卷 115-125页
作者: DELLAMICO, M FISCHETTI, M TOTH, P UNIV BOLOGNA DEISI-40126 BOLOGNAITALY
We consider the NP-hard Multiple Depot Vehicle Scheduling Problem, in which a given set of time-tabled trips have to be assigned to vehicles stationed at different depots, so as to minimize the number of vehicles used... 详细信息
来源: 评论
heuristic algorithms for finding minimum dominating set in graphs
收藏 引用
Journal of Computational and Theoretical Nanoscience 2015年 第12期12卷 6028-6038页
作者: Deng, Fei Shao, Zehui Lang, Fangnian Guo, Yong School of Information Science and Technology Chengdu University of Technology Chengdu610059 China School of Information Science and Technology Chengdu University Chengdu610106 China
A dominating set in a graph G is a subset S ⊆ V(G) such that each vertex in V(G) \ S is adjacent to some vertex in S. The domination number γ(G) of G is the minimum size of a dominating set of G. The domination numbe... 详细信息
来源: 评论
heuristic algorithms for two-machine job shop problem under availability constraints on one machine: makespan minimization
收藏 引用
IFAC-PapersOnLine 2018年 第11期51卷 1065-1070页
作者: Benttaleb, Mourad Hnaien, Faicel Yalaoui, Farouk ICD-LOSI Université de Technologie de Troyes UMR CNRS 6281 12 Rue Marie Curie Troyes Cedex42060-10004 CS France
We discuss the two-machine job shop scheduling problem with availability constraints on one machine for maximum completion time (makespan) minimization. We consider the problem when unavailability periods are planned ... 详细信息
来源: 评论