148 search results - page 18 / 30 » Exploiting Parallelism for Hard Problems in Abstract Argumen... |
EUROPAR
2004
Springer
14 years 26 days ago
2004
Springer
Abstract. Program transformations are one of the most valuable compiler techniques to improve data locality. However, restructuring compilers have a hard time coping with data depe...
AIPS
2008
13 years 9 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...
FMICS
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. Symbolic state-space generators are notoriously hard to parallelise. However, the Saturation algorithm implemented in the SMART verification tool differs from other seque...
SAGT
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. We continue the recently initiated study of the computational aspects of weak saddles, an ordinal set-valued solution concept proposed by Shapley. Brandt et al. gave a po...
AVI
2010
13 years 9 months ago
2010
Advanced visual interfaces, like the ones found in informaualization, intend to offer a view on abstract data spaces to enable users to make sense of them. By mapping data to visu...