140 search results - page 27 / 28 » Rewriting Numeric Constraint Satisfaction Problems for Consi... |
FOCS
2008
IEEE
14 years 2 days ago
2008
IEEE
We prove that approximating the Max Acyclic Subgraph problem within a factor better than 1/2 is Unique-Games hard. Specifically, for every constant ε > 0 the following holds:...
TWC
2008
13 years 5 months ago
2008
Abstract-- Most existing work on adaptive allocation of subcarriers and power in multiuser OFDM systems has focused on homogeneous traffic consisting of delay-constrained data (gua...
PIMRC
2010
IEEE
13 years 3 months ago
2010
IEEE
This study addresses the general problem of efficient resource management in wireless networks with arbitrary timevarying topologies. Communication channels are assumed to generall...
CPM
2009
Springer
14 years 5 days ago
2009
Springer
The NP-hard Interval Constrained Coloring problem appears in the interpretation of experimental data in biochemistry dealing with protein fragments. Given a set of m integer interv...
SIGSOFT
2007
ACM
14 years 6 months ago
2007
ACM
Atomicity is a desirable property that safeguards application consistency for service compositions. A service composition exhibiting this property could either complete or cancel ...