„Network Algorithms“

Suchergebnisse

7.850 Treffer

• An analysis of two related loop-free algorithms for generating integer partitions
  Fenner, T. I. ; Loizou, George
• Selected Papers of the 31st International Workshop on Combinatorial Algorithms, IWOCA 2020
  Gąsieniec, Leszek ; Klasing, Ralf ; Radzik, Tomasz
• Bounded-Angle Minimum Spanning Trees
  Biniaz, Ahmad ; Bose, Prosenjit ; Lubiw, Anna ; Maheshwari, Anil
• Deterministic Treasure Hunt in the Plane with Angular Hints
  Bouchard, Sébastien ; Dieudonné, Yoann ; Pelc, Andrzej ; Petit, Franck
• Largest Chordal and Interval Subgraphs Faster than $$2^n$$ 2 n
  Bliznets, Ivan ; Fomin, Fedor V. ; Pilipczuk, Michał ; Villanger, Yngve
• Transactions on Large-Scale Data- and Knowledge-Centered Systems XXVI – Special Issue on Data Warehousing and Knowledge Discovery
  Hameurlain, Abdelkader ; Küng, Josef ; Wagner, Roland ; Bellatreche, Ladjel ; Mohania, Mukesh 2016 Springer International Publishing
• Complex Networks – Second International Workshop, CompleNet 2010, Rio de Janeiro, Brazil, October 13-15, 2010, Revised Selected Papers
  Costa, Luciano da Fontoura ; Evuskoff, Alexandre ; Mangioni, Giuseppe ; Menezes, Ronaldo 2011 Springer Berlin Heidelberg
• Parameterized Algorithms and Kernels for Rainbow Matching
  Gupta, Sushmita ; Roy, Sanjukta ; Saurabh, Saket ; Zehavi, Meirav
• Universal Reconfiguration of Facet-Connected Modular Robots by Pivots: The O(1) Musketeers
  Akitaya, Hugo A. ; Arkin, Esther M. ; Damian, Mirela ; Demaine, Erik D. ; Dujmović, Vida ; Flatland, Robin ; Korman, Matias ; Palop, Belen ; Parada, Irene ; Renssen, André van ; Sacristán, Vera
• Boyce, D. E./Farhi, A./Weischedel, R., Optimal Subset Selection, Multiple Regression, Interdependence and Optimal Network Algorithms. Berlin‐Heidelberg‐New York. Springer‐Verlag. 1974. 187 S., DM 20,‐. (Lecture Notes in Economics and Mathem. Systems 103)
  Müller, P. H.
• Delay-Robust Routes in Temporal Graphs
  Füchsle, Eugen ; Molter, Hendrik ; Niedermeier, Rolf ; Renken, Malte 2022 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Few Cuts Meet Many Point Sets
  Har-Peled, Sariel ; Jones, Mitchell
• Facility Reallocation on the Line
  Keijzer, Bart ˜deœ ; Wojtczak, Dominik
• Analysis of inter-concept dependencies in disease diagnostic cognitive maps using recurrent neural network and genetic algorithms in time series clinical data for targeted treatment
  Duneja, Aditya ; Puyalnithi, Thendral ; Vankadara, Madhu Viswanatham ; Chilamkurti, Naveen
• A novel time series behavior matching algorithm for online conversion algorithms
  Ahmad, Iftikhar ; Iqbal, Javeria
• Network Planning and Routing Problems over Time: Models, Complexity and Algorithms (Invited Talk)
  Glomb, Lukas ; Hoch, Benno ; Liers, Frauke ; Rösel, Florian 2021 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• An Improved Approximation Algorithm for Knapsack Median Using Sparsification
  Byrka, Jarosław ; Pensyl, Thomas ; Rybicki, Bartosz ; Spoerhase, Joachim ; Srinivasan, Aravind ; Trinh, Khoa
• BFL: a node and edge betweenness based fast layout algorithm for large scale networks
  Hashimoto, Tatsunori B. ; Nagasaki, Masao ; Kojima, Kaname ; Miyano, Satoru
• Swarm, evolutionary, and memetic computing – third international conference ; proceedings
  Panigrahi, Bijaya Ketan ; Das, Swagatam ; Suganthan, Ponnuthurai Nagaratnam ; Nanda, Pradipta Kumar 2012 Springer
• Imitate and optimize modern control algorithms for forestry cranes by means of artificial neural networks
  Marco Wydra ; Andreas Bauer ; Chris Geiger ; Geimer, Marcus