Suchergebnisse - "coverage function"

A Testing Coverage Based SRGM Subject to the Uncertainty of the Operating Environment von Sujit Kumar Pradhan, Anil Kumar, Vijay Kumar

“… In this paper, we have developed a new SRGM incorporating the imperfect debugging and testing coverage function. The proposed …”
Volltext

Algorithms for covering multiple submodular constraints and applications von Chekuri, Chandra, Inamdar, Tanmay, Quanrud, Kent, Varadarajan, Kasturi, Zhang, Zhao

“… We consider the problem of covering multiple submodular constraints. Given a finite ground set N , a weight function w : N → R + , r monotone submodular …”
Volltext

A location-or-routing problem with partial and decaying coverage von Haghi, Maryam, Arslan, Okan, Laporte, Gilbert

“… This paper studies a generalized location-or-routing problem by considering partial coverage of the users according to a distance-decaying coverage function …”
Volltext

Multi-robot Search in a 3D Environment with Intersection System Constraints von Li, Yan-Shuo, Tseng, Kuo-Shih

“… The objective function is submodular and consists of a coverage function to cover environments and a balancing function to efficiently dispatch robots …”
Volltext

Estimating Optimal Product Variety of Firms von Shiozawa, Yoshinori

“… This paper presents a new method for estimating optimal variety for a firm. The estimation depends on the estimation of expected coverage function, which is defined in the paper …”
Volltext

Monotone Submodular Maximization over a Matroid via Non-Oblivious Local Search von Filmus, Yuval, Ward, Justin

“… ], the potential function gives more weight to elements covered multiple times. We generalize this approach from coverage functions to arbitrary monotone submodular functions …”
Volltext

Parameterized Matroid-Constrained Maximum Coverage von Sellier, François

“… In this problem, given a matroid \(\mathcal{M} = (V, \mathcal{I})\) of rank \(k\) on a ground set \(V\) and a coverage function …”
Volltext

A Tight Combinatorial Algorithm for Submodular Maximization Subject to a Matroid Constraint von Filmus, Y., Ward, J.

“… We generalize this approach from coverage functions to arbitrary monotone sub modular functions …”
Volltext

Oblivious and Non-Oblivious Local Search for Combinatorial Optimization von Ward, Justin

“… of constrained linear and monotone submodular maximization. First, we give a new, randomized approximation algorithm for maximizing a monotone submodular function subject to a matroid constraint …”
Volltext

Modeling the Role of Testing Coverage in the Software Reliability Assessment von Kumar, Sudeep, Aggarwal, Anu G., Gupta, Ritu

“… This research takes into consideration several testing coverage functions: exponential, delayed S-shaped …”
Volltext

The One-way Communication Complexity of Submodular Maximization with Applications to Streaming and Robustness von Feldman, Moran, Norouzi-Fard, Ashkan, Svensson, Ola, Zenklusen, Rico

“… We consider the classical problem of maximizing a monotone submodular function subject to a cardinality constraint, which, due to its numerous applications, has recently been studied in various computational models …”
Volltext

A Truthful Randomized Mechanism for Combinatorial Public Projects via Convex Optimization von Dughmi, Shaddin

“… A public planner must choose a subset of these projects, subject to a resource constraint, with the goal of maximizing social welfare …”
Volltext