4843 search results - page 185 / 969 » The Shortcut Problem - Complexity and Approximation |
116
click to vote
DAC
1998
ACM
16 years 4 months ago
1998
ACM
Efficient techniques for the manipulation of Binary Decision Diagrams (BDDs) are key to the success of formal verification tools. Recent advances in reachability analysis and mode...
159
click to vote
ICML
2006
IEEE
2006
IEEE
Automatic basis function construction for approximate dynamic programming and reinforcement learning
15 years 9 months ago
We address the problem of automatically constructing basis functions for linear approximation of the value function of a Markov Decision Process (MDP). Our work builds on results ...
130
click to vote
APPROX
2010
Springer
15 years 4 months ago
2010
Springer
In this paper, we investigate whether a constant round Lasserre Semi-definite Programming (SDP) relaxation might give a good approximation to the UNIQUE GAMES problem. We show tha...
135
click to vote
SODA
2008
ACM
15 years 4 months ago
2008
ACM
We develop a framework for obtaining Fully Polynomial Time Approximation Schemes (FPTASs) for stochastic univariate dynamic programs with either convex or monotone single-period c...
123
Voted
SODA
2004
ACM
15 years 4 months ago
2004
ACM
Given an undirected graph, finding either a minimum 2-edge-connected spanning subgraph or a minimum 2vertex-connected (biconnected) spanning subgraph is MaxSNP-hard. We show that ...