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 20 of 53 for “"maximum flow"”.

  1. Algorithms for connectivity problems in undirected graphs : maximum flow and minimun [kappa]-way cut.

    … two connectivity problems on undirected graphs: maximum flow and minimum k-way cut. The maximum flow problem asks about the connectivity between two specified nodes. A traditional approach is to search for augmenting paths. We explore the possibility of restricting the set of edges in which we …

    mit Repository record for Algorithms for connectivity problems in undirected graphs : maximum flow and minimun [kappa]-way cut. (opens in a new tab)

  2. Iterative methods, combinatorial optimization, and linear programming beyond the universal barrier

    … linear programming to linear system solving to maximum flow. Key results in this thesis include the following: -- Linear Programming: We provide the first general improvement to both the running time and convergence rate of polynomial time algorithms for solving linear programs in over 15 years. …

    mit Repository record for Iterative methods, combinatorial optimization, and linear programming beyond the universal barrier (opens in a new tab)

  3. Effect of Printing Parameters on the Structure and Properties of 316l Stainless Steel

    … the perpendicular surface exhibited high maximum flow stress with a low strain whereas the parallel surface had lower maximum flow stress with a high strain. For the individual printing parameters, any combination of parameters that gives a finer microstructure showed higher flow stress …

    york Repository record for Effect of Printing Parameters on the Structure and Properties of 316l Stainless Steel (opens in a new tab)

  4. Flow Optimization in Dynamic and Continuous Networks (Polymatroids, Submodular, Max-Flow Min-Cut)

    … is designated to be the destination, and a (tau)-maximum flow is defined to be a routing assignment which maximizes the amount of commodity reaching the destination before time (tau). The key discovery used to solve the problem is that a routing assignment has minimum delay if and only if it is a …

    uiuc Repository record for Flow Optimization in Dynamic and Continuous Networks (Polymatroids, Submodular, Max-Flow Min-Cut) (opens in a new tab)

  5. Faster algorithms for convex and combinatorial optimization

    … ... time randomized algorithm for solving the maximum flow problem on directed graphs with m edges and n vertices. This improves upon the previous fastest running time of achieved over 15 years ago by Goldberg and Rao. --Maximum Flow Problem: We obtain one of the first almost-linear time …

    mit Repository record for Faster algorithms for convex and combinatorial optimization (opens in a new tab)

  6. Ουροδυναμική αξιολόγηση της εγχειρητικής διόρθωσης της γυναικείας ακράτειας ούρων με τις τεχνικές Stamey και Burch

    … in a significant statistical decrease of the maximum flow rate and increase of the functional urethral length and of the maximum closure pressure. More specifically, it was found that the Burch colposuspension results in a greater change of the maximum flow rate and of the functional urethral …

    greece Repository record for Ουροδυναμική αξιολόγηση της εγχειρητικής διόρθωσης της γυναικείας ακράτειας ούρων με τις τεχνικές Stamey και Burch (opens in a new tab)

  7. Parameterized Relaxations for Circuits and Graphs

    … on n vertices, and are tasked with computing the maximum flow between each pair of vertices in G. Despite significant research on the problem, the fastest algorithm for APC in dense directed graphs is the naive n⁴⁺ᵒ⁽¹⁾ time approach, which simply runs a fast maximum f low algorithm separately for …

    mit Repository record for Parameterized Relaxations for Circuits and Graphs (opens in a new tab)

  8. Network security and min-cost max-flow problem

    … operations research problems such as the maximum flow problem, the shortest path problem, and the network interdiction problem. However, in environments where network components are subject to adversarial failures, the network operator needs to strategically allocate at least some of her …

    mit Repository record for Network security and min-cost max-flow problem (opens in a new tab)

  9. Topics in Optimization and Sparse Linear Systems

    … Electrostatics, Electromagnetics, Ground Water Flow, and Diffusion (with or without reaction) when they are discretized using finite differences. They also arise in discrete problems like Network Flow Problems (Assignment, Maximum Flow, and Minimum Cost Flow), Large Resistive Networks, and …

    uiuc Repository record for Topics in Optimization and Sparse Linear Systems (opens in a new tab)

  10. Quantitative information-flow tracking for real systems

    An information-flow security policy constrains a computer system's end-to-end use of information, even as it is transformed in computation. For instance, a policy would not just restrict what secret data could be revealed directly, but restrict any output that might allow inferences about the …

    mit Repository record for Quantitative information-flow tracking for real systems (opens in a new tab)

  11. Effect of circumferential groove casing treatment parameters on axial compressor flow range

    The impact on compressor flow range of circumferential casing grooves of varying groove depth, groove axial location, and groove axial extent is assessed against that of a smooth casing wall using computational experiments. The computed results show that maximum range improvement is obtained for a …

    mit Repository record for Effect of circumferential groove casing treatment parameters on axial compressor flow range (opens in a new tab)

  12. Improving traffic signal performance using high-resolution data

    … work on the oversaturation severity indices, a maximum-flow based approach to manage oversaturated intersections is developed. The proposed model maximizes the discharging capacity along oversaturated routes, while satisfying the constraints on available green times. We show that a simple …

    umn Repository record for Improving traffic signal performance using high-resolution data (opens in a new tab)

  13. Airflow limitation in croup

    This thesis investigates a mechanism for air flow limitation in children with croup. Croup is a common condition affecting many young children. Infection (usually viral) causes swelling of the mucosa in the subglottic region of the airway with consequent narrowing of the airway. Although …

    cape-town Repository record for Airflow limitation in croup (opens in a new tab)

  14. Robust network computation

    … are discussed, including ones for clustering, maximum flow, and synchronization. We discuss the use of agents in our model, and give new agent-based algorithms for census and biconnectivity. Inspired by the balancing model, we look at two problems in more depth.

    mit Repository record for Robust network computation (opens in a new tab)

  15. Thermal hydraulic analysis of hydride fuels in BWR's

    … the design limits imposed, critical heat flux, maximum flow velocity and pressure drop constrain only pin array geometry and diameter. It is shown that applicable uranium oxide and hydride fuel limits are both met within the constraints imposed by these three limits which were applied.

    mit Repository record for Thermal hydraulic analysis of hydride fuels in BWR's (opens in a new tab)

  16. Towards Data-Driven I/O Load Balancing in Extreme-Scale Storage Systems

    … and applies Markov chain modeling and a dynamic maximum flow algorithm to decide where data should be placed in a load-balanced fashion. Evaluation using a realistic system simulator shows that our approach yields better load balancing, which in turn can help yield higher end-to-end performance.

    vt Repository record for Towards Data-Driven I/O Load Balancing in Extreme-Scale Storage Systems (opens in a new tab)

  17. Embedded Passivated-Electrode Insulator-Based Dielectrophoretic Chromatography

    … device, allowing identification during constant flow. Another method is through mass parallel channels which each individually operate as a standard DEP particle trapping device. This allows for the summation of the maximum flow through the device due to its design layout.

    vt Repository record for Embedded Passivated-Electrode Insulator-Based Dielectrophoretic Chromatography (opens in a new tab)

  18. ΒΕΛΤΙΣΤΗ ΕΚΜΕΤΑΛΛΕΥΣΗ ΓΕΩΘΕΡΜΙΚΟΥ ΠΕΔΙΟΥ ΧΑΜΗΛΗΣ ΕΝΘΑΛΠΙΑΣ ΜΕ ΣΥΣΤΗΜΑ ΠΗΓΑΔΙΩΝ

    … IN CHAPTER SIX APPROXIMATE CALCULATION OF THE MAXIMUM FLOW-RATE OF A DOUBLET (WHICH IS THE "ESTABLISHED" WELL SYSTEM) IS ILLUSTRATED, BASED ON THE LIMITATIONS IMPOSED BY BREAKTHROUGH TIME AND WATER LEVEL DRAWDOWN. CHAPTER SEVEN INCLUDES A DETAILED STUDY OF DOUBLET AND QUADRUPLET, LEADING TO A …

    greece Repository record for ΒΕΛΤΙΣΤΗ ΕΚΜΕΤΑΛΛΕΥΣΗ ΓΕΩΘΕΡΜΙΚΟΥ ΠΕΔΙΟΥ ΧΑΜΗΛΗΣ ΕΝΘΑΛΠΙΑΣ ΜΕ ΣΥΣΤΗΜΑ ΠΗΓΑΔΙΩΝ (opens in a new tab)

  19. Combinatorial incremental problems

    … problems, including e/2e-1approximation for the maximum weight matching problem, and a e/e+1 approximation for submodular valuations. In Chapter 4 we introduce a discrete-concavity property that allows us to give constant approximation guarantees to several problems, including an asymptotic …

    mit Repository record for Combinatorial incremental problems (opens in a new tab)

Page 1 of 3