„communication complexity“

Suchergebnisse

1.000+ Treffer

• Effects of workload, work complexity, and repeated alerts on alert fatigue in a clinical decision support system
  Ancker, Jessica S. ; Edwards, Alison ; Nosal, Sarah ; Hauser, Diane ; Mauer, Elizabeth ; Kaushal, Rainu
• Gaming Prediction Markets: Equilibrium Strategies with a Market Maker
  Chen, Yiling ; Dimitrov, Stanko ; Sami, Rahul ; Reeves, Daniel M. ; Pennock, David M. ; Hanson, Robin ; Fortnow, Lance ; Gonen, Rica
• Byzantine Consensus Is Θ(n²): The Dolev-Reischuk Bound Is Tight Even in Partial Synchrony!
  Civit, Pierre ; Dzulfikar, Muhammad Ayaz ; Gilbert, Seth ; Gramoli, Vincent ; Guerraoui, Rachid ; Komatovic, Jovan ; Vidigueira, Manuel 2022 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Online Multistage Subset Maximization Problems
  Bampis, Evripidis ; Escoffier, Bruno ; Schewior, Kevin ; Teiller, Alexandre
• Approximation Schemes for Minimizing the Maximum Lateness on a Single Machine with Release Times Under Non-availability or Deadline Constraints
  Kacem, Imed ; Kellerer, Hans
• Transactions on Large-Scale Data- and Knowledge-Centered Systems XXIV – Special Issue on Database- and Expert-Systems Applications
  Hameurlain, Abdelkader ; Küng, Josef ; Wagner, Roland ; Decker, Hendrik ; Lhotská, Lenka ; Link, Sebastian 2016 Springer Berlin Heidelberg
• Is increasing complexity of algorithms the price for higher accuracy? virtual comparison of three algorithms for tertiary level management of chronic cough in people living with HIV in a low-income country
  Mukabatsinda, Constance ; Nguyen, Jasmine ; Bisig, Bettina ; Lynen, Lutgarde ; Coppens, Yerma D. ; Asiimwe, Anita ; Van Den Ende, Jef
• Short Sequences of Improvement Moves Lead to Approximate Equilibria in Constraint Satisfaction Games
  Caragiannis, Ioannis ; Fanelli, Angelo ; Gravin, Nikolai
• Space Efficient Merging of de Bruijn Graphs and Wheeler Graphs
  Egidi, Lavinia ; Louza, Felipe A. ; Manzini, Giovanni
• A Sub-exponential FPT Algorithm and a Polynomial Kernel for Minimum Directed Bisection on Semicomplete Digraphs
  Madathil, Jayakrishnan ; Sharma, Roohani ; Zehavi, Meirav
• Approximability of Clique Transversal in Perfect Graphs
  Fiorini, Samuel ; Krithika, R. ; Narayanaswamy, N. S. ; Raman, Venkatesh
• Can Finite Samples Detect Singularities of Real-Valued Functions?
  Ben-David, S.
• The Consecutive Ones Submatrix Problem for Sparse Matrices
  Tan, Jinsong ; Zhang, Louxin
• Multiplicative Up-Drift
  Doerr, Benjamin ; Kötzing, Timo
• Finding and Counting Permutations via CSPs
  Berendsohn, Benjamin Aram ; Kozma, László ; Marx, Dániel
• On the Value of Job Migration in Online Makespan Minimization
  Albers, Susanne ; Hellwig, Matthias
• Efficient Computation of Optimal Energy and Fractional Weighted Flow Trade-Off Schedules
  Antoniadis, Antonios ; Barcelo, Neal ; Consuegra, Mario ; Kling, Peter ; Nugent, Michael ; Pruhs, Kirk ; Scquizzato, Michele
• The Induced Separation Dimension of a Graph
  Ziedan, Emile ; Rajendraprasad, Deepak ; Mathew, Rogers ; Golumbic, Martin Charles ; Dusart, Jérémie
• The A Priori Traveling Repairman Problem
  Ee, Martijn ˜vanœ ; Sitters, René
• Low-complexity PTS PAPR reduction scheme for UFMC systems
  Rong, Wang ; Cai, Jingye ; Yu, Xiang