— In this paper, we propose an analytical model to capture the dynamics of the RED algorithm. We first develop a system of recursive equations that describes the packet dropping...
How efficiently can we search an unknown environment for a goal in unknown position? How much would it help if the environment were known? We answer these questions for simple poly...
Rudolf Fleischer, Thomas Kamphans, Rolf Klein, Elm...
We design a 0:795 approximation algorithm for the Max-Bisection problem restricted to regular graphs. In the case of three regular graphs our results imply an approximation ratio ...
Refereed conferences require every submission to be reviewed by members of a program committee (PC) in charge of selecting the conference program. There are many software packages...
In the context of musical analysis, we propose an algorithm that automatically induces patterns from polyphonies. We define patterns as “perceptible repetitions in a musical piec...