In the planning-as-SAT paradigm there have been numerous recent developments towards improving the speed and scalability of planning at the cost of finding a step-optimal parallel...
Nathan Robinson, Charles Gretton, Duc Nghia Pham, ...
This paper attempts to address the issue of hardening the internal security of an organisation's network by easing its patch management. Traditionally security has been model...
Historically, compilers have operated by applying a fixed set of optimizations in a predetermined order. We call such an ordered list of optimizations a compilation sequence. This...
Keith D. Cooper, Devika Subramanian, Linda Torczon
Researchers seeking alternatives to traditional desktop computers have begun exploring the potential collaborative benefits of digital tabletop displays. However, there are still ...
Stacey D. Scott, M. Sheelagh T. Carpendale, Kori M...
In combinatorial optimization, a popular approach to NP-hard problems is the design of approximation algorithms. These algorithms typically run in polynomial time and are guarante...