„Matching-Problem“

Suchergebnisse

522 Treffer

• Transactions on Large-Scale Data- and Knowledge-Centered Systems XXVIII – Special Issue on Database- and Expert-Systems Applications
  2016 Springer International Publishing
• Transactions on Large-Scale Data- and Knowledge-Centered Systems XXVII – Special Issue on Big Data for Complex Urban Systems
  Hameurlain, Abdelkader ; Küng, Josef ; Wagner, Roland ; Chen, Qimin 2016 Springer Berlin Heidelberg
• Transactions on Large-Scale Data- and Knowledge-Centered Systems XXX – Special Issue on Cloud Computing
  Hameurlain, Abdelkader ; Küng, Josef ; Wagner, Roland ; Schewe, Klaus-Dieter ; Bosa, Karoly 2016 Springer International Publishing
• The Euclidean Matching Problem
  Sicuro, Gabriele 2017 Springer Singapore
• Children in Custody Disputes – Matching Legal Proceedings to Problems
  2024 Springer Nature Switzerland
• Note on Gale’s conjecture in one-sided matching problems
  Anno, Hidekazu
• Knowledge Problems vs Unification and Matching: Dichotomy Results
  Erbatur, Serdar ; Marshall, Andrew M. ; Narendran, Paliath ; Ringeissen, Christophe 2025 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Cost Preserving Dependent Rounding for Allocation Problems
  Rohwedder, Lars ; Rouhani, Arman ; Wennmann, Leo 2025 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• A Nearly Optimal Deterministic Algorithm for Online Transportation Problem
  Harada, Tsubasa ; Itoh, Toshiya 2025 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• A New Impossibility Result for Online Bipartite Matching Problems
  Chierichetti, Flavio ; Giacchini, Mirko ; Panconesi, Alessandro ; Vattani, Andrea 2025 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Complexity of the Directed Robust b‐Matching Problem and Its Variants on Different Graph Classes
  Segschneider, Jenny ; Koster, Arie Marinus 2025 Universitätsbibliothek der RWTH Aachen
• Geometric Bipartite Matching Based Exact Algorithms for Server Problems
  Raghvendra, Sharath ; Shirzadian, Pouyan ; Sowle, Rachita 2025 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Small-Space Algorithms for the Online Language Distance Problem for Palindromes and Squares
  Bathie, Gabriel ; Kociumaka, Tomasz ; Starikovskaya, Tatiana 2023 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• The Dynamic k-Mismatch Problem
  Clifford, Raphaël ; Gawrychowski, Paweł ; Kociumaka, Tomasz ; Martin, Daniel P. ; Uznański, Przemysław 2022 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• The Streaming k-Mismatch Problem: Tradeoffs Between Space and Total Time
  Golan, Shay ; Kociumaka, Tomasz ; Kopelowitz, Tsvi ; Porat, Ely 2020 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Internal Dictionary Matching
  Charalampopoulos, Panagiotis ; Kociumaka, Tomasz ; Mohamed, Manal ; Radoszewski, Jakub ; Rytter, Wojciech ; Waleń, Tomasz
• Pattern Matching and Consensus Problems on Weighted Sequences and Profiles
  Kociumaka, Tomasz ; Pissis, Solon P. ; Radoszewski, Jakub
• Efficient Indexes for Jumbled Pattern Matching with Constant-Sized Alphabet
  Kociumaka, Tomasz ; Radoszewski, Jakub ; Rytter, Wojciech
• Pattern Matching and Consensus Problems on Weighted Sequences and Profiles
  Kociumaka, Tomasz ; Pissis, Solon P. ; Radoszewski, Jakub 2016 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Top dominance and the possibility of strategy-proof stable solutions to matching problems
  Alcalde, José ; Barberà, Salvador