The event B method provides a general framework for modelling both data structures and algorithms. B models are validated by discharging proof obligations ensuring safety properti...
The problem of maximizing a concave function f(x) in a simplex S can be solved approximately by a simple greedy algorithm. For given k, the algorithm can find a point x(k) on a k-...
Abstract. Emerging research demonstrates the potential of proteinprotein interaction (PPI) networks in uncovering the mechanistic bases of cancers, through identification of intera...
Salim A. Chowdhury, Rod K. Nibbe, Mark R. Chance, ...
We study the combinatorial auction (CA) problem, in which m objects are sold to rational agents and the goal is to maximize social welfare. Of particular interest is the special ca...
Motivated by the problem of WDM routing in all–optical networks, we study the following NP–hard problem. We are given a directed binary tree T and a set R of directed paths on ...
Vincenzo Auletta, Ioannis Caragiannis, Christos Ka...
Greedy algorithms are simple, but their relative power is not well understood. The priority framework [5] captures a key notion of “greediness” in the sense that it processes (...
Practical sparse approximation algorithms (particularly greedy algorithms) suffer two significant drawbacks: they are difficult to implement in hardware, and they are inefficie...
Christopher J. Rozell, Don H. Johnson, Richard G. ...
— Several multi-objective evolutionary algorithms compare the hypervolumes of different sets of points during their operation, usually for selection or archiving purposes. The ba...
Greedy algorithms for the construction of software interaction test suites are studied. A framework is developed to evaluate a large class of greedy methods that build suites one ...
Data integrated from multiple sources may contain inconsistencies that violate integrity constraints. The constraint repair problem attempts to find "low cost" changes t...
Philip Bohannon, Michael Flaster, Wenfei Fan, Raje...