1477 search results - page 51 / 296 » Random Convex Programs |
NIPS
2007
13 years 10 months ago
2007
We combine three threads of research on approximate dynamic programming: sparse random sampling of states, value function and policy approximation using local models, and using lo...
SAT
2005
Springer
14 years 2 months ago
2005
Springer
We introduce two incomplete polynomial time algorithms to solve satisfiability problems which both use Linear Programming (LP) techniques. First, the FlipFlop LP attempts to simul...
STOC
2009
ACM
14 years 9 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...
OOPSLA
2010
Springer
13 years 7 months ago
2010
Springer
Testing is among the most effective tools available for finding bugs. Still, we know of no automatic technique for generating test cases that expose bugs involving a combination ...
EUC
2005
Springer
14 years 2 months ago
2005
Springer
Abstract. For the security technology that has been achieved with software in the computer system and the protection of the intellectual property right of software, software protec...