4843 search results - page 344 / 969 » The Shortcut Problem - Complexity and Approximation |
136
click to vote
WSC
2008
15 years 6 months ago
2008
We consider discrete stochastic optimization problems where the objective function can only be estimated by a simulation oracle; the oracle is defined only at the discrete points....
170
click to vote
SPAA
1999
ACM
15 years 8 months ago
1999
ACM
The time-constrained packet routing problem is to schedule a set of packets to be transmitted through a multinode network, where every packet has a source and a destination (as in ...
150
click to vote
ICML
2004
IEEE
16 years 5 months ago
2004
IEEE
Variational inference methods, including mean field methods and loopy belief propagation, have been widely used for approximate probabilistic inference in graphical models. While ...
130
click to vote
FOCS
2007
IEEE
15 years 10 months ago
2007
IEEE
We continue the recent line of work on the connection between semidefinite programming-based approximation algorithms and the Unique Games Conjecture. Given any boolean 2-CSP (or...
143
Voted
RSKT
2010
Springer
15 years 2 months ago
2010
Springer
Traditionally, membership to the fuzzy-rough lower, resp. upper approximation is determined by looking only at the worst, resp. best performing object. Consequently, when applied t...