Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 3 of 3 for “"Budgeted maximum coverage"”.

  1. Social distributed content caching in federated residential networks

    … shared content. We formulate this problem as a Budgeted Maximum Coverage (BMC) problem and we numerically compute the optimal content caching solution. We then propose a low-complexity, distributed heuristic algorithm and use simulation in a synthetic social network scenario to show that the …

    poli-torino Repository record for Social distributed content caching in federated residential networks (opens in a new tab)

  2. Multi-Agent Integer Programming Games with Non-Cooperation and Cooperation

    … the methods are instantiated on edge-weighted budgeted maximum coverage games, including a Minnesota aquatic invasive species (AIS) inspection game with up to 84 counties. Second, Nash-informed planning converts computed equilibria into individual-rationality floors and optimizes social welfare …

    vt Repository record for Multi-Agent Integer Programming Games with Non-Cooperation and Cooperation (opens in a new tab)

  3. An Empirical Analysis of an Algorithm for the Budgeted Maximum Vertex Cover Problem in Trees

    … constraints such as cost and resources. The Budgeted Maximum Vertex Cover is a generalization of covering problems. It models situations with constraints. In this thesis, we empirically analyze an algorithm for the problem of finding the Budgeted Maximum Vertex Cover in undirected trees …

    wvu Repository record for An Empirical Analysis of an Algorithm for the Budgeted Maximum Vertex Cover Problem in Trees (opens in a new tab)