2450 search results - page 36 / 490 » Time Mapping with Hypergraphs |
HPDC
2006
IEEE
15 years 3 months ago
2006
IEEE
This paper addresses the problem of efficient execution of a batch of data-intensive tasks with batch-shared I/O behavior, on coupled storage and compute clusters. Two scheduling...
APPROX
2004
Springer
15 years 3 months ago
2004
Springer
A simple first moment argument shows that in a randomly chosen k-SAT formula with m clauses over n boolean variables, the fraction of satisfiable clauses is 1−2−k +o(1) as m/...
GLVLSI
2003
IEEE
15 years 3 months ago
2003
IEEE
The MINCE heuristic for variable-ordering [1] successfully reduces the size of BDDs and can accelerate SAT-solving. Applications to reachability analysis have also been successful...
DAWAK
2006
Springer
15 years 1 months ago
2006
Springer
We consider the problem of concurrent execution of multiple frequent itemset queries. If such data mining queries operate on overlapping parts of the database, then their overall I...
FOCS
2006
IEEE
15 years 1 months ago
2006
IEEE
We consider random 3CNF formulas with n variables and m clauses. It is well known that when m > cn (for a sufficiently large constant c), most formulas are not satisfiable. How...