4894 search results - page 327 / 979 » The Guarding Problem - Complexity and Approximation |
171
click to vote
IPL
2008
15 years 6 months ago
2008
Max-SAT-CC is the following optimization problem: Given a formula in CNF and a bound k, find an assignment with at most k variables being set to true that maximizes the number of ...
149
click to vote
ITA
2007
15 years 6 months ago
2007
We explicit the link between the computer arithmetic problem of providing correctly rounded algebraic functions and some diophantine approximation issues. This allows to get bounds...
189
click to vote
JMLR
2012
13 years 9 months ago
2012
Bisubmodularity extends the concept of submodularity to set functions with two arguments. We show how bisubmodular maximization leads to richer value-of-information problems, usin...
277
Voted
ASPLOS
2009
ACM
16 years 7 months ago
2009
ACM
Miss rate curves (MRCs) are useful in a number of contexts. In our research, online L2 cache MRCs enable us to dynamically identify optimal cache sizes when cache-partitioning a s...
160
click to vote
POPL
2010
ACM
16 years 4 months ago
2010
ACM
Building semantic models that account for various kinds of indirect reference has traditionally been a difficult problem. Indirect reference can appear in many guises, such as hea...