431 search results - page 5 / 87 » Implementing the maximum of monotone algorithms |
APPROX
2010
Springer
15 years 3 months ago
2010
Springer
Abstract. Given a directed graph G = (V, E) and an integer k 1, a ktransitive-closure-spanner (k-TC-spanner) of G is a directed graph H = (V, EH ) that has (1) the same transitive...
115
click to vote
FOCS
2007
IEEE
15 years 8 months ago
2007
IEEE
Submodular maximization generalizes many important problems including Max Cut in directed/undirected graphs and hypergraphs, certain constraint satisfaction problems and maximum f...
111
Voted
GECCO
2005
Springer
15 years 7 months ago
2005
Springer
Assume a coevolutionary algorithm capable of storing and utilizing all phenotypes discovered during its operation, for as long as it operates on a problem; that is, assume an algo...
122
Voted
SODA
2008
ACM
15 years 3 months ago
2008
ACM
We investigate the problem of monotonicity reconstruction, as defined in [3], in a parallel setting. We have oracle access to a nonnegative real-valued function f defined on domai...
113
click to vote
WINE
2005
Springer
15 years 7 months ago
2005
Springer
We consider the following allocation problem arising in the setting of combinatorial auctions: a set of goods is to be allocated to a set of players so as to maximize the sum of t...