<--- Back to Details
First PageDocument Content
Combinatorial optimization / Formal methods / Combinatorics / Retiming / Maximum flow problem / Flow network / Minimum cut / Cut / Minimum-cost flow problem / Network flow / Graph theory / Mathematics
Date: 2007-07-30 11:41:26
Combinatorial optimization
Formal methods
Combinatorics
Retiming
Maximum flow problem
Flow network
Minimum cut
Cut
Minimum-cost flow problem
Network flow
Graph theory
Mathematics

Microsoft Word - minreg-fmcad-final3.doc

Add to Reading List

Source URL: www.bvsrc.org

Download Document from Source Website

File Size: 155,44 KB

Share Document on Facebook

Similar Documents

Resistive Network Optimal Power Flow: Uniqueness and Algorithms Chee Wei Tan, Senior Member, IEEE, Desmond W. H. Cai, Student Member, IEEE and Xin Lou Abstract—The optimal power flow (OPF) problem minimizes the power l

DocID: 1vid6 - View Document

Introduction Network similarity problem Results Acknowledgements Spectra of the Spike Flow Graphs of Recurrent

DocID: 1veQT - View Document

An Arrow-Hurwicz-Uzawa Type Flow as Least Squares Solver for Network Linear Equations Yang Liu, Christian Lageman, Brian D. O. Anderson, and Guodong Shi∗ arXiv:1701.03908v1 [cs.SY] 14 Jan 2017

DocID: 1uJ5N - View Document

Pipe Network Hand-in Assignment 1 Flow in Water Pipe Network  

DocID: 1uInK - View Document

Machine learning / Artificial intelligence / Learning / Cybernetics / Dimension reduction / Cognition / Model selection / Feature detection / NetFlow / Training /  test /  and validation sets / Support vector machine / Feature selection

Inductive Intrusion Detection in Flow-Based Network Data using One-Class Support Vector Machines Philipp Winter

DocID: 1uIen - View Document