Sciweavers

502 search results - page 6 / 101
» Monotone Approximation of Decision Problems
Sort
View
ENTCS
2008
97views more  ENTCS 2008»
13 years 10 months ago
An Algorithm for Approximating the Satisfiability Problem of High-level Conditions
The satisfiability problem is the fundamental problem in proving the conflict-freeness of specifications, or in finding a counterexample for an invalid statement. In this paper, w...
Karl-Heinz Pennemann
FOCS
2009
IEEE
14 years 5 months ago
Symmetry and Approximability of Submodular Maximization Problems
Abstract— A number of recent results on optimization problems involving submodular functions have made use of the ”multilinear relaxation” of the problem [3], [8], [24], [14]...
Jan Vondrák
ORL
2008
90views more  ORL 2008»
13 years 10 months ago
Optimal bundle pricing with monotonicity constraint
We consider the problem to sell items to a set of bidders. Bidders bid on bundles of items, and each item's availability is unbounded, like for digital goods. We need to dete...
Alexander Grigoriev, Joyce van Loon, Maxim Sviride...
PE
2010
Springer
129views Optimization» more  PE 2010»
13 years 9 months ago
Optimal monotone forwarding policies in delay tolerant mobile ad-hoc networks
—In this paper we describe a framework for the optimal control of delay tolerant mobile ad hoc networks where multiple classes of nodes co-exist. We specialize the description of...
Eitan Altman, Tamer Basar, Francesco De Pellegrini
WIOPT
2010
IEEE
13 years 9 months ago
Optimal monotone forwarding policies in delay tolerant mobile ad hoc networks with multiple classes of nodes
—In this paper we describe a framework for the optimal control of delay tolerant mobile ad hoc networks where multiple classes of nodes co-exist. We specialize the description of...
Francesco De Pellegrini, Eitan Altman, Tamer Basar