Sciweavers

5793 search results - page 855 / 1159
» Individual communication complexity
Sort
View
CORR
2010
Springer
144views Education» more  CORR 2010»
15 years 6 months ago
Stochastic Games for Security in Networks with Interdependent Nodes
This paper studies a stochastic game theoretic approach to security and intrusion detection in communication and computer networks. Specifically, an Attacker and a Defender take pa...
Kien C. Nguyen, Tansu Alpcan, Tamer Basar
CORR
2010
Springer
146views Education» more  CORR 2010»
15 years 6 months ago
Modified Bully Algorithm using Election Commission
-- Electing leader is a vital issue not only in distributed computing but also in communication network [1, 2, 3, 4, 5], centralized mutual exclusion algorithm [6, 7], centralized ...
Muhammad Mahbubur Rahman, Afroza Nahar
CORR
2006
Springer
112views Education» more  CORR 2006»
15 years 6 months ago
High-level synthesis under I/O Timing and Memory constraints
The design of complex Systems-on-Chips implies to take into account communication and memory access constraints for the integration of dedicated hardware accelerator. In this paper...
Philippe Coussy, Gwenolé Corre, Pierre Bome...
DC
2006
15 years 6 months ago
Performing work in broadcast networks
We consider the problem of how to schedule t similar and independent tasks to be performed in a synchronous distributed system of p stations communicating via multiple-access chan...
Bogdan S. Chlebus, Dariusz R. Kowalski, Andrzej Li...
177
Voted
ENTCS
2006
120views more  ENTCS 2006»
15 years 6 months ago
Timers for Distributed Systems
We deal with temporal aspects of distributed systems, introducing and studying a new model called timed distributed -calculus. This model extends distributed -calculus with timers...
Gabriel Ciobanu, Cristian Prisacariu