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 ...

Currently each input and output in a nodegraph is their own separate node. This can complicate nodegraphs with many inputs or outputs. It would be interesting to instead have a single "input" node ...

Abstract: This study focuses on the urban transportation system by using the ant colony algorithm and Dijkstra's algorithm, aiming to comprehensively analyze the transportation system by combining ...