Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 3 of 3 for “"Min-Sum"”.
-
Algorithms for flows and disjoint paths in planar graphs
… in near-linear time when the number of terminals is fixed and the capacities are polynomially bounded. As a byproduct, we get the first algorithm to solve the vertex-disjoint S-T paths problem in near-linear time when the number of terminals is fixed but greater than 2. We also modify our …
-
A Hardware Generator for Factor Graph Applications
… contemporary 802.11n decoders, have been examined as a verification of the system and as a demonstration of its capabilities. As a further demonstration, the framework has been applied to construct a Sudoku solver.
-
Algorithms for Rectangular Robot Motion Planning
… instances where the robot(s) and obstacles are assumed to have simple but realistic geometric properties with the goal of describing algorithms that are provably efficient and/or compute high-quality solutions. A frequent aspect of our work is to suppose that the input objects (robots and/or …