Results 211 to 220 of about 229,923 (267)

In communication networks, there are delays, delays... and delays

IFAC Proceedings Volumes, 2003
Abstract This paper investigates the congestion and delay control problem for an elementary communication network component (a source-destination pair connected to a single router), using discrete-time state-space methods. The congestion-induced delay turns out to be a non-linear function of a system with linear dynamics, additive disturbance and ...
Henri-François Raynaud   +2 more
openaire   +1 more source

Delay of Reinforcement and Delay of Punishment in Persuasive Communication

Psychological Reports, 1965
Persuasive communications, which 140 Ss read aloud, included a statement of the opinion to be learned, followed by neutral material, and then by the argument (information supporting the opinion without repeating i t ) . Delay of argument (time interval between opinion statement and argument) was varied either by interrupting reading of neutral material
R F, WEISS, W, BUCHANAN, B, PASAMANICK
openaire   +2 more sources

Consensus on intervals of communication delay

International Journal of Automation and Computing, 2017
This paper brings out a structured methodology for identifying intervals of communication time-delay where consensus in directed networks of multiple agents with high-order integrator dynamics is achieved. It is built upon the stability analysis of a transformed consensus problem which preserves all the nonzero eigenvalues of the Laplacian matrix of ...
Heitor Judiss Savino   +2 more
openaire   +2 more sources

Communication delay

Practical Pre-School, 2000
By the time a child is three, they should have mastered all the skills necessary to communicate with the adults and children in their environment. However, studies show that approximately seven per cent of all children in the UK do not develop those skills.
openaire   +1 more source

ON THE COMPLEXITY OF SCHEDULING WITH COMMUNICATION DELAY AND CONTENTION

Parallel Processing Letters, 1995
We show the NP-Completeness of two processor scheduling with tasks of execution time 1 or 2 units and unit interprocessor communication latency. We develop a model of scheduling in the presence of communication contention, and show the NP-Completeness of two processor scheduling with unit execution time tasks in our model.
M. G. NORMAN   +2 more
openaire   +3 more sources

Home - About - Disclaimer - Privacy