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. 1602.07860
  4. Cited By
Probably Approximately Correct Greedy Maximization with Efficient Bounds
  on Information Gain for Sensor Selection
v1v2 (latest)

Probably Approximately Correct Greedy Maximization with Efficient Bounds on Information Gain for Sensor Selection

25 February 2016
Yash Satsangi
Shimon Whiteson
F. Oliehoek
ArXiv (abs)PDFHTML

Papers citing "Probably Approximately Correct Greedy Maximization with Efficient Bounds on Information Gain for Sensor Selection"

Title
No papers