261 search results - page 12 / 53 » A randomized polynomial-time simplex algorithm for linear pr... |
ISCAS
2005
IEEE
15 years 3 months ago
2005
IEEE
In high-level synthesis, accurate lower-bound estimation is helpful to explore the search space efficiently and to evaluate the quality of heuristic algorithms. For the lower-bound...
WSC
2008
14 years 11 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....
ICALP
2004
Springer
15 years 2 months ago
2004
Springer
Abstract. A simple nonconstructive argument shows that most 3CNF formulas with cn clauses (where c is a large enough constant) are not satisfiable. It is an open question whether ...
FOCS
2009
IEEE
15 years 4 months ago
2009
IEEE
In many settings the power of truthful mechanisms is severely bounded. In this paper we use randomization to overcome this problem. In particular, we construct an FPTAS for multi-...
STOC
2009
ACM
15 years 10 months ago
2009
ACM
Let K be a polytope in Rn defined by m linear inequalities. We give a new Markov Chain algorithm to draw a nearly uniform sample from K. The underlying Markov Chain is the first t...