Receiver playout buffers are required to smooth network delay variations for multimedia streams. Playout buffer algorithms such as those commonly used in the Internet, autoregressively measure the network delay and variation and adjust the buffer delay accordingly, to avoid packets arriving too late. In this work, we attempt to adjust the buffer delay based on a prediction of the network delay ...

Newer social multimedia applications, such as Social TV or networked multi-player games, enable independent groups (or clusters) of users to interact among themselvesand share services within the context of simultaneous media content consumption. In such scenarios, concurrently synchronized playout points must be ensured so as not to degrade the user experience on such interaction. We refer to ...

Monte Carlo Tree Search (MCTS) is the state of the art algorithm for General Game Playing (GGP). Playout Policy Adaptation with move Features (PPAF) is a state of the art MCTS algorithm that learns a playout policy online. We propose a simple modification to PPAF consisting in memorizing the learned policy from one move to the next. We test PPAF with memorization (PPAFM) against PPAF and UCT fo...

The end-to-end packet delay is an important performance parameter on the Internet, because it heavily affects the quality of realtime applications. Currently, however, because the packet transmission quality (e.g., transmission delay, jitter, packet loss) may vary dynamically, it is not easy to handle real-time traffic. For UDP-based real-time applications, a smoothing buffer (playout buffer) i...

When media is streamed over best-effort networks, a buffer at the client protects against playout interruptions due to variations in the data arrival rate. While the amount of protection offered grows with the size of the client’s buffer, so does the latency that is introduced. In this paper we show how adaptive media playout (AMP) the variation of the playout speed of media frames depending on...

* 2 The " Arbeitspapiere der GMD – GMD Technical Reports " primarily comprise preliminary publications, specific partial results and complementary material. In the interest of a subsequent final publication the " Arbeitspapiere/Technical Reports " should not be copied. Critical comments would be appreciated by the authors. No part of this publication may be reproduced or further processed in an...

Monte-Carlo tree search is a powerful paradigm for full information games. We present various changes applied to this algorithm to deal with the stochastic game Chinese Dark Chess. We experimented with group-nodes and chance-nodes using various configurations: with different playout policies, with different playout size, with true or evaluated wins. Results show that extending playout size over...