咨询与建议

限定检索结果

文献类型

  • 84 篇 会议
  • 8 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

  • 67 篇 工学
    • 62 篇 计算机科学与技术...
    • 35 篇 软件工程
    • 9 篇 信息与通信工程
    • 6 篇 控制科学与工程
    • 4 篇 电气工程
    • 3 篇 网络空间安全
    • 1 篇 材料科学与工程(可...
    • 1 篇 电子科学与技术(可...
    • 1 篇 化学工程与技术
  • 24 篇 理学
    • 22 篇 数学
    • 8 篇 统计学(可授理学、...
    • 3 篇 物理学
    • 2 篇 系统科学
    • 1 篇 化学
  • 3 篇 管理学
    • 2 篇 管理科学与工程(可...
    • 2 篇 工商管理
    • 1 篇 图书情报与档案管...
  • 1 篇 经济学
    • 1 篇 应用经济学

主题

  • 21 篇 distributed comp...
  • 11 篇 distributed comp...
  • 6 篇 computer science
  • 5 篇 distributed algo...
  • 4 篇 causal consisten...
  • 4 篇 cloud computing
  • 3 篇 algorithms
  • 3 篇 computational mo...
  • 3 篇 testing
  • 3 篇 cryptography
  • 2 篇 fault-tolerant d...
  • 2 篇 automated verifi...
  • 2 篇 partial synchron...
  • 2 篇 reliability
  • 2 篇 replication
  • 2 篇 theorem proving
  • 2 篇 approximation al...
  • 2 篇 bandwidth
  • 2 篇 consensus
  • 2 篇 radio network

机构

  • 2 篇 univ oxford oxfo...
  • 2 篇 cispa helmholtz ...
  • 2 篇 univ nova lisboa...
  • 2 篇 mit cambridge ma...
  • 2 篇 ist austria aust...
  • 2 篇 imdea software i...
  • 2 篇 mit comp sci & a...
  • 2 篇 department of co...
  • 2 篇 shanghai jiao to...
  • 2 篇 university of fr...
  • 2 篇 mit csail boston...
  • 2 篇 univ paris 06 un...
  • 2 篇 cnrs ens inria f...
  • 1 篇 department of co...
  • 1 篇 computer science...
  • 1 篇 johns hopkins un...
  • 1 篇 princeton univ d...
  • 1 篇 icsi berkeley ca...
  • 1 篇 univ neuchatel i...
  • 1 篇 département d'in...

作者

  • 4 篇 guerraoui rachid
  • 3 篇 kuhn fabian
  • 3 篇 fauconnier hugue...
  • 3 篇 fraigniaud pierr...
  • 2 篇 lesani mohsen
  • 2 篇 todinca ioan
  • 2 篇 kouznetsov petr
  • 2 篇 dragoi cezara
  • 2 篇 toueg sam
  • 2 篇 ferreira carla
  • 2 篇 delporte-gallet ...
  • 2 篇 zufferey damien
  • 2 篇 gotsman alexey
  • 2 篇 wattenhofer roge...
  • 2 篇 shapiro marc
  • 2 篇 brian harvey
  • 2 篇 chlipala adam
  • 2 篇 luke segars
  • 2 篇 henzinger thomas...
  • 2 篇 tiffany barnes

语言

  • 84 篇 英文
  • 8 篇 其他
检索条件"任意字段=Proceedings of the 43rd ACM Symposium on Principles of Distributed Computing"
92 条 记 录,以下是71-80 订阅
排序:
Efficient synchronous snapshots  04
Efficient synchronous snapshots
收藏 引用
proceedings of the 23rd Annual acm symposium on principles of distributed computing
作者: Brodsky, Alex Fleh, Faith Ellen University of Toronto 10 King's College Road Toronto Canada
A snapshot is an important object in distributed computing whose implementation in asynchronous systems has been studied extensively. It consists of a collection of m > 1 components, each storing a value, and suppo... 详细信息
来源: 评论
Balanced binary trees for ID management and load balance in distributed hash tables  04
Balanced binary trees for ID management and load balance in ...
收藏 引用
proceedings of the 23rd Annual acm symposium on principles of distributed computing
作者: Manku, Gurmeet Singh Computer Science Department Stanford University United States
We present a low-cost, decentralized algorithm for ID management in distributed hash tables (DHTs) managed by a dynamic set of hosts. Each host is assigned an ID in the unit interval [0, 1). At any time, the set of ID... 详细信息
来源: 评论
Communication-efficient leader election and consensus with limited link synchrony  04
Communication-efficient leader election and consensus with l...
收藏 引用
proceedings of the 23rd Annual acm symposium on principles of distributed computing
作者: Aguilera, Marcos K. Delporte-Gallett, Carole Fauconnier, Hugues Toueg, Sam HP Laboratories 1501 Page Mill Road Palo Alto CA 94304 United States LIAFA Université D. Diderot 2 Place Jussieu 75251 Paris Cedex 05 France Department of Computer Science University of Toronto Toronto Ont. Canada
We study the degree of synchrony required to implement the leader election failure detector Ω and to solve consensus in partially synchronous systems. We show that in a system with n processes and up to f process cra... 详细信息
来源: 评论
Efficient algorithms for constructing (1+6, β)-spanners in the distributed and streaming models
Efficient algorithms for constructing (1+6, β)-spanners in ...
收藏 引用
proceedings of the 23rd Annual acm symposium on principles of distributed computing
作者: Elkin, Michael Zhang, Jian Computer Science Department Yale University P.O. Box 208285 New Haven CT 06520-8285 United States
For an unweighted undirected graph G = (V, E), and a pair of positive integers α ≥ 1, β ≥ 0, a subgraph G' = (V, H), H ⊆ E, is called an (α, β)-spanner of G if for every pair of vertices u, v ∈ V, distcG... 详细信息
来源: 评论
On the inherent weakness of conditional synchronization primitives  04
On the inherent weakness of conditional synchronization prim...
收藏 引用
proceedings of the 23rd Annual acm symposium on principles of distributed computing
作者: Fich, Faith Hendler, Danny Shavit, Nir Department of Computer Science University of Toronto Canada School of Computer Science Tel-Aviv University Tel Aviv 69978 Israel Tel-Aviv University Sun Microsystems Laboratories Israel
The "wait-free hierarchy" classifies multiprocessor synchronization primitives according to their power to solve consensus. The classification is based on assigning a number n to each synchronization primiti... 详细信息
来源: 评论
proceedings of the Twenty-First Annual acm symposium on principles of distributed computing
Proceedings of the Twenty-First Annual ACM Symposium on Prin...
收藏 引用
proceedings of the Twenty - First Annual acm symposium on principles of distributed computing PODC 2002
The proceedings contains 43 papers. Topics discussed include distributed computing, scalable queue based spin locks, lexicographically optimal smoothing, replication costs, assignment based partitioning, optimal mobil... 详细信息
来源: 评论
Brief Announcement: Optimally work-competitive scheduling for cooperative computing with merging groups
Brief Announcement: Optimally work-competitive scheduling fo...
收藏 引用
proceedings of the Twenty - First Annual acm symposium on principles of distributed computing PODC 2002
作者: Georgiou, Chryssis Russell, Alexander Shvartsman, Alex A. Department of Computer Science University of Connecticut 191 Auditorium Rd. Unit 3155 Storrs CT 06269 United States
The development of algorithms with guaranteed work efficiency for any pattern of fragmentations and merges of the underlying network is addressed. Current results are discussed for the abstract setting where asynchron... 详细信息
来源: 评论
Auctions with severely bounded communication
Auctions with severely bounded communication
收藏 引用
Annual IEEE symposium on Foundations of Computer Science
作者: L. Blumrosen N. Nisan School of Engineering and Computer Science Hebrew University of Jerusalem Israel
We study auctions with severe bounds on the communication allowed: each bidder may only transmit t bits of information to the auctioneer. We consider both welfare-maximizing and revenue-maximizing auctions under this ... 详细信息
来源: 评论
Global information from local observation
Global information from local observation
收藏 引用
Annual IEEE symposium on Foundations of Computer Science
作者: I. Benjamini L. Lovasz Microsoft Research Limited Redmond WA USA
We observe a certain random process on a graph "locally", i.e., in the neighborhood of a node, and would like to derive information about "global" properties of the graph. For example, what can we ... 详细信息
来源: 评论
On-line confidence machines are well-calibrated
On-line confidence machines are well-calibrated
收藏 引用
Annual IEEE symposium on Foundations of Computer Science
作者: V. Vovk Computer Learning Research Centre Department of Computer Science Royal Holloway University of London Egham Surrey UK
Transductive Confidence Machine (TCM) and its computationally efficient modification, inductive confidence machine (ICM), are ways of complementing machine-learning algorithms with practically useful measures of confi... 详细信息
来源: 评论