6181 search results - page 649 / 1237 » Transactional Cluster Computing |
196
click to vote
CADE
2009
Springer
16 years 8 months ago
2009
Springer
This paper is concerned with the problem of checking whether a given subset of an unsatisfiable Boolean CNF formula takes part in the basic causes of the inconsistency of . More ...
183
click to vote
SEMWEB
2009
Springer
16 years 1 months ago
2009
Springer
We address the problem of scalable distributed reasoning, proposing a technique for materialising the closure of an RDF graph based on MapReduce. We have implemented our approach o...
209
Voted
ICPR
2008
IEEE
16 years 1 months ago
2008
IEEE
Graph structures have been proved important in high level-vision since they can be used to represent structural and relational arrangements of objects in a scene. One of the probl...
182
click to vote
PDP
2007
IEEE
16 years 1 months ago
2007
IEEE
Heterogeneous networks of workstations have rapidly become a cost-effective computing solution in many application areas. This paper develops several highly innovative parallel al...
196
click to vote
ISHPC
2003
Springer
16 years 15 days ago
2003
Springer
Most cluster systems used in high performance computing do not allow process relocation at run-time. Finding an allocation that results in minimal completion time is NP-hard and (n...