咨询与建议

限定检索结果

文献类型

  • 4,033 篇 会议
  • 2,163 篇 期刊文献
  • 34 篇 学位论文

馆藏范围

  • 6,230 篇 电子文献
  • 0 种 纸本馆藏

日期分布

学科分类号

  • 3,921 篇 工学
    • 2,152 篇 计算机科学与技术...
    • 1,874 篇 电气工程
    • 957 篇 信息与通信工程
    • 909 篇 控制科学与工程
    • 407 篇 软件工程
    • 156 篇 仪器科学与技术
    • 154 篇 电子科学与技术(可...
    • 135 篇 机械工程
    • 70 篇 交通运输工程
    • 40 篇 石油与天然气工程
    • 21 篇 动力工程及工程热...
    • 21 篇 网络空间安全
    • 16 篇 土木工程
    • 16 篇 测绘科学与技术
    • 11 篇 生物医学工程(可授...
    • 9 篇 材料科学与工程(可...
    • 8 篇 航空宇航科学与技...
  • 691 篇 理学
    • 371 篇 数学
    • 274 篇 系统科学
    • 77 篇 物理学
    • 18 篇 生物学
    • 8 篇 统计学(可授理学、...
    • 7 篇 化学
  • 234 篇 管理学
    • 226 篇 管理科学与工程(可...
    • 9 篇 图书情报与档案管...
  • 37 篇 医学
    • 32 篇 临床医学
    • 11 篇 特种医学
  • 20 篇 文学
    • 20 篇 新闻传播学
  • 10 篇 经济学
    • 7 篇 理论经济学
  • 6 篇 军事学
    • 6 篇 军队指挥学
  • 3 篇 教育学
  • 3 篇 农学
  • 2 篇 艺术学
  • 1 篇 法学

主题

  • 6,230 篇 distributed algo...
  • 545 篇 convergence
  • 545 篇 wireless sensor ...
  • 526 篇 algorithm design...
  • 411 篇 optimization
  • 381 篇 computer science
  • 371 篇 distributed comp...
  • 363 篇 network topology
  • 329 篇 routing
  • 279 篇 resource managem...
  • 219 篇 protocols
  • 210 篇 computational mo...
  • 207 篇 computer network...
  • 202 篇 costs
  • 199 篇 approximation al...
  • 199 篇 fault tolerance
  • 185 篇 ad hoc networks
  • 181 篇 bandwidth
  • 179 篇 peer to peer com...
  • 177 篇 interference

机构

  • 25 篇 carnegie mellon ...
  • 19 篇 univ illinois de...
  • 19 篇 cent south univ ...
  • 19 篇 nanyang technol ...
  • 19 篇 univ cyprus dept...
  • 16 篇 ege univ int com...
  • 16 篇 univ minnesota d...
  • 16 篇 mit cambridge ma...
  • 15 篇 univ liverpool d...
  • 14 篇 suny stony brook...
  • 14 篇 swiss fed inst t...
  • 14 篇 purdue univ sch ...
  • 13 篇 northeastern uni...
  • 12 篇 univ penn dept e...
  • 12 篇 department of el...
  • 12 篇 weizmann inst sc...
  • 11 篇 department of in...
  • 11 篇 georgia state un...
  • 11 篇 purdue univ sch ...
  • 11 篇 shanghai jiao to...

作者

  • 35 篇 hadjicostis chri...
  • 23 篇 kowalski dariusz...
  • 21 篇 hong yiguang
  • 21 篇 notarstefano giu...
  • 21 篇 scutari gesualdo
  • 20 篇 dagdeviren orhan
  • 18 篇 dominguez-garcia...
  • 17 篇 deng zhenhua
  • 17 篇 pandurangan gopa...
  • 17 篇 mosbah mohamed
  • 16 篇 christoforos n. ...
  • 16 篇 cortes jorge
  • 16 篇 khan usman a.
  • 16 篇 schmid stefan
  • 16 篇 sharma gokarna
  • 15 篇 peleg david
  • 15 篇 korman amos
  • 15 篇 navarra alfredo
  • 15 篇 mou shaoshuai
  • 15 篇 zeng xianlin

语言

  • 6,125 篇 英文
  • 62 篇 其他
  • 38 篇 中文
  • 4 篇 德文
  • 1 篇 法文
  • 1 篇 葡萄牙文
  • 1 篇 俄文
  • 1 篇 土耳其文
检索条件"主题词=distributed algorithms"
6230 条 记 录,以下是501-510 订阅
排序:
A review of distributed optimization: Problems, models and algorithms
收藏 引用
NEUROCOMPUTING 2022年 第0期483卷 446-459页
作者: Zheng, Yanling Liu, Qingshan Southeast Univ Sch Math Nanjing 210096 Peoples R China Southeast Univ Jiangsu Prov Key Lab Networked Collect Intelligen Nanjing 210096 Peoples R China
With the development of big data and artificial intelligence, distributed optimization has emerged as an indispensable tool for solving large-scale problems. In particular, the multi-agent system based on distributed ... 详细信息
来源: 评论
Low-Complexity distributed Radio Access Network Slicing: algorithms and Experimental Results
收藏 引用
IEEE-ACM TRANSACTIONS ON NETWORKING 2018年 第6期26卷 2815-2828页
作者: D'Oro, Salvatore Restuccia, Francesco Melodia, Tommaso Palazzo, Sergio Dept Elect & Comp Engn Boston MA 02115 USA Univ Catania Dipartimento Ingn Elettr Elettron & Informat I-92125 Catania Italy
Radio access network (RAN) slicing is an effective methodology to dynamically allocate networking resources in 5G networks. One of the main challenges of RAN slicing is that it is provably an NP-Hard problem. For this... 详细信息
来源: 评论
Localized and distributed link scheduling algorithms in IoT under rayleigh fading
收藏 引用
COMPUTER NETWORKS 2019年 151卷 232-244页
作者: Yu, Kan Wang, Yinglong Yu, Jiguo Yu, Dongxiao Cheng, Xiuzhen Shan, Zhiguang Shandong Univ Sci & Technol Coll comp sci & Engn Qingdao 266510 Peoples R China Qilu Univ Technol Sch Comp Sci & Techonol Shandong Acad Sci Jinan 250353 Shandong Peoples R China Natl Supercomp Ctr Jinan Shandong Comp Sci Ctr Jinan 250014 Shandong Peoples R China Qufu Normal Univ Sch Informat Sci & Engn Rizhao 2767826 Peoples R China Shandong Univ Sch Comp Sci & Technol Qingdao 266510 Peoples R China State Informat Ctr Informatizat & Ind Dev Dept Beijing 100045 Peoples R China
The Internet of Things (IoT) is rapidly gaining ground in future wireless communications. Transmission reliability and latency are two significant measurements for the utilization of the IoT. In this paper, we aim to ... 详细信息
来源: 评论
Performance analysis of distributed deadlock detection algorithms
收藏 引用
IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING 2001年 第4期13卷 623-636页
作者: Lee, S Kim, JL Inchon Natl Univ Educ Dept Comp Educ Kyeyang Gu Inchon 407753 South Korea Littauer Technol Co Ltd Kangnam Ku Seoul South Korea
This paper presents a probabilistic performance analysis of a deadlock detection algorithm in distributed systems. Although there has been extensive study on deadlock detection algorithms in distributed systems, littl... 详细信息
来源: 评论
Reductions and abstractions for formal verification of distributed round-based algorithms
收藏 引用
SOFTWARE QUALITY JOURNAL 2021年 第3期29卷 705-731页
作者: Barbosa, Raul Fonseca, Alcides Araujo, Filipe Univ Coimbra Dept Informat Engn CISUC P-3030290 Coimbra Portugal
Model checking has advanced over the last decades to become an effective formal technique for verifying distributed and concurrent systems. As computers grew in memory and processing capacity, it became possible to ex... 详细信息
来源: 评论
distributed fault simulation algorithms on parallel virtual machine
收藏 引用
VLSI DESIGN 2001年 第1期12卷 81-99页
作者: Ravikumar, CP Jain, V Dod, A Indian Inst Technol Dept Elect Engn New Delhi 110016 India
In this paper, we describe distributed algorithms for combinational fault simulation assuming the classical stuck-at fault model. Our algorithms have been implemented on a network of Sun workstations under the Paralle... 详细信息
来源: 评论
distributed SIMULATED ANNEALING algorithms FOR JOB-SHOP SCHEDULING
收藏 引用
IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS 1995年 第7期25卷 1102-1109页
作者: KRISHNA, K GANESHAN, K RAM, DJ WIPRO INFOTECH BANGALORE 560001KARNATAKAINDIA INDIAN INST TECHNOL DEPT COMP SCI & ENGNMADRAS 600036TAMIL NADUINDIA
Job shop scheduling belongs to the class of NP-hard problems, There are a number of algorithms in literature for finding near optimal solution for the job shop scheduling problem. Many of these algorithms exploit the ... 详细信息
来源: 评论
distributed Continuous-Time algorithms for Optimal Resource Allocation With Time-Varying Quadratic Cost Functions
收藏 引用
IEEE TRANSACTIONS ON CONTROL OF NETWORK SYSTEMS 2020年 第4期7卷 1974-1984页
作者: Wang, Bo Sun, Shan Ren, Wei Beijing Inst Technol Sch Automat Beijing 100081 Peoples R China Univ Calif Riverside Dept Elect & Comp Engn Riverside CA 92521 USA
In this article, we propose distributed continuous-time algorithms to solve the optimal resource allocation problem with certain time-varying quadratic cost functions for multiagent systems. The objective is to alloca... 详细信息
来源: 评论
On the robust synthesis of logical consensus algorithms for distributed intrusion detection
收藏 引用
AUTOMATICA 2013年 第8期49卷 2339-2350页
作者: Fagiolini, Adriano Bicchi, Antonio Univ Palermo DEIM Fac Engn I-90133 Palermo Italy Univ Pisa Fac Engn Interdept Res Ctr E Piaggio I-56100 Pisa Italy Ist Italiano Tecnol Dept Adv Robot I-16163 Genoa Italy
We introduce a novel consensus mechanism by which the agents of a network can reach an agreement on the value of a shared logical vector function depending on binary input events. Based on results on the convergence o... 详细信息
来源: 评论
Optimal Dispersion in Triangular Grids: Achieving Efficiency Without Prior Knowledge  21st
Optimal Dispersion in Triangular Grids: Achieving Efficiency...
收藏 引用
21st International Conference on distributed Computing and Intelligent Technology
作者: Pandit, Himani Pandit, Supantha Dhirubhai Ambani Inst Informat & Commun Technol Gandhinagar Gujarat India
In the dispersion problem, a group of k <= n mobile robots, initially placed on the vertices of an anonymous graph G with n vertices, must redistribute themselves so that each vertex hosts no more than one robot. W... 详细信息
来源: 评论