咨询与建议

限定检索结果

文献类型

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

馆藏范围

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

日期分布

学科分类号

  • 3,927 篇 工学
    • 2,151 篇 计算机科学与技术...
    • 1,879 篇 电气工程
    • 958 篇 信息与通信工程
    • 912 篇 控制科学与工程
    • 407 篇 软件工程
    • 156 篇 仪器科学与技术
    • 155 篇 电子科学与技术(可...
    • 135 篇 机械工程
    • 70 篇 交通运输工程
    • 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,235 篇 distributed algo...
  • 546 篇 convergence
  • 545 篇 wireless sensor ...
  • 525 篇 algorithm design...
  • 413 篇 optimization
  • 381 篇 computer science
  • 371 篇 distributed comp...
  • 363 篇 network topology
  • 329 篇 routing
  • 279 篇 resource managem...
  • 220 篇 protocols
  • 210 篇 computational mo...
  • 207 篇 computer network...
  • 202 篇 costs
  • 201 篇 approximation al...
  • 199 篇 fault tolerance
  • 185 篇 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 篇 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,130 篇 英文
  • 62 篇 其他
  • 38 篇 中文
  • 4 篇 德文
  • 1 篇 法文
  • 1 篇 葡萄牙文
  • 1 篇 俄文
  • 1 篇 土耳其文
检索条件"主题词=distributed algorithms"
6235 条 记 录,以下是541-550 订阅
排序:
A Practical distributed ADMM Solver for Billion-Scale Generalized Assignment Problems  22
A Practical Distributed ADMM Solver for Billion-Scale Genera...
收藏 引用
31st ACM International Conference on Information and Knowledge Management (CIKM)
作者: Zhou, Jun Qi, Feng Hua, Zhigang Jian, Daohong Liu, Ziqi Wu, Hua Zhejiang Univ Coll Comp Sci Hangzhou Peoples R China Ant Grp Hangzhou Peoples R China Ant Grp Sunnyvale CA USA Ant Grp Beijing Peoples R China
Assigning items to owners is a common problem found in various real-world applications, for example, audience-channel matching in marketing campaigns, borrower-lender matching in loan management, and shopper-merchant ... 详细信息
来源: 评论
The topology of local computing in networks
收藏 引用
Journal of Applied and Computational Topology 2024年 第4期8卷 1069-1098页
作者: Fraigniaud, Pierre Paz, Ami Institut de Recherche en Informatique Fondamentale CNRS Université Paris Cité Laboratoire Interdisciplinaire des Sciences du Numérique CNRS Université Paris-Saclay
For more than three decades, distributed systems have been described and analyzed using topological tools, primarily using two techniques: protocol complexes and directed algebraic topology. In both cases, the conside... 详细信息
来源: 评论
Partition Detection in Byzantine Networks  44
Partition Detection in Byzantine Networks
收藏 引用
44th IEEE International Conference on distributed Computing Systems (ICDCS)
作者: Bromberg, Yerom-David Decouchant, Jeremie Sourisseau, Manon Taiani, Francois Univ Rennes IRISA CNRS INRIA Rennes France Delft Univ Technol Delft Netherlands
Detecting and handling network partitions is a fundamental requirement of distributed systems. Although existing partition detection methods in arbitrary graphs tolerate unreliable networks, they either assume that al... 详细信息
来源: 评论
distributed predefined-time constrained social cost minimization problem under the partial information setting
收藏 引用
SYSTEMS & CONTROL LETTERS 2024年 191卷
作者: Liu, Dongxin Nian, Xiaohong Li, Fan Cent South Univ Sch Automat Changsha 410075 Peoples R China
In this letter, the social cost minimization problem with coupled equality constraints is studied, where the agents endeavor to collaboratively minimize the sum of all local cost functions, and each local cost functio... 详细信息
来源: 评论
A Linear Push-Pull Average Consensus Algorithm for Delay-Prone Networks
A Linear Push-Pull Average Consensus Algorithm for Delay-Pro...
收藏 引用
European Control Conference (ECC)
作者: Makridis, Evagoras Charalambous, Themistoklis Univ Cyprus Sch Engn Dept Elect & Comp Engn CY-1678 Nicosia Cyprus Aalto Univ Sch Elect Engn Dept Elect Engn & Automat Espoo 02150 Finland
In this paper, we address the average consensus problem of multi-agent systems for possibly unbalanced and delay-prone networks with directional information flow. We propose a linear distributed algorithm (referred to... 详细信息
来源: 评论
distributed K-Clustering with Exponential Convergence
Distributed K-Clustering with Exponential Convergence
收藏 引用
American Control Conference (ACC)
作者: Wang, L. Tron, R. Univ Calif Irvine Samueli Sch Engn Irvine CA 92697 USA Boston Univ Coll Engn Boston MA 02215 USA
We consider the problem of distributed K-clustering in a network of N agents where each agent holds a part of a dataset. The goal for the agents is to agree, in a distributed manner, on a set of K cluster centers that... 详细信息
来源: 评论
Optimal Communication Bounds for Classic Functions in the Coordinator Model and Beyond  2024
Optimal Communication Bounds for Classic Functions in the Co...
收藏 引用
56th Annual ACM Symposium on Theory of Computing (STOC)
作者: Esfandiari, Hossein Kacham, Praneeth Mirrokni, Vahab Woodruff, David P. Zhong, Peilin Google London England Carnegie Mellon Univ Pittsburgh PA USA Google Res New York NY USA
In the coordinator model of communication with B servers, given an arbitrary non-negative function f, we study the problem of approximating the sum Sigma i([n]) f(x(i)) up to a 1 +/- epsilon factor. Here the vector x ... 详细信息
来源: 评论
distributed Constrained Optimization Over Unbalanced Directed Networks Using Asynchronous Broadcast-Based Algorithm
收藏 引用
IEEE TRANSACTIONS ON AUTOMATIC CONTROL 2021年 第3期66卷 1102-1115页
作者: Li, Huaqing Lu, Qingguo Chen, Guo Huang, Tingwen Dong, Zhaoyang Southwest Univ Coll Elect & Informat Engn Chongqing Key Lab Nonlinear Circuits & Intelligen Chongqing 400715 Peoples R China Univ New South Wales Sch Elect Engn & Telecommun Sydney NSW 2052 Australia Texas A&M Univ Qatar Sci Program Doha 23874 Qatar
This article focuses on distributed convex optimization problems over an unbalanced directed multiagent (no central coordinator) network with inequality constraints. The goal is to cooperatively minimize the sum of al... 详细信息
来源: 评论
Fast distributed Beamforming without Receiver Feedback  56
Fast Distributed Beamforming without Receiver Feedback
收藏 引用
56th Asilomar Conference on Signals, Systems, and Computers
作者: Chakrabarti, Kushal Bedi, Amrit S. Dagefu, Fikadu T. Twigg, Jeffrey N. Chopra, Nikhil Univ Maryland Dept Elect & Comp Engn College Pk MD 20742 USA Univ Maryland Inst Syst Res College Pk MD 20742 USA DEVCOM Army Res Lab Adelphi MD USA Univ Maryland Dept Mech Engn College Pk MD 20742 USA
distributed multi-agent beampattern matching inherently enables covert communication by constructively combining the transmitted signals at target receivers and forming nulls towards the adversaries. Most existing bea... 详细信息
来源: 评论
Similarity Joins of Sparse Features  24
Similarity Joins of Sparse Features
收藏 引用
ACM International Conference on Management of Data (SIGMOD)
作者: Metwally, Ahmed Shum, Michael Uber Technol Inc Sunnyvale CA 94158 USA MIT Cambridge MA 02139 USA
Identifying all pairs of records from two datasets whose similarity exceeds a given threshold is crucial for data cleaning and clustering. Our work on similarity-joins is motivated by detecting fraud and abuse. We foc... 详细信息
来源: 评论