Displaying similar documents to “SPECIAL ISSUE ON PERFORMANCE ANALYSIS ANDSYNTHESIS OF COMPLEX NETWORKED SYSTEMSWITH COMMUNICATION SCHEDULINGPART II: CONTROL”

Minimization of communication expenditure for seasonal products

Igor Bykadorov, Andrea Ellero, Elena Moretti (2002)

RAIRO - Operations Research - Recherche Opérationnelle

Similarity:

We consider a firm that sells seasonal goods. The firm seeks to reach a fixed level of goodwill at the end of the selling period, with the minimum total expenditure in promotional activities. We consider the linear optimal control problem faced by the firm which can only control the communication expenditure rate; communication is performed by means of advertising and sales promotion. Goodwill and sales levels are considered as state variables and word-of-mouth effect and saturation...

Minimization of communication expenditure for seasonal products

Igor Bykadorov, Andrea Ellero, Elena Moretti (2010)

RAIRO - Operations Research

Similarity:

We consider a firm that sells seasonal goods. The firm seeks to reach a fixed level of goodwill at the end of the selling period, with the minimum total expenditure in promotional activities. We consider the linear optimal control problem faced by the firm which can only control the communication expenditure rate; communication is performed by means of advertising and sales promotion. Goodwill and sales levels are considered as state variables and word-of-mouth effect and saturation...

Event-triggered observer-based tracking control for leader-follower multi-agent systems

Pengxiao Zhang, Jinhuan Wang (2016)

Kybernetika

Similarity:

This paper considers the consensus tracking problem for a class of leader-follower multi-agent systems via event-triggered observer-based control. In our set-up, only a subset of the followers can obtain some relative information on the leader. Assume that the leader's control input is unknown for the followers. In order to track such a leader, we design two novel event-triggered observer-based control strategies, one centralized and the other distributed. One can prove that under the...

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...