Local search (LS) algorithms are among the most powerful techniques for solving computationally hard problems in combinatorial optimization. These algorithms could be viewed as &q...
In this work we suggest an algorithm that increases the reservation success probability for bursty tra c in high speed networks by adding exibility to the construction of the rout...
—In many application scenarios sensors need to calculate the average of some local values, e.g. of local measurements. A possible solution is to rely on consensus algorithms. In ...
Konstantin Avrachenkov, Mahmoud El Chamie, Giovann...
Current methods for causal structure learning tend to be computationally intensive or intractable for large datasets. Some recent approaches have speeded up the process by first m...