630 search results - page 40 / 126 » Hardness results for approximating the bandwidth |
119
click to vote
APPROX
2010
Springer
15 years 2 months ago
2010
Springer
We consider optimization problems that can be formulated as minimizing the cost of a feasible solution wT x over an arbitrary combinatorial feasible set F {0, 1}n . For these pro...
118
click to vote
ICTAI
2008
IEEE
15 years 7 months ago
2008
IEEE
—The dynamics of many systems are described by ordinary differential equations (ODE). Solving ODEs with standard methods (i.e. numerical integration) needs a high amount of compu...
125
Voted
SACMAT
2006
ACM
15 years 6 months ago
2006
ACM
We introduce the concept, model, and policy-specific algorithms for inferring new access control decisions from previous ones. Our secondary and approximate authorization model (...
105
Voted
SIGECOM
2010
ACM
15 years 22 days ago
2010
ACM
Cut games and party affiliation games are well-known classes of potential games. Schaffer and Yannakakis showed that computing pure Nash equilibrium in these games is PLScomplete....
152
Voted
SODA
2012
ACM
13 years 3 months ago
2012
ACM
Motivated by online ad allocation, we study the problem of simultaneous approximations for the adversarial and stochastic online budgeted allocation problem. This problem consists...