628 search results - page 7 / 126 » Towards High-Level Programming for Distributed Problem Solvi... |
ICPP
2008
IEEE
15 years 4 months ago
2008
IEEE
Solving large, irregular graph problems efficiently is challenging. Current software systems and commodity multiprocessors do not support fine-grained, irregular parallelism wel...
DASFAA
2009
IEEE
15 years 4 months ago
2009
IEEE
Abstract. In this paper, we propose a novel preference-constrained approach to k-anonymisation. In contrast to the existing works on kanonymisation which attempt to satisfy a minim...
ISLPED
2003
ACM
15 years 2 months ago
2003
ACM
This paper proposes two very fast graph theoretic heuristics for the low power binding problem given fixed number of resources and multiple architectures for the resources. First...
97
Voted
LPNMR
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. Many NP-complete problems can be encoded in the answer set semantics of logic programs in a very concise way, where the encoding reflects the typical “guess and check...
MBEES
2010
14 years 11 months ago
2010
: Integrating architectural elements with a modern programming language is essential to ensure a smooth combination of architectural design and programming. In this position statem...