392 search results - page 21 / 79 » Maximal Completion |
IPPS
2000
IEEE
14 years 2 months ago
2000
IEEE
In this paper, we consider the problem of nding llpreserving ordering of a sparse symmetric and positive de nite matrix such that the reordered matrix is suitable for parallel fac...
LATIN
2010
Springer
14 years 6 hour ago
2010
Springer
We study the problem of designing truthful algorithms for scheduling a set of tasks, each one owned by a selfish agent, to a set of parallel (identical or unrelated) machines in or...
VLDB
2007
ACM
14 years 10 months ago
2007
ACM
Evaluation of twig queries over probabilistic XML is investigated. Projection is allowed and, in particular, a query may be Boolean. It is shown that for a well-known model of pro...
IPPS
2006
IEEE
14 years 4 months ago
2006
IEEE
A self-stabilizing protocol is a brilliant framework for fault tolerance. It can recover from any number and any type of transient faults and eventually converge to its intended b...
ESWS
2006
Springer
14 years 1 months ago
2006
Springer
Abstract. Despite of their advertisement as task independent representations, the reuse of ontologies in different contexts is difficult. An explanation for this is that when devel...