Zobrazeno 1 - 10
of 85
pro vyhledávání: '"Marek Klonowski"'
Autor:
Marek Klonowski, Małgorzata Sulkowska
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol Vol. 17 no. 3, Iss Discrete Algorithms (2016)
We investigate a family of algorithms minimizing energetic effort in random networks computing aggregative functions. In contrast to previously considered models, our results minimize maximal energetic effort over all stations instead of the average
Externí odkaz:
https://doaj.org/article/2a494794bf9c4bc984c86ce502f3922c
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol Vol. 17 no.2, Iss Analysis of Algorithms (2015)
In this paper we present an analysis of some generalization of the classic urn and balls model. In our model each urn has a fixed capacity and initially is filled with white balls. Black balls are added to the system of connected urns and gradually d
Externí odkaz:
https://doaj.org/article/1382aef5c21d4631af106f2266f39386
Publikováno v:
IEEE Communications Letters. 25:1144-1148
This work proposes an average-case performance measurement as a meaningful and non-trivial way of evaluating and comparing queueing protocols on a multiple-access channel (MAC). We prove that Little’s Law holds for this way of measuring latency and
Publikováno v:
Theoretical Computer Science. 810:15-25
In a single-hop radio network, nodes can communicate with each other by broadcasting to a shared wireless channel. In each time slot, all nodes receive feedback from the channel depending on the number of transmitters. In the Beeping Model, each node
Publikováno v:
MASCOTS
Publikováno v:
Ad Hoc Networks. 84:90-106
We consider an ad hoc radio network in which nodes perform some distributed algorithms. We provide a framework, that at the cost of increasing time complexity, prevents an outer, passive adversary from gaining significant information about the execut
In the Group Testing problem, the objective is to learn a subset K of some much larger domain N, using the shortest-possible sequence of queries Q. A feedback to a query provides some information about the intersection between the query and subset K.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b2d3e048f2bc27c73ab489f12dc2971c
Publikováno v:
ICETE (2)
Publikováno v:
Distributed Computing. 32:379-403
An execution of a distributed algorithm is often seen as a game between the algorithm and a conceptual adversary causing specific distractions to the computation. In this work we define a class of ordered adaptive adversaries, which cause distraction
Publikováno v:
International Journal of Information Security. 18:285-304
In this paper, we propose a fault-tolerant privacy-preserving data aggregation protocol which utilizes limited local communication between nodes. As a starting point, we analyze the Binary Protocol presented by Chan et al. Comparing to previous work,