ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 1801.05661
  4. Cited By
A Randomized Exchange Algorithm for Computing Optimal Approximate
  Designs of Experiments

A Randomized Exchange Algorithm for Computing Optimal Approximate Designs of Experiments

17 January 2018
Radoslav Harman
Lenka Filová
Peter Richtárik
ArXivPDFHTML

Papers citing "A Randomized Exchange Algorithm for Computing Optimal Approximate Designs of Experiments"

2 / 2 papers shown
Title
Circuits for robust designs
Circuits for robust designs
R. Fontana
Fabio Rapallo
H. Wynn
16
2
0
21 Jun 2021
On greedy heuristics for computing D-efficient saturated subsets
On greedy heuristics for computing D-efficient saturated subsets
Radoslav Harman
Samuel Rosa
14
11
0
18 May 2019
1