Browsing Journal Articles and Proceedings by Title
Now showing items 57-67 of 67
-
Special issue on DISC 2010
(Springer-Verlag, 2013-06)This special issue of Distributed Computing is based on papers that originally appeared as extended abstracts in the Proceedings of the 24th International Symposium on Distributed Computing (DISC2010), held in Cambridge, ... -
Spike-Based Winner-Take-All Computation: Fundamental Limits and Order-Optimal Circuits
(MIT Press - Journals, 2019)© 2019 Massachusetts Institute of Technology. Winner-take-all (WTA) refers to the neural operation that selects a (typ-ically small) group of neurons from a large neuron pool. It is conjectured to underlie many of the ... -
Storage-Optimized Data-Atomic Algorithms for Handling Erasures and Errors in Distributed Storage Systems
(Institute of Electrical and Electronics Engineers (IEEE), 2016-05)Erasure codes are increasingly being studied in the context of implementing atomic memory objects in large scale asynchronous distributed storage systems. When compared with the traditional replication based schemes, erasure ... -
Structuring Unreliable Radio Networks
(Association for Computing Machinery (ACM), 2011)In this paper we study the problem of building a connected dominating set with constant degree (CCDS) in the dual graph radio network model [4,9,10]. This model includes two types of links: reliable, which always deliver ... -
Superconducting Nanowire Spiking Element for Neural Networks
(American Chemical Society (ACS), 2020)© 2020 American Chemical Society. All rights reserved. As the limits of traditional von Neumann computing come into view, the brain's ability to communicate vast quantities of information using low-power spikes has become ... -
Task Allocation in Ant Colonies
(Springer-Verlag, 2014-08)In this paper we propose a mathematical model for studying the phenomenon of division of labor in ant colonies. Inside this model we investigate how simple task allocation mechanisms can be used to achieve an optimal ... -
Task-structured probabilistic I/O automata
(Elsevier BV, 2018)© 2017 Elsevier Inc. Modeling frameworks such as Probabilistic I/O Automata (PIOA) and Markov Decision Processes permit both probabilistic and nondeterministic choices. In order to use these frameworks to express claims ... -
The abstract MAC layer
(Springer Nature America, Inc, 2011)A diversity of possible communication assumptions complicates the study of algorithms and lower bounds for radio networks. We address this problem by defining an abstract MAC layer. This service provides reliable local ... -
Timeout Order Abstraction for Time-Parametric Verification of Loosely Synchronized Real-Time Distributed Systems
(Artist Consortium, 2009-12)We present timeout order abstraction (TO-abstraction), a technique to systematically abstract a given loosely synchronized real-time distributed system (LSRTDS) into an untimed model. We define the subclass of LSRTDS’s ... -
Trade-offs between selection complexity and performance when searching the plane without communication
(Association for Computing Machinery (ACM), 2014-07)We argue that in the context of biology-inspired problems in computer science, in addition to studying the time complexity of solutions it is also important to study the selection complexity, a measure of how likely a given ... -
A (Truly) Local Broadcast Layer for Unreliable Radio Networks
(Association for Computing Machinery (ACM), 2015-07)In this paper, we implement an efficient local broadcast service for the dual graph model, which describes communication in a radio network with both reliable and unreliable links. Our local broadcast service offers ...
