1644 search results - page 127 / 329 » Finding Dominators in Practice |
AIPS
2008
13 years 11 months ago
2008
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...
ISSA
2004
13 years 10 months ago
2004
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...
TJS
2002
13 years 8 months ago
2002
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...
CSCW
2004
ACM
14 years 2 months ago
2004
ACM
Researchers seeking alternatives to traditional desktop computers have begun exploring the potential collaborative benefits of digital tabletop displays. However, there are still ...
STOC
2005
ACM
14 years 9 months ago
2005
ACM
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...