Let A and B be hypergraphs with a common vertex set V . In a (p, q, A ∪ B) Bart-Moe game, the players take turns selecting previously unclaimed vertices of V . The game ends whe...
Dan Hefetz, Michael Krivelevich, Tibor Szabó...
Abstract--In this paper, we propose track routing and optimization for yield (TROY), the first track router for the optimization of yield loss due to random defects. As the probabi...
Abstract-- In this paper, we propose a new method to construct graphical representations of cortical folding patterns by computing skeletons on triangulated cortical surfaces. In o...
Yonggang Shi, Paul M. Thompson, Ivo D. Dinov, Arth...
We propose a new translation from normal logic programs with constraints under the answer set semantics to propositional logic. Given a normal logic program, we show that by addin...
We study exploration problems where a robot has to construct a complete map of an unknown environment using a path that is as short as possible. In the rst problem setting we cons...