— We examine the problem of partitioning a square into convex polygons which are as circular as possible. Circular means that the polygon’s aspect ratio is supposed to be near
Schlipf (Sch95) proved that Stable Logic Programming (SLP) solves all NP decision problems. We extend Schlipf’s result to prove that SLP solves all search problems in the class ...
Reconstruction of phylogenetic trees is a fundamental problem in computational biology. While excellent heuristic methods are available for many variants of this problem, new adva...
Srinath Sridhar, Fumei Lam, Guy E. Blelloch, R. Ra...
The construction and maintenance of large and complex software systems depend on the existence of global principles describing the structure and the interaction among its various ...
Abstract. Creativity has become an important factor in recent years, as companies need to be able to quickly adapt to take advantage of new opportunities and handle fast paced chan...