Displaying similar documents to “The communication hierarchy of time and space bounded parallel machines”

Probability timed automata for investigating communication processes

Henryk Piech, Grzegorz Grodzki (2015)

International Journal of Applied Mathematics and Computer Science

Similarity:

Exploitation characteristics behaves as a decreasing valors factor (DVF) which can be connected with degradation processes. It is a structure that consists of independent attributes which represent situations generally connected with a given exploitation factor. The multi-attribute structure contains attributes directly and indirectly referring to the main factor. Attribute states, by definition, can only maintain or decrease their values. Such situations are met in security, reliability,...

The Communication Hierarchy of Time and Space Bounded Parallel Machines

Norbert Popély (2010)

RAIRO - Theoretical Informatics and Applications

Similarity:

We describe the communicating alternating machines and their simulation. We show that, in the case of communicating alternating machines which are bounded, simultaneously, by polynomial time and logarithmic space, the use of three communication levels instead of two does not increase computational power of communicating alternating machines. This resolves an open problem [2] concerning the exact position of machines with three communication levels in the hierarchy.

Designing an E-Mail Prototype to Enhance Effective Communication and Task Management: A Case Study

Katz, Adi, Berman, Irit (2011)

Serdica Journal of Computing

Similarity:

This paper deals with communicational breakdowns and misunderstandings in computer mediated communication (CMC) and ways to recover from them or to prevent them. The paper describes a case study of CMC conducted in a company named Artigiani. We observed communication and conducted content analysis of e-mail messages, focusing on message exchanges between customer service representatives (CSRs) and their contacts. In addition to task management difficulties, we identified communication...

Communication Complexity And Linearly Ordered Sets

Mieczysław Kula, Małgorzata Serwecińska (2015)

Annales Mathematicae Silesianae

Similarity:

The paper is devoted to the communication complexity of lattice operations in linearly ordered finite sets. All well known techniques ([4, Chapter 1]) to determine the communication complexity of the infimum function in linear lattices disappoint, because a gap between the lower and upper bound is equal to O(log2 n), where n is the cardinality of the lattice. Therefore our aim will be to investigate the communication complexity of the function more carefully. We consider a family of...

Construction of Very Hard Functions for Multiparty Communication Complexity

Ján Maňuch (2010)

RAIRO - Theoretical Informatics and Applications

Similarity:

We consider the multiparty communication model defined in [4] using the formalism from [8]. First, we correct an inaccuracy in the proof of the fundamental result of [6] providing a lower bound on the nondeterministic communication complexity of a function. Then we construct several very hard functions, , functions such that those as well as their complements have the worst possible nondeterministic communication complexity. The problem to find a particular very hard function...

Parallel Machine Scheduling with Uncertain Communication Delays

Aziz Moukrim, Eric Sanlaville, Frédéric Guinand (2010)

RAIRO - Operations Research

Similarity:

This paper is concerned with scheduling when the data are not fully known before the execution. In that case computing a complete schedule off-line with estimated data may lead to poor performances. Some flexibility must be added to the scheduling process. We propose to start from a partial schedule and to postpone the complete scheduling until execution, thus introducing what we call a stabilization scheme. This is applied to the m machine problem with communication delays: in our...