16404 search results - page 2624 / 3281 » A set coverage problem |
174
click to vote
SAC
2003
ACM
16 years 14 days ago
2003
ACM
Many information systems are used in a problem solving context. Examples are travel planning systems, catalogs in electronic commerce, or agenda planning systems. They can be made...
211
click to vote
SC
2003
ACM
16 years 14 days ago
2003
ACM
We investigate the use of the multistep successive preconditioning strategies (MSP) to construct a class of parallel multilevel sparse approximate inverse (SAI) preconditioners. W...
189
click to vote
SIGMETRICS
2003
ACM
16 years 14 days ago
2003
ACM
It is common to evaluate scheduling policies based on their mean response times. Another important, but sometimes opposing, performance metric is a scheduling policy’s fairness....
180
click to vote
SPAA
2003
ACM
16 years 14 days ago
2003
ACM
We develop an algorithm for parallel disk sorting, whose I/O cost approaches the lower bound and that guarantees almost perfect overlap between I/O and computation. Previous algor...
200
click to vote
ADBIS
2003
Springer
16 years 13 days ago
2003
Springer
Let a tuple of n objects obeying a query graph (QG) be called the n-tuple. The “Ddistance-value” of this n-tuple is the value of a linear function of distances of the n objects...