We present the first efficient approach to global routing that takes spacing-dependent costs into account and provably finds a near-optimum solution including these costs. We sh...
We present a fast and efficient combinatorial algorithm to simultaneously identify the candidate locations as well as the sizes of the buffers driving a clock mesh. Due to the hi...
Recently, it has been proven that evolutionary algorithms produce good results for a wide range of combinatorial optimization problems. Some of the considered problems are tackled...
Benjamin Doerr, Anton Eremeev, Christian Horoba, F...
Cylindrical algebraic decomposition is one of the most important tools for computing with semi-algebraic sets, while triangular decomposition is among the most important approache...
Changbo Chen, Marc Moreno Maza, Bican Xia, Lu Yang
This paper discusses the concept of using head and facial feature tracking as an input mechanism for mobile devices. We present our concept and ideas, along with preliminary findi...
Kathryn Carnegie, Stuart Fleming, Esfandiar Ammira...