咨询与建议

限定检索结果

文献类型

  • 740 篇 会议
  • 41 篇 期刊文献

馆藏范围

  • 781 篇 电子文献
  • 0 种 纸本馆藏

日期分布

学科分类号

  • 607 篇 工学
    • 593 篇 计算机科学与技术...
    • 344 篇 软件工程
    • 93 篇 信息与通信工程
    • 67 篇 控制科学与工程
    • 64 篇 电气工程
    • 40 篇 网络空间安全
    • 12 篇 电子科学与技术(可...
    • 4 篇 机械工程
    • 4 篇 仪器科学与技术
    • 4 篇 化学工程与技术
    • 3 篇 光学工程
    • 3 篇 材料科学与工程(可...
    • 3 篇 农业工程
    • 2 篇 建筑学
    • 2 篇 生物医学工程(可授...
    • 2 篇 生物工程
  • 234 篇 理学
    • 218 篇 数学
    • 61 篇 统计学(可授理学、...
    • 12 篇 物理学
    • 6 篇 系统科学
    • 4 篇 化学
    • 3 篇 大气科学
    • 3 篇 生物学
  • 48 篇 管理学
    • 28 篇 管理科学与工程(可...
    • 22 篇 图书情报与档案管...
    • 18 篇 工商管理
  • 10 篇 经济学
    • 10 篇 应用经济学
  • 4 篇 法学
    • 3 篇 社会学
    • 1 篇 法学
  • 3 篇 农学
    • 3 篇 作物学
  • 1 篇 医学

主题

  • 224 篇 distributed comp...
  • 35 篇 distributed algo...
  • 26 篇 distributed comp...
  • 25 篇 computer systems...
  • 17 篇 algorithms
  • 15 篇 consensus
  • 15 篇 distributed syst...
  • 14 篇 fault tolerance
  • 12 篇 distributed algo...
  • 11 篇 computer network...
  • 10 篇 message passing
  • 10 篇 approximation al...
  • 9 篇 self-stabilizati...
  • 9 篇 shared memory
  • 8 篇 cloud computing
  • 8 篇 randomized algor...
  • 6 篇 parallel algorit...
  • 6 篇 computation theo...
  • 6 篇 coloring
  • 6 篇 sensor networks

机构

  • 7 篇 ben gurion univ ...
  • 5 篇 technion
  • 5 篇 department of co...
  • 4 篇 technion haifa
  • 4 篇 college of compu...
  • 4 篇 department of co...
  • 4 篇 eth comp engn & ...
  • 4 篇 yale univ dept c...
  • 3 篇 univ of californ...
  • 3 篇 univ of toronto ...
  • 3 篇 computer enginee...
  • 3 篇 cispa helmholtz ...
  • 3 篇 yale university
  • 3 篇 university of fr...
  • 3 篇 technion israel ...
  • 3 篇 hebrew univ jeru...
  • 3 篇 mit cambridge ma...
  • 3 篇 irisa rennes
  • 3 篇 eth zurich
  • 3 篇 cnrs university ...

作者

  • 13 篇 kuhn fabian
  • 13 篇 awerbuch baruch
  • 13 篇 raynal michel
  • 12 篇 peleg david
  • 12 篇 kutten shay
  • 11 篇 toueg sam
  • 11 篇 patt-shamir boaz
  • 11 篇 wattenhofer roge...
  • 10 篇 guerraoui rachid
  • 10 篇 gafni eli
  • 10 篇 dolev danny
  • 9 篇 elkin michael
  • 9 篇 rajsbaum sergio
  • 9 篇 attiya hagit
  • 8 篇 khandekar rohit
  • 8 篇 pandurangan gopa...
  • 8 篇 aspnes james
  • 8 篇 fraigniaud pierr...
  • 7 篇 korman amos
  • 7 篇 herlihy maurice

语言

  • 774 篇 英文
  • 6 篇 其他
  • 1 篇 中文
检索条件"任意字段=Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing"
781 条 记 录,以下是121-130 订阅
排序:
A distributed algorithm for gathering many fat mobile robots in the plane  13
A distributed algorithm for gathering many fat mobile robots...
收藏 引用
2013 acm symposium on principles of distributed computing, PODC 2013
作者: Agathangelou, Chrysovalandis Georgiou, Chryssis Mavronicolas, Marios Department of Computer Science University of Cyprus CY-1678 Nicosia Cyprus
We revisit the problem of gathering autonomous robots in the plane. In particular, we consider non-transparent unit-disc robots (i.e., fat) in an asynchronous setting with vision as the only means of coordination and ... 详细信息
来源: 评论
What can be decided locally without identifiers  13
What can be decided locally without identifiers
收藏 引用
2013 acm symposium on principles of distributed computing, PODC 2013
作者: Fraigniaud, Pierre Göös, Mika Korman, Amos Suomela, Jukka CNRS University Paris Diderot France Department of Computer Science University of Toronto Canada Helsinki Institute for Information Technology HIIT Department of Computer Science University of Helsinki Finland
Do unique node identifiers help in deciding whether a network G has a prescribed property P? We study this question in the context of distributed local decision, where the objective is to decide whether G has property... 详细信息
来源: 评论
Tango: distributed Data Structures over a Shared Log  13
Tango: Distributed Data Structures over a Shared Log
收藏 引用
24th acm symposium on Operating Systems principles (SOSP)
作者: Balakrishnan, Mahesh Malkhi, Dahlia Wobber, Ted Wu, Ming Prabhakaran, Vijayan Wei, Michael Davis, John D. Rao, Sriram Zou, Tao Zuck, Aviad Microsoft Res Silicon Valley Mountain View CA 94043 USA Microsoft Res Asia Beijing Peoples R China Microsoft Redmond WA USA Univ Calif San Diego San Diego CA 92103 USA Cornell Univ Ithaca NY 14853 USA Tel Aviv Univ Tel Aviv Israel
distributed systems are easier to build than ever with the emergence of new, data-centric abstractions for storing and computing over massive datasets. However, similar abstractions do not exist for storing and access... 详细信息
来源: 评论
Sparrow: distributed, Low Latency Scheduling  13
Sparrow: Distributed, Low Latency Scheduling
收藏 引用
24th acm symposium on Operating Systems principles (SOSP)
作者: Ousterhout, Kay Wendell, Patrick Zaharia, Matei Stoica, Ion Univ Calif Berkeley Berkeley CA 94720 USA
Large-scale data analytics frameworks are shifting towards shorter task durations and larger degrees of parallelism to provide low latency. Scheduling highly parallel jobs that complete in hundreds of milliseconds pos... 详细信息
来源: 评论
Brief announcement: Parameterized model checking of fault-tolerant distributed algorithms by abstraction
Brief announcement: Parameterized model checking of fault-to...
收藏 引用
2013 acm symposium on principles of distributed computing, PODC 2013
作者: John, Annu Konnov, Igor Schmid, Ulrich Veith, Helmut Widder, Josef TU Wien Austria
We introduce an automated method for parameterized verification of fault-tolerant distributed algorithms. It rests on a novel parametric interval abstraction (PIA) technique, which works for systems with multiple para... 详细信息
来源: 评论
Brief announcement: Deterministic self-stabilizing leader election with O(loglog n)-bits
Brief announcement: Deterministic self-stabilizing leader el...
收藏 引用
2013 acm symposium on principles of distributed computing, PODC 2013
作者: Blin, Lélia Tixeuil, Sébastien Université d'Evry Val d'Essonne LIP6-CNRS UMR 7606 France UPMC Sorbonne Universités LIP6-CNRS UMR 7606 Institut Universitaire de France France
This paper focuses on compact deterministic self-stabilizing solutions for the leader election problem. Self-stabilization is a versatile approach to withstand any kind of transient failures. Leader election is a fund... 详细信息
来源: 评论
Programming Models for High-Performance computing  13
Programming Models for High-Performance Computing
收藏 引用
13th IEEE/acm International symposium on Cluster, Cloud, and Grid computing (CCGrid)
作者: Snir, Marc Argonne Natl Lab Math & Comp Sci Div Argonne IL 60439 USA
The first version of the MPI standard was released in November 1993. At the time, many of the authors of this standard, myself included, viewed MPI as a temporary solution, to be used until it is replaced by a good pr... 详细信息
来源: 评论
Early-deciding consensus is expensive  13
Early-deciding consensus is expensive
收藏 引用
2013 acm symposium on principles of distributed computing, PODC 2013
作者: Dolev, Danny Lenzen, Christoph Hebrew University of Jerusalem Edmond Safra Campus 91904 Jerusalem Israel Massachusetts Institute of Technology 32 Vassar Street Cambridge 02139 United States
In consensus, the n nodes of a distributed system seek to take a consistent decision on some output, despite up to t of them crashing or even failing maliciously, i.e., behaving "Byzantine". It is known that... 详细信息
来源: 评论
Efficient distributed source detection with limited bandwidth  13
Efficient distributed source detection with limited bandwidt...
收藏 引用
2013 acm symposium on principles of distributed computing, PODC 2013
作者: Lenzen, Christoph Peleg, David Massachusetts Institute of Technology 32 Vassar Street Cambridge 02139 United States Dept. of Computer Science and Applied Math. Weizmann Institute of Science 76100 Rehovot Israel
Given a simple graph G = (V, E) and a set of sources SCV, denote for each node v Ε V by L(∞) the lexicographically ordered list of distance/source pairs (d(s, v), s), where s Ε S. For integers d, k Ε NU{∞}, we co... 详细信息
来源: 评论
On the complexity of universal leader election  13
On the complexity of universal leader election
收藏 引用
2013 acm symposium on principles of distributed computing, PODC 2013
作者: Kutten, Shay Pandurangan, Gopal Peleg, David Robinson, Peter Trehan, Amitabh Faculty of IE and M Technion Haifa 32000 Israel Div. of Mathematical Sciences Nanyang Technological Univ. Singapore 637371 Singapore Dept. of Computer Science Weizmann Institute Rehovot Israel
Electing a leader is a fundamental task in distributed computing. In its implicit version, only the leader must know who is the elected leader. This paper focuses on studying the message and time complexity of randomi... 详细信息
来源: 评论