PulseAugur
EN
LIVE 01:58:42
ENTITY maximum coverage problem

maximum coverage problem

PulseAugur coverage of maximum coverage problem — every cluster mentioning maximum coverage problem across labs, papers, and developer communities, ranked by signal.

Show in brief
Total · 30d
0
2 over 90d
Releases · 30d
0
0 over 90d
Papers · 30d
0
2 over 90d
TIER MIX · 90D
TOPICS
RECENT · PAGE 1/1 · 3 TOTAL
  1. TOOL · CL_257969 ·

    New method optimizes multi-agent system performance via utility design

    Researchers have developed a linear programming approach to derive optimal utility functions for multi-agent systems, aiming to improve system performance as measured by the pure price of anarchy (pPoA). This new method…

  2. RESEARCH · CL_195688 ·

    New multitask optimization method for dynamic constraint problems detailed

    Researchers have developed a new multitasking approach for solving monotone submodular optimization problems with dynamic constraints. This method leverages evolutionary multitasking to address multiple related problems…

  3. RESEARCH · CL_08689 ·

    Research on decision tree approximation withdrawn after submission

    A recently withdrawn arXiv paper proposed a polynomial-time algorithm for approximating the uniform decision tree problem. The algorithm achieved an approximation ratio of less than 11.57, improving upon previous greedy…