ENTCS
2007
13 years 4 months ago
2007
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...
SODA
2008
ACM
13 years 6 months ago
2008
ACM
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-...
RECOMB
2010
Springer
13 years 6 months ago
2010
Springer
Abstract. Emerging research demonstrates the potential of proteinprotein interaction (PPI) networks in uncovering the mechanistic bases of cancers, through identification of intera...
ICALP
2010
Springer
13 years 6 months ago
2010
Springer
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...
APPROX
2000
Springer
13 years 9 months ago
2000
Springer
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 ...
COCOON
2007
Springer
13 years 10 months ago
2007
Springer
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 (...
ICIP
2007
IEEE
13 years 11 months ago
2007
IEEE
Practical sparse approximation algorithms (particularly greedy algorithms) suffer two significant drawbacks: they are difficult to implement in hardware, and they are inefficie...
CEC
2007
IEEE
13 years 11 months ago
2007
IEEE
— Several multi-objective evolutionary algorithms compare the hypervolumes of different sets of points during their operation, usually for selection or archiving purposes. The ba...
ICSE
2005
IEEE-ACM
14 years 4 months ago
2005
IEEE-ACM
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 ...
SIGMOD
2005
ACM
14 years 4 months ago
2005
ACM
Data integrated from multiple sources may contain inconsistencies that violate integrity constraints. The constraint repair problem attempts to find "low cost" changes t...