咨询与建议

限定检索结果

文献类型

  • 4,041 篇 会议
  • 2,175 篇 期刊文献
  • 34 篇 学位论文

馆藏范围

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

日期分布

学科分类号

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

主题

  • 6,250 篇 distributed algo...
  • 547 篇 convergence
  • 545 篇 wireless sensor ...
  • 525 篇 algorithm design...
  • 414 篇 optimization
  • 381 篇 computer science
  • 371 篇 distributed comp...
  • 363 篇 network topology
  • 329 篇 routing
  • 279 篇 resource managem...
  • 219 篇 protocols
  • 212 篇 computational mo...
  • 207 篇 computer network...
  • 202 篇 approximation al...
  • 202 篇 costs
  • 199 篇 fault tolerance
  • 186 篇 ad hoc networks
  • 182 篇 bandwidth
  • 179 篇 peer to peer com...
  • 178 篇 interference

机构

  • 25 篇 carnegie mellon ...
  • 19 篇 univ illinois de...
  • 19 篇 cent south univ ...
  • 19 篇 nanyang technol ...
  • 19 篇 univ cyprus dept...
  • 16 篇 univ liverpool d...
  • 16 篇 ege univ int com...
  • 16 篇 univ minnesota d...
  • 16 篇 mit cambridge ma...
  • 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,145 篇 英文
  • 62 篇 其他
  • 38 篇 中文
  • 3 篇 德文
  • 1 篇 葡萄牙文
  • 1 篇 土耳其文
检索条件"主题词=distributed algorithms"
6250 条 记 录,以下是511-520 订阅
distributed Heterogeneous Transfer Learning
收藏 引用
BIG DATA RESEARCH 2024年 37卷
作者: Mignone, Paolo Pio, Gianvito Ceci, Michelangelo Univ Bari Aldo Moro Dept Comp Sci Bari Italy Natl Interuniv Consortium Informat CINI Big Data Lab Rome Italy Jozef Stefan Inst Dept Knowledge Technol Ljubljana Slovenia
Transfer learning has proved to be effective for building predictive models even in complex conditions with a low amount of available labeled data, by constructing a predictive model for a target domain also using the... 详细信息
来源: 评论
The Cost of Informing Decision-Makers in Multi-Agent Maximum Coverage Problems With Random Resource Values
收藏 引用
IEEE CONTROL SYSTEMS LETTERS 2023年 7卷 2928-2933页
作者: Ferguson, Bryce L. Paccagnan, Dario Marden, Jason R. Univ Calif Santa Barbara Dept Elect & Comp Engn Santa Barbara CA 93106 USA Imperial Coll London Dept Comp London SW7 2AZ England
The emergent behavior of a distributed system is conditioned by the information available to the local decision-makers. Therefore, one may expect that providing decision-makers with more information will improve syste... 详细信息
来源: 评论
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... 详细信息
来源: 评论
Brief Announcement: Low-Bandwidth Matrix Multiplication: Faster algorithms and More General Forms of Sparsity  24
Brief Announcement: Low-Bandwidth Matrix Multiplication: Fas...
收藏 引用
36th ACM Symposium on Parallelism in algorithms and Architectures (SPAA)
作者: Gupta, Chetan Korhonen, Janne H. Studeny, Jan Suomela, Jukka Vahidi, Hossein IIT Roorkee Roorkee Uttar Pradesh India Aalto Univ Espoo Finland
In prior work, Gupta et al. (SPAA 2022) presented a distributed algorithm for multiplying sparse.. x.. matrices, using.. computers. They assumed that the input matrices are uniformly sparse-there are at most.. non-zer... 详细信息
来源: 评论
HPIM-DM: A fast and reliable dense-mode multicast routing protocol
收藏 引用
IET NETWORKS 2023年 第3期12卷 122-151页
作者: Oliveira, Pedro Silva, Alexandre Valadas, Rui Univ Lisbon Inst Telecomunicacoes Piso 10Av Rovisco Pais 1 P-1049001 Lisbon Portugal Univ Lisbon Inst Supe Tecn Piso 10Av Rovisco Pais 1 P-1049001 Lisbon Portugal
The Hard-state Protocol Independent Multicast-Dense Mode (HPIM-DM) multicast routing protocol is proposed. HPIM-DM is a hard-state version of PIM-DM that overcomes its poor convergence times and lack of resilience to ... 详细信息
来源: 评论
Faster Leader Election and Its Applications for Mobile Agents with Parameter Advice  21st
Faster Leader Election and Its Applications for Mobile Agent...
收藏 引用
21st International Conference on distributed Computing and Intelligent Technology
作者: Kshemkalyani, Ajay D. Kumar, Manish Molla, Anisur Rahaman Sharma, Gokarna Univ Illinois Chicago IL USA Indian Inst Technol Madras Chennai Tamil Nadu India Indian Stat Inst Kolkata India Kent State Univ Kent OH USA
Leader election is a critical and extensively studied problem in distributed computing. This paper introduces the study of leader election using mobile agents. Consider n agents initially placed arbitrarily on the nod... 详细信息
来源: 评论
Mobile Agents on Chordal Graphs: Maximum Independent Set and Beyond  21st
Mobile Agents on Chordal Graphs: Maximum Independent Set and...
收藏 引用
21st International Conference on distributed Computing and Intelligent Technology
作者: Kaur, Tanvir Paul, Kaustav Mondal, Kaushik Indian Inst Thelmol Ropar Rupnagar Punjab India
We consider the problem of finding a maximum independent set (MaxIS) of chordal graphs using mobile agents. Suppose n agents are initially placed arbitrarily on the nodes of an n-node chordal graph G = (V, E). Agents ... 详细信息
来源: 评论
Universally-Optimal distributed Exact Min-Cut  22
Universally-Optimal Distributed Exact Min-Cut
收藏 引用
ACM Symposium on Principles of distributed Computing (PODC)
作者: Ghaffari, Mohsen Zuzic, Goran MIT Cambridge MA 02139 USA Swiss Fed Inst Technol Zurich Switzerland
We present a universally-optimal distributed algorithm for the exact weighted min-cut. The algorithm is guaranteed to complete in (O) over tilde (D + root n) rounds on every graph, recovering the recent result of Dory... 详细信息
来源: 评论
AN ALTERNATIVE APPROACH FOR distributed PARAMETER ESTIMATION UNDER GAUSSIAN SETTINGS  32
AN ALTERNATIVE APPROACH FOR DISTRIBUTED PARAMETER ESTIMATION...
收藏 引用
IEEE 32nd International Workshop on Machine Learning for Signal Processing (MLSP)
作者: Das, Subhro IBM Res MIT IBM Watson Lab Cambridge MA 02142 USA
This paper takes a different approach for the distributed linear parameter estimation over a multi-agent network. The parameter vector is considered to be stochastic with a Gaussian distribution. The sensor measuremen... 详细信息
来源: 评论
Efficient Balance Detection for Modular Robots
Efficient Balance Detection for Modular Robots
收藏 引用
2024 International Conference on Intelligent Robots and Systems
作者: Yazidi, Ikrame Piranda, Benoit Ouisse, Morvan Bourgeois, Julien
In this paper, we explore the field of self-reconfigurable modular robots, representing a significant advance in robotic technology. These robots have many capabilities, offering high adaptability and flexibility for ... 详细信息
来源: 评论