Combinatorial optimization problems are often encountered in real-world applications, including logistics, scheduling and ...

Abstract: To achieve maximum throughput in named data networking (NDN) with consideration of fairness among each source-sink pair, we model the routing problem in NDN as a mixed-integer maximum ...

Abstract: Graph cut algorithms are popular in optimization tasks related to min-cut and max-flow problems. However, modern FPGA graph cut algorithm accelerators still need performance and memory ...

Jeremiah Blocki, jblocki+451@cs.cmu.edu: Monday @ 3:30 PM. GHC 7th floor lounge. Students can email me if they want to meet at a different time. Anvesh Komuravelli, anvesh+451@cs.cmu.edu: Friday @ 4 ...