151 search results - page 8 / 31 » The max quasi-independent set Problem |
196
click to vote
CIE
2007
Springer
16 years 25 days ago
2007
Springer
In the framework of parameterized complexity, exploring how one parameter affects the complexity of a different parameterized (or unparameterized problem) is of general interest....
173
click to vote
ESA
2007
Springer
16 years 24 days ago
2007
Springer
We study the problem of scheduling transmissions on the downlink of IEEE 802.16/WiMAX systems that use the OFDMA technology. These transmissions are scheduled using a matrix whose...
147
click to vote
EDBT
2008
ACM
16 years 6 months ago
2008
ACM
In this paper we consider the on-line max and min query auditing problem: given a private association between fields in a data set, a sequence of max and min queries that have alr...
215
click to vote
AI
2005
Springer
15 years 6 months ago
2005
Springer
Maximum Boolean satisfiability (max-SAT) is the optimization counterpart of Boolean satisfiability (SAT), in which a variable assignment is sought to satisfy the maximum number of...
185
click to vote
PPDP
2010
Springer
15 years 5 months ago
2010
Springer
The presence of uncertainty in the real world makes robustness to be a desired property of solutions to constraint satisfaction problems. Roughly speaking, a solution is robust if...