434 search results - page 35 / 87 » Improved Algorithms for the 2-Vertex Disjoint Paths Problem |
121
click to vote
JCP
2007
14 years 11 months ago
2007
Abstract— We describe a general method to transform a non-Markovian sequential decision problem into a supervised learning problem using a K-bestpaths algorithm. We consider an a...
102
click to vote
TVLSI
1998
14 years 11 months ago
1998
Abstract— The growing popularity of look-up table (LUT)based field programmable gate arrays (FPGA’s) has renewed the interest in functional or Roth–Karp decomposition techni...
113
click to vote
ICALP
2010
Springer
15 years 4 months ago
2010
Springer
Some of the currently best-known approximation algorithms for network design are based on random sampling. One of the key steps of such algorithms is connecting a set of source nod...
IPCO
1998
15 years 1 months ago
1998
We introduce a gain-scaling technique for the generalized maximum ow problem. Using this technique, we present three simple and intuitive polynomial-time combinatorialalgorithms fo...
CORR
2012
Springer
13 years 7 months ago
2012
Springer
Identifying and controlling bias is a key problem in empirical sciences. Causal diagram theory provides graphical criteria for deciding whether and how causal effects can be iden...