Results 181 to 190 of about 24,103 (206)
Uncertainty assessment for a novel optically shallow water radiometric acquisition platform
Abstract We present a novel motorized platform, a custom‐built jet‐ski designed for acoustic and radiometric measurements in optically shallow coastal waters. This platform integrates in‐water radiometers with single‐beam and multi‐beam acoustic sensors, along with a suite of active and passive instruments (conductivity‐temperature‐depth, fluorescence,
Raphaël Mabit +2 more
wiley +1 more source
Costs of the Supervision, Performance Assessment and Recognition Strategy (SPARS) for improving medicines management in Nepal. [PDF]
Ruisch A +4 more
europepmc +1 more source
Equity in HIV/AIDS services requires optimization of mainstreaming sectors in Ethiopia. [PDF]
Endalamaw A +3 more
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
The budgeted maximum coverage problem
Information Processing Letters, 1999zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Samir Khuller, Anna Moss, Joseph Naor
openaire +3 more sources
The Budgeted Maximum Coverage Problem in Partially Deployed Software Defined Networks
IEEE Transactions on Network and Service Management, 2016Due to the large installed base of distributed legacy networks, software defined networking (SDN) nodes may be required to coexist with legacy nodes to form hybrid networks. It has been shown that such a hybrid network has better performance than a pure legacy network due to smarter transmission scheduling.
Binayak Kar +2 more
openaire +3 more sources
Iterated hyperplane search for the budgeted maximum coverage problem
Expert Systems with Applications, 2023Wei, Zequn, Hao, Jin-Kao
openaire +3 more sources
A PTAS for the budgeted power maximum coverage problem
Theoretical Computer ScienceYuxuan Xu, Yingli Ran
openaire +3 more sources
The Multi-budget Maximum Weighted Coverage Problem
2021In this paper we consider the multi-budget maximum weighted coverage problem, a generalization of the classical maximum coverage problem, where we are given k budgets, a set X of elements, and a set S of bins where any S∈S is a subset of elements of X. Each bin S has its own cost, and each element its own weight.
Francesco Cellinese +3 more
openaire +2 more sources

