Gesamter Bestand

Auflistung Nach Schlagwort "Primal-dual methods"

Anzeige der Dokumente 1-2 von 2

    • A Fast Timing Separation of Events Algorithm for Concurrent Systems 

      Aimoniotis P., Xiromeritis N., Sotiriou C. (2019)
      In this work, we present a fast, polynomial time implementation of the Timing Separation of Events (TSE) Algorithm, with complexity O(E × (V+E). TSE computation is a fundamental problem in the analysis of event-driven, ...

    • Optimization driven multi-hop network design and experimentation: The approach of the FP7 project OPNEX 

      Choumas, K.; Keranidis, S.; Koutsopoulos, I.; Korakis, T.; Tassiulas, L.; Juraschek, F.; Günes, M.; Baccelli, E.; Misiorek, P.; Szwabe, A.; Salonidis, T.; Lundgren, H. (2012)
      The OPNEX project exemplifies system and optimization theory as the foundations for algorithms that provably maximize capacity of wireless networks. The algorithms termed in abstract network models have been converted to ...