„Approximate Computing“

Suchergebnisse

307 Treffer

• Computing approximate Nash equilibria in network congestion games with polynomially decreasing cost functions
  Bilò, Vittorio ; Flammini, Michele ; Monaco, Gianpiero ; Moscardelli, Luca
• New constructions of approximately symmetric informationally complete positive operator-valued measures by character sums over Galois rings
  Wang, Gang ; Gao, You ; Xie, Mingyue ; Niu, Minyao
• Enhancing quantum approximate optimization with CNN-CVaR integration
  Cai, Pengnian ; Shen, Kang ; Yang, Tao ; Hu, Yuanming ; Lv, Bin ; Fan, Liuhuan ; Liu, Zeyu ; Hu, Qi ; Chen, Shixian ; Zhu, Yunlai ; Wu, Zuheng ; Dai, Yuehua ; Yang, Fei ; Wang, Jun ; Xu, Zuyu
• Fully Dynamic Sequential and Distributed Algorithms for MAX-CUT
  Wasim, Omer ; King, Valerie 2020 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Exact and Approximate Algorithms for Computing a Second Hamiltonian Cycle
  Deligkas, Argyrios ; Mertzios, George B. ; Spirakis, Paul G. ; Zamaraev, Viktor 2020 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Complexity Lower Bounds for Computing the Approximately-Commuting Operator Value of Non-Local Games to High Precision
  Coudron, Matthew ; Slofstra, William 2019 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Overparameterization: A Connection Between Software 1.0 and Software 2.0
  Carbin, Michael 2019 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Computing Approximate Statistical Discrepancy
  Matheny, Michael ; Phillips, Jeff M. 2018 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Separating Quantum Communication and Approximate Rank
  Anshu, Anurag ; Ben-David, Shalev ; Garg, Ankit ; Jain, Rahul ; Kothari, Robin ; Lee, Troy 2017 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Computing Approximate PSD Factorizations
  Basu, Amitabh ; Dinitz, Michael ; Li, Xin 2016 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Precision Tuning the Rust Memory-Safe Programming Language
  Magnani, Gabriele ; Denisov, Lev ; Cattaneo, Daniele ; Agosta, Giovanni ; Cherubin, Stefano 2024 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Ahead-Of-Real-Time (ART): A Methodology for Static Reduction of Worst-Case Execution Time
  Cattaneo, Daniele ; Magnani, Gabriele ; Cherubin, Stefano ; Agosta, Giovanni 2022 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• The Impact of Precision Tuning on Embedded Systems Performance: A Case Study on Field-Oriented Control
  Magnani, Gabriele ; Cattaneo, Daniele ; Chiari, Michele ; Agosta, Giovanni 2021 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Approximate Systems (Dagstuhl Seminar 21302)
  Darulova, Eva ; Falsafi, Babak ; Gerstlauer, Andreas ; Stanley-Marbell, Phillip
• Approximate and Probabilistic Computing: Design, Coding, Verification (Dagstuhl Seminar 15491)
  Filieri, Antonio ; Kwiatkowska, Marta ; Misailovic, Sasa ; Mytkowicz, Todd
• Determining the type of a solution to the fully pythagorean fuzzy linear equations system: exact, restricted, or relaxed approximate solution
  Ergenecosar, Gizem Temelcan
• Computing Approximate Global Symmetry of Complex Networks with Application to Brain Lateral Symmetry
  Pidnebesna, Anna ; Hartman, David ; Pokorná, Aneta ; Straka, Matěj ; Hlinka, Jaroslav
• In-Memory Implementation of an Approximate Adder with Reduced Latency and Error
  Lakshmi, Vijaya ; Pudi, Vikramkumar ; Reuben, John 2024 Friedrich-Alexander-Universität Erlangen-Nürnberg (FAU)
• INLA $$^+$$ + : approximate Bayesian inference for non-sparse models using HPC
  Abdul Fattah, Esmail ; Van Niekerk, Janet ; Rue, Håvard
• Exact gradient evaluation for adaptive quadrature approximate marginal likelihood in mixed models for grouped data
  Stringer, Alex