486 search results - page 63 / 98 » Parallel Algorithms for Relational Coarsest Partition Proble... |
ASPDAC
2005
ACM
13 years 9 months ago
2005
ACM
Abstract— A disjoint support decomposition (DSD) is a representation of a Boolean function F obtained by composing two or more simpler component functions such that the component...
IPPS
1998
IEEE
13 years 12 months ago
1998
IEEE
Using a directed acyclic graph (dag) model of algorithms, we solve a problem related to precedenceconstrained multiprocessor schedules for array computations: Given a sequence of ...
COORDINATION
2008
Springer
13 years 9 months ago
2008
Springer
Abstract. The notion of session is fundamental in service oriented applications, as it separates interactions between different instances of the same service, and it groups togethe...
GECCO
2009
Springer
14 years 2 months ago
2009
Springer
This paper introduces a new component based model that makes it relatively simple to prove that certain types of landscapes are elementary. We use the model to reconstruct proofs ...
IPPS
2007
IEEE
14 years 2 months ago
2007
IEEE
The growing complexity of modern processors has made the development of highly efficient code increasingly difficult. Manually developing highly efficient code is usually expen...